{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7VQKHZ5UPMKZHDG6CQISRF2CR5","short_pith_number":"pith:7VQKHZ5U","schema_version":"1.0","canonical_sha256":"fd60a3e7b47b15938cde14112897428f492593a7e7cf2e3128e412385074c3b5","source":{"kind":"arxiv","id":"1612.05519","version":2},"attestation_state":"computed","paper":{"title":"Edge-exchangeable graphs and sparsity (NIPS 2016)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Diana Cai, Tamara Broderick, Trevor Campbell","submitted_at":"2016-12-16T15:57:28Z","abstract_excerpt":"Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or empty with probability one, whereas many real-world graphs are sparse. We present an alternative notion of exchangeability for random graphs, which we call edge exchangeability, in which the distribution of a graph sequence is invariant to the order of the edges. We demonstrate that edge-exchangeable models, unlike models that are traditionally vertex excha"},"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":"1612.05519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-16T15:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"61cdb06215ca797e9723a8fdb478389853728f99d345d30f0f2319903070f1bb","abstract_canon_sha256":"3721c3ab5825f728f3bcd4ddd24a8bf79104c34dab9699f509f2b9905741ee87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.799274Z","signature_b64":"Rzhu3sYg5+2a4AFYZjGjK+dUxOg7G4/A7SAtA0vkef7zyvAnS10tF4AR8CXR7C6+TEkUQDKgflCi9Fx+q7DQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd60a3e7b47b15938cde14112897428f492593a7e7cf2e3128e412385074c3b5","last_reissued_at":"2026-05-18T00:51:24.798608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.798608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-exchangeable graphs and sparsity (NIPS 2016)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Diana Cai, Tamara Broderick, Trevor Campbell","submitted_at":"2016-12-16T15:57:28Z","abstract_excerpt":"Many popular network models rely on the assumption of (vertex) exchangeability, in which the distribution of the graph is invariant to relabelings of the vertices. However, the Aldous-Hoover theorem guarantees that these graphs are dense or empty with probability one, whereas many real-world graphs are sparse. We present an alternative notion of exchangeability for random graphs, which we call edge exchangeability, in which the distribution of a graph sequence is invariant to the order of the edges. We demonstrate that edge-exchangeable models, unlike models that are traditionally vertex excha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05519","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":"1612.05519","created_at":"2026-05-18T00:51:24.798704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05519v2","created_at":"2026-05-18T00:51:24.798704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05519","created_at":"2026-05-18T00:51:24.798704+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VQKHZ5UPMKZ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VQKHZ5UPMKZHDG6","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VQKHZ5U","created_at":"2026-05-18T12:30:04.600751+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/7VQKHZ5UPMKZHDG6CQISRF2CR5","json":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5.json","graph_json":"https://pith.science/api/pith-number/7VQKHZ5UPMKZHDG6CQISRF2CR5/graph.json","events_json":"https://pith.science/api/pith-number/7VQKHZ5UPMKZHDG6CQISRF2CR5/events.json","paper":"https://pith.science/paper/7VQKHZ5U"},"agent_actions":{"view_html":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5","download_json":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5.json","view_paper":"https://pith.science/paper/7VQKHZ5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05519&json=true","fetch_graph":"https://pith.science/api/pith-number/7VQKHZ5UPMKZHDG6CQISRF2CR5/graph.json","fetch_events":"https://pith.science/api/pith-number/7VQKHZ5UPMKZHDG6CQISRF2CR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5/action/storage_attestation","attest_author":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5/action/author_attestation","sign_citation":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5/action/citation_signature","submit_replication":"https://pith.science/pith/7VQKHZ5UPMKZHDG6CQISRF2CR5/action/replication_record"}},"created_at":"2026-05-18T00:51:24.798704+00:00","updated_at":"2026-05-18T00:51:24.798704+00:00"}