{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SXELO5IYG3MR6VX2TSYXFDJ42S","short_pith_number":"pith:SXELO5IY","canonical_record":{"source":{"id":"1701.08420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T19:23:45Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4fbee7aec28824e28e00850652042a74d85148c390aa37462554ae51719f7fd4","abstract_canon_sha256":"574ce6383e677288e00780314b2e70603d398815fca093926a1a83ce3595b3c2"},"schema_version":"1.0"},"canonical_sha256":"95c8b7751836d91f56fa9cb1728d3cd4b7c5d3175460f451dfc5767cacbcf111","source":{"kind":"arxiv","id":"1701.08420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08420","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08420v2","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08420","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"pith_short_12","alias_value":"SXELO5IYG3MR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SXELO5IYG3MR6VX2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SXELO5IY","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SXELO5IYG3MR6VX2TSYXFDJ42S","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T19:23:45Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4fbee7aec28824e28e00850652042a74d85148c390aa37462554ae51719f7fd4","abstract_canon_sha256":"574ce6383e677288e00780314b2e70603d398815fca093926a1a83ce3595b3c2"},"schema_version":"1.0"},"canonical_sha256":"95c8b7751836d91f56fa9cb1728d3cd4b7c5d3175460f451dfc5767cacbcf111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:05.773674Z","signature_b64":"4c5d2G8gIj0mfIHg5u/d5wEvgybD0Vl0SJJ7YSQ7L2+bNeXQZysczbrGf07sKPUu96/bMBRM9e5uNhyluJtqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c8b7751836d91f56fa9cb1728d3cd4b7c5d3175460f451dfc5767cacbcf111","last_reissued_at":"2026-05-18T00:30:05.773053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:05.773053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08420","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qW7cAeduosvMfMCcRDHKLxGn3IHrzz76FOI2pZYvwjM1vr3yn4UAbuSLJUGazGPrD4pkEwG/UJlrqzHmGGlnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:34:25.142721Z"},"content_sha256":"71c65bedb4795d1e23b376a83c23eab37d07b5219268f73213857652bae981d3","schema_version":"1.0","event_id":"sha256:71c65bedb4795d1e23b376a83c23eab37d07b5219268f73213857652bae981d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SXELO5IYG3MR6VX2TSYXFDJ42S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Networks, Graphical Models, and Exchangeability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alessandro Rinaldo, Kayvan Sadeghi, Steffen Lauritzen","submitted_at":"2017-01-29T19:23:45Z","abstract_excerpt":"We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their theoretical counterparts. We then characterize all possible Markov structures for finitely exchangeable random graphs, thereby identifying a new class of Markov network models corresponding to bidirected Kneser graphs. In particular, we demonstrate that the fundamental property of dissociatedness corresponds to a Markov property for exchangeable networks de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08420","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:30:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epnO+xN99OCRSBorsd2z2TtUDi2emFYD+kFOMfYfBWuyCwdjMUEinkR6VEUkDvSjosQuuvgX56zDHOoV0ZNpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:34:25.143080Z"},"content_sha256":"7e9004ddc312ca613182dcc37270dee0c2942e812d9c7446a4b5dd4ec877ccac","schema_version":"1.0","event_id":"sha256:7e9004ddc312ca613182dcc37270dee0c2942e812d9c7446a4b5dd4ec877ccac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/bundle.json","state_url":"https://pith.science/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T01:34:25Z","links":{"resolver":"https://pith.science/pith/SXELO5IYG3MR6VX2TSYXFDJ42S","bundle":"https://pith.science/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/bundle.json","state":"https://pith.science/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXELO5IYG3MR6VX2TSYXFDJ42S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SXELO5IYG3MR6VX2TSYXFDJ42S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"574ce6383e677288e00780314b2e70603d398815fca093926a1a83ce3595b3c2","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T19:23:45Z","title_canon_sha256":"4fbee7aec28824e28e00850652042a74d85148c390aa37462554ae51719f7fd4"},"schema_version":"1.0","source":{"id":"1701.08420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08420","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08420v2","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08420","created_at":"2026-05-18T00:30:05Z"},{"alias_kind":"pith_short_12","alias_value":"SXELO5IYG3MR","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SXELO5IYG3MR6VX2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SXELO5IY","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7e9004ddc312ca613182dcc37270dee0c2942e812d9c7446a4b5dd4ec877ccac","target":"graph","created_at":"2026-05-18T00:30:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study conditional independence relationships for random networks and their interplay with exchangeability. We show that, for finitely exchangeable network models, the empirical subgraph densities are maximum likelihood estimates of their theoretical counterparts. We then characterize all possible Markov structures for finitely exchangeable random graphs, thereby identifying a new class of Markov network models corresponding to bidirected Kneser graphs. In particular, we demonstrate that the fundamental property of dissociatedness corresponds to a Markov property for exchangeable networks de","authors_text":"Alessandro Rinaldo, Kayvan Sadeghi, Steffen Lauritzen","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T19:23:45Z","title":"Random Networks, Graphical Models, and Exchangeability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08420","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:71c65bedb4795d1e23b376a83c23eab37d07b5219268f73213857652bae981d3","target":"record","created_at":"2026-05-18T00:30:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"574ce6383e677288e00780314b2e70603d398815fca093926a1a83ce3595b3c2","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T19:23:45Z","title_canon_sha256":"4fbee7aec28824e28e00850652042a74d85148c390aa37462554ae51719f7fd4"},"schema_version":"1.0","source":{"id":"1701.08420","kind":"arxiv","version":2}},"canonical_sha256":"95c8b7751836d91f56fa9cb1728d3cd4b7c5d3175460f451dfc5767cacbcf111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95c8b7751836d91f56fa9cb1728d3cd4b7c5d3175460f451dfc5767cacbcf111","first_computed_at":"2026-05-18T00:30:05.773053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:05.773053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4c5d2G8gIj0mfIHg5u/d5wEvgybD0Vl0SJJ7YSQ7L2+bNeXQZysczbrGf07sKPUu96/bMBRM9e5uNhyluJtqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:05.773674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c65bedb4795d1e23b376a83c23eab37d07b5219268f73213857652bae981d3","sha256:7e9004ddc312ca613182dcc37270dee0c2942e812d9c7446a4b5dd4ec877ccac"],"state_sha256":"fefb4bfe85c8afa261d0d4270cc53c6c47bdb8be4c71e1e23cff1a2ad6f32c61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4HBiQbMX+UnodJAMStmGgfx588zZ5eZ8MAqJ6iSZMFq8Qez4tOTJ8Vqr0euaB87p6nI8dWke88KXGEIA0l/CBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:34:25.145523Z","bundle_sha256":"ecbbda22d6de613c7a2a758ca1c7a24c66fda1a7e2140a3bd51361a87f191208"}}