{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LF452LHGWY3KPB2KJNRVDEHHBY","short_pith_number":"pith:LF452LHG","schema_version":"1.0","canonical_sha256":"5979dd2ce6b636a7874a4b635190e70e13f0ed280e733e2ab4db6b267b5ade70","source":{"kind":"arxiv","id":"1603.06898","version":1},"attestation_state":"computed","paper":{"title":"Edge-exchangeable graphs and sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Diana Cai, Tamara Broderick","submitted_at":"2016-03-22T18:28:09Z","abstract_excerpt":"A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability for random graphs in contrast to the established notion of infinite exchangeability for random graphs --- which has traditionally relied on exchangeability of nodes (rather than edges) in a graph. We show that, unlike node exchangeability, edge exchangeability encompasses models "},"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":"1603.06898","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-22T18:28:09Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"3be2f6a50cface3b9d8e1bbe48ff3965d67cc13c150de2e6d1be3c9498353e00","abstract_canon_sha256":"1d01e445d8a0835eb5f6dc350513ae7237cf0605fe0853136858f8d582923d51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:34.475773Z","signature_b64":"oSccNj5BkhMev2b1fBgAIqWTwLCNt7iloEkQ5hHSHcB4fLLKl/KttXysr2AI8Fn5qPLeGehCPndOVM6YnIJfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5979dd2ce6b636a7874a4b635190e70e13f0ed280e733e2ab4db6b267b5ade70","last_reissued_at":"2026-05-18T01:18:34.475228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:34.475228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-exchangeable graphs and sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Diana Cai, Tamara Broderick","submitted_at":"2016-03-22T18:28:09Z","abstract_excerpt":"A known failing of many popular random graph models is that the Aldous-Hoover Theorem guarantees these graphs are dense with probability one; that is, the number of edges grows quadratically with the number of nodes. This behavior is considered unrealistic in observed graphs. We define a notion of edge exchangeability for random graphs in contrast to the established notion of infinite exchangeability for random graphs --- which has traditionally relied on exchangeability of nodes (rather than edges) in a graph. We show that, unlike node exchangeability, edge exchangeability encompasses models "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06898","kind":"arxiv","version":1},"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":"1603.06898","created_at":"2026-05-18T01:18:34.475293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06898v1","created_at":"2026-05-18T01:18:34.475293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06898","created_at":"2026-05-18T01:18:34.475293+00:00"},{"alias_kind":"pith_short_12","alias_value":"LF452LHGWY3K","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LF452LHGWY3KPB2K","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LF452LHG","created_at":"2026-05-18T12:30:29.479603+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/LF452LHGWY3KPB2KJNRVDEHHBY","json":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY.json","graph_json":"https://pith.science/api/pith-number/LF452LHGWY3KPB2KJNRVDEHHBY/graph.json","events_json":"https://pith.science/api/pith-number/LF452LHGWY3KPB2KJNRVDEHHBY/events.json","paper":"https://pith.science/paper/LF452LHG"},"agent_actions":{"view_html":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY","download_json":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY.json","view_paper":"https://pith.science/paper/LF452LHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06898&json=true","fetch_graph":"https://pith.science/api/pith-number/LF452LHGWY3KPB2KJNRVDEHHBY/graph.json","fetch_events":"https://pith.science/api/pith-number/LF452LHGWY3KPB2KJNRVDEHHBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY/action/storage_attestation","attest_author":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY/action/author_attestation","sign_citation":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY/action/citation_signature","submit_replication":"https://pith.science/pith/LF452LHGWY3KPB2KJNRVDEHHBY/action/replication_record"}},"created_at":"2026-05-18T01:18:34.475293+00:00","updated_at":"2026-05-18T01:18:34.475293+00:00"}