{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4CMTJPNSGKIJGOKMFSGOM2N7HP","short_pith_number":"pith:4CMTJPNS","schema_version":"1.0","canonical_sha256":"e09934bdb2329093394c2c8ce669bf3bc8ab52b02e8171bf0994f9d605b1d3e3","source":{"kind":"arxiv","id":"1303.3961","version":2},"attestation_state":"computed","paper":{"title":"Correlation of paths between distinct vertices in a randomly oriented graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Madeleine Leander, Svante Linusson","submitted_at":"2013-03-16T10:08:42Z","abstract_excerpt":"We prove that in a random tournament the events $\\{s\\rightarrow a\\}$ and $\\{t\\rightarrow b\\}$ are positively correlated, for distinct vertices $a,s,b,t \\in K_n.$ It is also proven that the correlation between the events $\\{s\\rightarrow a\\}$ and $\\{t\\rightarrow b\\}$ in the random graphs $G(n,p)$ and $G(n,m)$ with random orientation is positive for every fixed $p>0$ and sufficiently large $n$ (with $m=\\left\\lfloor p \\binom{n}{2}\\right\\rfloor$). We conjecture it to be positive for all $p$ and all $n$. An exact recursion for $\\P(\\{s\\rightarrow a\\} \\cap \\{t\\rightarrow b\\})$ in $\\gnp$ is given."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.3961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-16T10:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"bd8ae5690748851f2db5d2fb7ee6814fcd26e1eb83808d7d4c66dec12ffb559e","abstract_canon_sha256":"9d025fc9ae7fe7065cac369c7c3dc16d8faa2f679692f48d28aaf6e3273fc7e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.374710Z","signature_b64":"kNsn6noXXQMLGlKR7kQ1OS3zPPxwGBAiAbR3Mx0RsfMzH5Pk1CjwNkb0Gj1fOKrKSyeuYo87I6cpUW7fpth4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09934bdb2329093394c2c8ce669bf3bc8ab52b02e8171bf0994f9d605b1d3e3","last_reissued_at":"2026-05-18T03:30:27.374049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.374049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correlation of paths between distinct vertices in a randomly oriented graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Madeleine Leander, Svante Linusson","submitted_at":"2013-03-16T10:08:42Z","abstract_excerpt":"We prove that in a random tournament the events $\\{s\\rightarrow a\\}$ and $\\{t\\rightarrow b\\}$ are positively correlated, for distinct vertices $a,s,b,t \\in K_n.$ It is also proven that the correlation between the events $\\{s\\rightarrow a\\}$ and $\\{t\\rightarrow b\\}$ in the random graphs $G(n,p)$ and $G(n,m)$ with random orientation is positive for every fixed $p>0$ and sufficiently large $n$ (with $m=\\left\\lfloor p \\binom{n}{2}\\right\\rfloor$). We conjecture it to be positive for all $p$ and all $n$. An exact recursion for $\\P(\\{s\\rightarrow a\\} \\cap \\{t\\rightarrow b\\})$ in $\\gnp$ is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3961","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.3961","created_at":"2026-05-18T03:30:27.374131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3961v2","created_at":"2026-05-18T03:30:27.374131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3961","created_at":"2026-05-18T03:30:27.374131+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CMTJPNSGKIJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CMTJPNSGKIJGOKM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CMTJPNS","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP","json":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP.json","graph_json":"https://pith.science/api/pith-number/4CMTJPNSGKIJGOKMFSGOM2N7HP/graph.json","events_json":"https://pith.science/api/pith-number/4CMTJPNSGKIJGOKMFSGOM2N7HP/events.json","paper":"https://pith.science/paper/4CMTJPNS"},"agent_actions":{"view_html":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP","download_json":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP.json","view_paper":"https://pith.science/paper/4CMTJPNS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3961&json=true","fetch_graph":"https://pith.science/api/pith-number/4CMTJPNSGKIJGOKMFSGOM2N7HP/graph.json","fetch_events":"https://pith.science/api/pith-number/4CMTJPNSGKIJGOKMFSGOM2N7HP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP/action/storage_attestation","attest_author":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP/action/author_attestation","sign_citation":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP/action/citation_signature","submit_replication":"https://pith.science/pith/4CMTJPNSGKIJGOKMFSGOM2N7HP/action/replication_record"}},"created_at":"2026-05-18T03:30:27.374131+00:00","updated_at":"2026-05-18T03:30:27.374131+00:00"}