{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HV373C44W2OIHQGXI4GB2WB5IV","short_pith_number":"pith:HV373C44","schema_version":"1.0","canonical_sha256":"3d77fd8b9cb69c83c0d7470c1d583d4546bdac939f3ccf5b5d7cace69941b3ef","source":{"kind":"arxiv","id":"1603.04571","version":4},"attestation_state":"computed","paper":{"title":"Edge exchangeable models for network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.TH"],"primary_cat":"math.ST","authors_text":"Harry Crane, Walter Dempsey","submitted_at":"2016-03-15T06:54:36Z","abstract_excerpt":"Exchangeable models for countable vertex-labeled graphs cannot replicate the large sample behaviors of sparsity and power law degree distribution observed in many network datasets. Out of this mathematical impossibility emerges the question of how network data can be modeled in a way that reflects known empirical behaviors and respects basic statistical principles. We address this question by observing that edges, not vertices, act as the statistical units in networks constructed from interaction data, making a theory of edge-labeled networks more natural for many applications. In this context"},"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.04571","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-03-15T06:54:36Z","cross_cats_sorted":["cs.SI","physics.soc-ph","stat.TH"],"title_canon_sha256":"b0417f4600c09c8834241423b5910beeb65c032ac5524e48c173830bffe845ae","abstract_canon_sha256":"a9f606b95abe0cb34d6045f5e8ae7d0af0d723aba8f61b8f7a5b1a9622f36398"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:42.047777Z","signature_b64":"T4CEgDYAQYyrk0WA5AW4gWPUu6nzzKMRZie3rQFHw6whJhyF5IrtYJD1KrYUJNMzYRPjZv3Xcr514gmM2WgpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d77fd8b9cb69c83c0d7470c1d583d4546bdac939f3ccf5b5d7cace69941b3ef","last_reissued_at":"2026-05-18T01:01:42.047357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:42.047357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge exchangeable models for network data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph","stat.TH"],"primary_cat":"math.ST","authors_text":"Harry Crane, Walter Dempsey","submitted_at":"2016-03-15T06:54:36Z","abstract_excerpt":"Exchangeable models for countable vertex-labeled graphs cannot replicate the large sample behaviors of sparsity and power law degree distribution observed in many network datasets. Out of this mathematical impossibility emerges the question of how network data can be modeled in a way that reflects known empirical behaviors and respects basic statistical principles. We address this question by observing that edges, not vertices, act as the statistical units in networks constructed from interaction data, making a theory of edge-labeled networks more natural for many applications. In this context"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04571","kind":"arxiv","version":4},"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.04571","created_at":"2026-05-18T01:01:42.047426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04571v4","created_at":"2026-05-18T01:01:42.047426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04571","created_at":"2026-05-18T01:01:42.047426+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV373C44W2OI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV373C44W2OIHQGX","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV373C44","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09511","citing_title":"Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV","json":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV.json","graph_json":"https://pith.science/api/pith-number/HV373C44W2OIHQGXI4GB2WB5IV/graph.json","events_json":"https://pith.science/api/pith-number/HV373C44W2OIHQGXI4GB2WB5IV/events.json","paper":"https://pith.science/paper/HV373C44"},"agent_actions":{"view_html":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV","download_json":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV.json","view_paper":"https://pith.science/paper/HV373C44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04571&json=true","fetch_graph":"https://pith.science/api/pith-number/HV373C44W2OIHQGXI4GB2WB5IV/graph.json","fetch_events":"https://pith.science/api/pith-number/HV373C44W2OIHQGXI4GB2WB5IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV/action/storage_attestation","attest_author":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV/action/author_attestation","sign_citation":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV/action/citation_signature","submit_replication":"https://pith.science/pith/HV373C44W2OIHQGXI4GB2WB5IV/action/replication_record"}},"created_at":"2026-05-18T01:01:42.047426+00:00","updated_at":"2026-05-18T01:01:42.047426+00:00"}