{"id":610,"date":"2026-02-18T21:18:57","date_gmt":"2026-02-18T11:18:57","guid":{"rendered":"https:\/\/stevewatson.info\/blog\/?p=610"},"modified":"2026-02-18T21:18:57","modified_gmt":"2026-02-18T11:18:57","slug":"information-flow","status":"publish","type":"post","link":"https:\/\/stevewatson.info\/blog\/2026\/02\/18\/information-flow\/","title":{"rendered":"Information Flow"},"content":{"rendered":"<p><span style=\"color: #000000;\">There is a fundamental sociological interest in the infrastructure or social conditions that facilitate the distribution of information in a society. Unfortunately, treatments of the \u2018Flow of Information\u2019 in the context of sociological or organizational theory typically refer to the \u2018information channels\u2019 that play that role with minimal if any definition or consideration of the criteria that need to be met in order for anything to play that role, while treatments in the context of Network Theory or in the domain of Logic, Language, and Computation offer only definitions that are irrelevant to the sociological context.<\/span><\/p>\n<p><span style=\"color: #000000;\">Begin with the necessary relevant agent interactions with information.<\/span><\/p>\n<ol>\n<li><span style=\"color: #000000;\"><em><u>Insertion<\/u><\/em><\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">For some proposition <em>p<\/em>, agent <em>x<\/em>\u2208<em>X<\/em>, <em>a<sub>x<\/sub><\/em> \u2208 <em>\u03b1<sub>x<\/sub><\/em> considered as a state transformation such that <em>a<sub>x<\/sub><\/em>(<em>\u03c3<sub>1<\/sub><\/em>) = <em>\u03c3<\/em><em><sub>2<\/sub><\/em> is an <u>Insertion<\/u> of <em>p<\/em> into <em>\u03c3<\/em><em><sub>1<\/sub><\/em> iff<\/span><\/p>\n<ol>\n<li><span style=\"color: #000000;\">(\u2203<em>y<\/em>\u2208<em>X<\/em>)[ (\u2203{<em>x<sub>i<\/sub><\/em>:<em>i <\/em>= 0, \u2026, <em>n<\/em>}\u2282 <em>X<\/em>) (\u2203&lt;<em>a<sub>xi<\/sub><\/em> \u2208<em>\u03b1<\/em><em><sub>xi<\/sub><\/em>: <em>i <\/em>= 0, \u2026, <em>n<\/em>&gt;) [ <em>a<sub>xi<\/sub><\/em>(<em>\u03c3<\/em><em><sub>1+i<\/sub><\/em>) = <em>\u03c3<\/em><em><sub>2+i<\/sub><\/em><em> &amp; a<sub>x0<\/sub> = a<sub>x<\/sub><\/em> ] &amp; <\/span><br \/>\n<span style=\"color: #000000;\"><em>p<\/em> \u2208 <strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><sub>(<\/sub><em><sub>2+<\/sub><\/em><em><sub>n<\/sub><\/em><sub>)<\/sub> \\<strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><em><sub>1<\/sub><\/em> ]<\/span><\/li>\n<li><span style=\"color: #000000;\"><em>B<sub>x<\/sub><\/em> [ \u2018i.\u2019 ] \u2208 <em>q<sub>x<\/sub><\/em><\/span><\/li>\n<li><span style=\"color: #000000;\"><em>D<sub>x<\/sub><\/em> [ \u2018i.\u2019 ] \u2208 <em>q<sub>x<\/sub><\/em><\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">\u00bb <em>An insertion is the deliberate addition to a state of affairs of an item of information that can be made available to some agent by some sequence of state-transforming actions by other agents.<\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>Ins<\/em>(<em>a<sub>x<\/sub><\/em>, <em>p<\/em>, <em>\u03c3<sub>1<\/sub><\/em>).<\/span><\/li>\n<li><span style=\"color: #000000;\">We can also say that <em>x<\/em> <u>Inserts<\/u> <em>p<\/em> into \u03c3<em><sub>1<\/sub><\/em> by <em>a<sub>x<\/sub><\/em> and write <em>In<\/em>(<em>x<\/em>, <em>p<\/em>, \u03c3<em><sub>1<\/sub><\/em>, <em>a<sub>x<\/sub><\/em>)<\/span><\/li>\n<li><span style=\"color: #000000;\">The restriction to available information is justified by the fact that information that is not available to any agent is sociologically inert.<\/span><\/li>\n<li><span style=\"color: #000000;\">The agent making the insertion must be supposed to be intending (desiring and believing) that the information will be sociologically active or else there is no sociological import to the insertion.<\/span><\/li>\n<li><span style=\"color: #000000;\">Note that in the case that <em>n<\/em> = 0, condition (i) is equivalent to<\/span>\n<ul>\n<li><span style=\"color: #000000;\">(\u2203<em>y<\/em>\u2208<em>X<\/em>) <em>GenIv<\/em>(<em>a<sub>x<\/sub><\/em>, <em>\u03c3<sub>1<\/sub><\/em>, <em>p, y<\/em>) or<\/span><\/li>\n<li><span style=\"color: #000000;\">(\u2203<em>y<\/em>\u2208<em>X<\/em>)[ <em>p <\/em>\u2208\u00a0<strong>genIv<\/strong>(<em>a<sub>x<\/sub><\/em>, <em>\u03c3<sub>1<\/sub><\/em>, <em>y<\/em>) ]<\/span><\/li>\n<\/ul>\n<\/li>\n<li><span style=\"color: #000000;\">Refinements to this definition are possible to account for situations in which condition (i) fails, or in which conditions (ii) and (iii) are not required to hold at the time of the action. For example, to take an extreme case, the Voyager spacecraft plaques would not qualify under this definition. Whether these possibilities should be considered need not delay us here.<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">Define an <u>Information Insertion Point<\/u> as a state of affairs, \u03c3<em><sub>1<\/sub><\/em> such that<\/span><\/p>\n<ol>\n<li><span style=\"color: #000000;\">(\u2203<em>p<\/em>\u2208<em>\u2119<\/em>) (\u2203<em>x<\/em>\u2208<em>X<\/em>) (\u2203<em>a<sub>x<\/sub><\/em>\u2208<em>\u03b1<sub>x<\/sub><\/em>) [ <em>a<sub>x<\/sub><\/em>(\u03c3<em><sub>1<\/sub><\/em>) = \u03c3<em><sub>2<\/sub><\/em> &amp;<\/span><\/li>\n<li><span style=\"color: #000000;\">(\u2203<em>y<\/em>\u2208<em>X<\/em>)[ (\u2203{<em>x<sub>i<\/sub><\/em>:<em>i <\/em>= 0, \u2026, <em>n<\/em>} \u2282 <em>X<\/em>) (\u2203&lt;<em>a<sub>xi<\/sub><\/em> \u2208<em>a<\/em><em><sub>xi<\/sub><\/em>: <em>i <\/em>= 0, \u2026, <em>n<\/em>&gt;) [ <em>a<sub>xi<\/sub><\/em>(<em>\u03c3<sub>1+i<\/sub><\/em>) = <em>\u03c3<sub>2+i<\/sub><\/em><em> &amp; a<sub>x0<\/sub> = a<sub>x<\/sub><\/em> ] &amp; <\/span><br \/>\n<span style=\"color: #000000;\"><em>p<\/em> \u2208 <strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><sub>(<\/sub><em><sub>2+<\/sub><\/em><em><sub>n<\/sub><\/em><sub>)<\/sub> \\<strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><em><sub>1<\/sub><\/em> ] &amp;<\/span><\/li>\n<li><span style=\"color: #000000;\"><em>B<sub>x<\/sub><\/em> [ \u2018ii.\u2019 ] \u2208 <em>q<sub>x<\/sub><\/em> ]<\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">\u00bb <em>An information insertion point is a state of affairs to which some agent correctly believes he may add an item of information that can be made available to some agent by some sequence of state-transforming actions by other agents. <\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>IIP<\/em>(<em>s<\/em><em><sub>1<\/sub><\/em>)<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">We shall also define the <u>Information Insertion Point for <em>p<\/em> or <em>P<\/em><\/u> as an insertion point defined for a particular proposition <em>p <\/em>or class of propositions <em>P <\/em>as a state of affairs, <em>\u03c3<sub>1<\/sub><\/em> such that<\/span><\/p>\n<ol>\n<li><span style=\"color: #000000;\">(\u2200<em>p<\/em>\u2208<em>\u2119<\/em>) (\u2203<em>x<\/em>\u2208<em>X<\/em>) (\u2203<em>a<sub>x<\/sub><\/em>\u2208<em>\u03b1<sub>x<\/sub><\/em>) [ <em>a<sub>x<\/sub><\/em>(\u03c3<em><sub>1<\/sub><\/em>) = \u03c3<em><sub>2<\/sub><\/em> &amp;<\/span><\/li>\n<li><span style=\"color: #000000;\">(\u2203<em>y<\/em>\u2208<em>X<\/em>)[ (\u2203{<em>x<sub>i<\/sub><\/em>:<em>i <\/em>= 0, \u2026, <em>n<\/em>} \u2282 <em>X<\/em>) (\u2203&lt;<em>a<sub>xi<\/sub><\/em> \u2208<em>a<\/em><em><sub>xi<\/sub><\/em>: <em>i <\/em>= 0, \u2026, <em>n<\/em>&gt;) [ <em>a<sub>xi<\/sub><\/em>(<em>\u03c3<sub>1+i<\/sub><\/em>) = <em>\u03c3<sub>2+i<\/sub><\/em><em> &amp; a<sub>x0<\/sub> = a<sub>x<\/sub><\/em> ] &amp; <\/span><br \/>\n<span style=\"color: #000000;\"><em>p<\/em> \u2208 <strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><sub>(<\/sub><em><sub>2+<\/sub><\/em><em><sub>n<\/sub><\/em><sub>)<\/sub> \\<strong>Iv<\/strong><em><sub>y,\u03c3<\/sub><\/em><em><sub>1<\/sub><\/em> ] &amp;<\/span><\/li>\n<li><span style=\"color: #000000;\"><em>B<sub>x<\/sub><\/em> [ \u2018ii.\u2019 ] \u2208 <em>q<sub>x<\/sub><\/em> ]<\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">\u00bb <em>An information insertion point for p\/P<\/em> <em>is a state of affairs such that for every proposition of a certain kind some agent correctly believes he may insert that proposition as an item of information that can be made available to some agent by some sequence of state-transforming actions by other agents. <\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Without danger of ambiguity, we may write <em>IIP<\/em>(<em>\u03c3<sub>1<\/sub><\/em>, <em>p<\/em>) when referring to the case for single propositions or <em>IIP<\/em>(<em>\u03c3<\/em><em><sub>1<\/sub><\/em>, <em>P<\/em>) for the case of classes of propositions, and say that <em>\u03c3<\/em><em><sub>1<\/sub><\/em> is an information insertion point for <em>p<\/em> or <em>P<\/em>.<\/span><\/li>\n<\/ul>\n<ol start=\"2\">\n<li><span style=\"color: #000000;\"><em><u>Extraction<\/u><\/em><\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">For some proposition <em>p<\/em>, agent <em>x<\/em>\u2208<em>X<\/em>, state of affairs <em>\u03c3<\/em>, <em>a<sub>x<\/sub><\/em> \u2208 <em>\u03b1<sub>x<\/sub><\/em> is an <u>Extraction<\/u> of <em>p<\/em> from <em>\u03c3<\/em> iff<\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\">(\u2203<em>\u03c9<\/em>)(\u2203<em>h<\/em>)[ <em>Mot<\/em>(<em>\u03c9<\/em>, <em>x<\/em>, <em>h<\/em>, <em>\u03c3<\/em>, <em>a<sub>x<\/sub><\/em>) &amp;<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>Some question \u03c9<\/em><em> motivates x to apply some supposed adduction h on \u03c3<\/em><em>\u00a0using <\/em><em>a<sub>x<\/sub><\/em><\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\"><em>Add<\/em>(<em>a<sub>x<\/sub><\/em>, <em>h<\/em>, <em>\u03c3<\/em>) &amp; <em>h<\/em>(<em>\u03c3<\/em>) = <em>p<\/em>) ]<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>which actually is an adducement applying the adduction h to \u03c3<\/em><em>,<\/em><em> yielding p.<\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>Ext<\/em>(<em>a<sub>x<\/sub><\/em>, <em>p<\/em>, <em>\u03c3<\/em>) and say that <em>a<sub>x<\/sub><\/em> is an extraction of <em>p<\/em> from <em>\u03c3<\/em>.<\/span><\/li>\n<li><span style=\"color: #000000;\">We can also say that <em>x<\/em> <u>Extracts<\/u> <em>p<\/em> from <em>\u03c3<\/em>\u00a0by <em>a<sub>x<\/sub><\/em> and write <em>Ex<\/em>(<em>x<\/em>, <em>p<\/em>, <em>\u03c3<\/em>, <em>a<sub>x<\/sub><\/em>)<\/span><\/li>\n<li><span style=\"color: #000000;\">The agent making the extraction must be supposed to be intending (desiring and believing) the action to adduce information, otherwise the retrieval of information is merely an accidental effect of the action and cannot be part of a sociologically significant process.<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">Define an <u>Information Extraction Point<\/u> as a state of affairs, <em>\u03c3<\/em>\u00a0such that<\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\">(\u2203<em>p<\/em>\u2208<em>\u2119<\/em>) (\u2203<em>x<\/em>\u2208<em>X<\/em>) (\u2203<em>a<sub>x<\/sub><\/em>\u2208<em>a<\/em><em><sub>x<\/sub><\/em>) [ (\u2203<em>\u03c9<\/em>)(\u2203<em>h<\/em>)[ <em>Mot<\/em>(<em>\u03c9<\/em>, <em>x<\/em>, <em>h<\/em>, <em>\u03c3<\/em>, <em>a<sub>x<\/sub><\/em>) &amp; <em>Add<\/em>(<em>a<sub>x<\/sub><\/em>, <em>h<\/em>, <em>\u03c3<\/em>) <\/span><br \/>\n<span style=\"color: #000000;\"><em>\u21d2 h<\/em>(<em>\u03c3<\/em>) = <em>p<\/em>]<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>An information extraction point is a state of affairs from which some agent correctly believes he may extract an item of information that he is motivated to discover that is available to some agent. <\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>IEP<\/em>(<em>\u03c3<\/em>)<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">We shall also define the <u>Information Extraction Point for <em>p<\/em> or <em>P<\/em><\/u> as an insertion point defined for a particular proposition <em>p <\/em>or class of propositions <em>P <\/em>as a state of affairs, <em>\u03c3<\/em>\u00a0such that<\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\">(\u2200<em>p<\/em>\u2208<em>\u2119<\/em>) (\u2203<em>x<\/em>\u2208<em>X<\/em>) (\u2203<em>a<sub>x<\/sub><\/em>\u2208<em>a<\/em><em><sub>x<\/sub><\/em>) [ (\u2203<em>\u03c9<\/em>)(\u2203<em>h<\/em>)[ <em>Mot<\/em>(<em>\u03c9<\/em>, <em>x<\/em>, <em>h<\/em>, <em>\u03c3<\/em>, <em>a<sub>x<\/sub><\/em>) &amp; <em>Add<\/em>(<em>a<sub>x<\/sub><\/em>, <em>h<\/em>, <em>\u03c3<\/em>)<\/span><br \/>\n<span style=\"color: #000000;\">\u21d2<em> h<\/em>(<em>\u03c3<\/em>) = <em>p<\/em>]<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>An information extraction point for p\/P is a state of affairs such that for every proposition of a certain kind some agent correctly believes he may extract that proposition as an item of information that he is motivated to discover that is available to some agent. <\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Without danger of ambiguity, we may write <em>IEP<\/em>(<em>\u03c3<\/em>, <em>p<\/em>) when referring to the case for single propositions or <em>IEP<\/em>(<em>\u03c3<\/em>, <em>P<\/em>) for the case of classes of propositions, and say that <em>\u03c3<\/em>\u00a0is an information extraction point for <em>p<\/em> or <em>P<\/em>.<\/span><\/li>\n<\/ul>\n<ol start=\"3\">\n<li><span style=\"color: #000000;\"><em><u>Transmission<\/u><\/em><\/span><\/li>\n<\/ol>\n<p><span style=\"color: #000000;\">Let <em>p<\/em> be a proposition, <em>\u03c3<\/em><em><sub>1<\/sub><\/em> a state of affairs, such that <em>IIP<\/em>(<em>\u03c3<\/em><em><sub>1<\/sub><\/em>, <em>p<\/em>)<\/span><\/p>\n<p><span style=\"color: #000000;\"><strong><em>\u03c3<\/em><\/strong> = (<em>\u03c3<\/em><em><sub>1<\/sub><\/em>,<em> &#8230;, \u03c3<\/em><em><sub>n+2<\/sub><\/em>) is an <u>Information Arc for <em>p<\/em><\/u> if<\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\">(\u2203&lt;<em>\u03c4<sub>i<\/sub><\/em>: <em>i<\/em> = 0, \u2026, <em>n <\/em>&gt;)[ <em>\u03c4<\/em><em><sub>i<\/sub><\/em>(<em>\u03c3<\/em><em><sub>1+i<\/sub><\/em>) = <em>\u03c3<\/em><em><sub>2+i<\/sub><\/em> &amp;<\/span><br \/>\n<span style=\"color: #000000;\">(\u2203<em>x<\/em>\u2208<em>X<\/em>) (\u2203<em>a<sub>x<\/sub><\/em>\u2208<em>\u03b1<sub>x<\/sub><\/em>)[ <em>In<\/em>(<em>x<\/em>, <em>p<\/em>, <em>\u03c3<\/em><em><sub>1<\/sub><\/em>, <em>a<sub>x<\/sub><\/em>) &amp; <em>\u03c4<\/em><em><sub>0<\/sub><\/em> = <em>a<sub>x<\/sub><\/em> &amp;<\/span><br \/>\n<span style=\"color: #000000;\">~<em>IEP<\/em>(<em>\u03c3<\/em><em><sub>1<\/sub><\/em>, <em>p<\/em>) &amp;<\/span><br \/>\n<span style=\"color: #000000;\"><em>IEP<\/em>(<em>\u03c3<\/em><em><sub>2+n<\/sub><\/em>, <em>p<\/em>) &amp;<\/span><br \/>\n<span style=\"color: #000000;\">(~<em>Ins<\/em>(<em>a<sub>x<\/sub><\/em>, <em>p<\/em>, <em>\u03c3<\/em><em><sub>1<\/sub><\/em>) \u21d2 ~<em>IEP<\/em>(<em>\u03c3<\/em><em><sub>2+n<\/sub><\/em>, <em>p<\/em>)) ]]<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>An information arc for a proposition is a sequence of states of affairs produced by state transformations of an information insertion point at which that proposition has been inserted that ends in an information extraction point for it. <\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>IA<\/em>(<strong><em>\u03c3<\/em><\/strong>, <em>p<\/em>)<\/span><\/li>\n<li><span style=\"color: #000000;\">Note that <em>n<\/em> = 0 is possible, in which case we can talk of a <u>Null Information Arc for <em>p<\/em><\/u>.<\/span><\/li>\n<\/ul>\n<p><span style=\"color: #000000;\">Define an <u>Information Channel<\/u> as a state of affairs <em>\u03c7<\/em>, such that<\/span><\/p>\n<p style=\"padding-left: 40px;\"><span style=\"color: #000000;\">(\u2203<em>P<\/em>\u2282<em>\u2119<\/em>) (\u2200<em>p<\/em>\u2208<em>P<\/em>) (\u2203<strong><em>\u03c3<\/em><\/strong>) [ <em>IA<\/em>(<strong><em>\u03c3<\/em><\/strong>, <em>p<\/em>) &amp;<\/span><br \/>\n<span style=\"color: #000000;\">(\u2200<em>\u03c3<sub>i<\/sub><\/em>\u2208<strong><em>\u03c3<\/em><\/strong>) [<em>\u03c7<\/em> \u2282 <em>\u03c3<\/em><em><sub>i<\/sub><\/em> &amp; (~(<em>\u03c7<\/em> \u2282 <em>\u03c3<\/em><em><sub>i<\/sub><\/em>) \u21d2 ~<em>IIP<\/em>(<em>\u03c3<\/em><em><sub>i<\/sub><\/em>, <em>p<\/em>) &amp; ~<em>IEP<\/em>(<em>\u03c3<\/em><em><sub>i<\/sub><\/em>, <em>p<\/em>)) ]]<\/span><\/p>\n<p><span style=\"color: #000000;\">\u00bb <em>An information channel is a stable state of affairs that facilitates information arcs for a class of propositions as items of information.<\/em><\/span><\/p>\n<ul>\n<li><span style=\"color: #000000;\">Write <em>IC<\/em>(<em>\u03c7<\/em>)<\/span><\/li>\n<li><span style=\"color: #000000;\">We can call <em>P<\/em>\u2282<em>\u2119<\/em> that appears in the definition above the <u>Matter<\/u> of <em>\u03c7<\/em>, and write that M(<em>\u03c7<\/em>)=<em>P<\/em><\/span><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>There is a fundamental sociological interest in the infrastructure or social conditions that facilitate the distribution of information in a society. Unfortunately, treatments of the \u2018Flow of Information\u2019 in the context of sociological or organizational theory typically refer to the \u2018information channels\u2019 that play that role with minimal if any definition or consideration of the [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[28],"tags":[],"class_list":["post-610","post","type-post","status-publish","format-standard","hentry","category-sociology"],"_links":{"self":[{"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/posts\/610","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/comments?post=610"}],"version-history":[{"count":1,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/posts\/610\/revisions"}],"predecessor-version":[{"id":611,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/posts\/610\/revisions\/611"}],"wp:attachment":[{"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/media?parent=610"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/categories?post=610"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/stevewatson.info\/blog\/wp-json\/wp\/v2\/tags?post=610"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}