{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6XY7UTRWSU3UHPJMOGW7KKDJ7B","short_pith_number":"pith:6XY7UTRW","schema_version":"1.0","canonical_sha256":"f5f1fa4e36953743bd2c71adf52869f86143c87b42c5c973011804708373e86f","source":{"kind":"arxiv","id":"1512.03099","version":1},"attestation_state":"computed","paper":{"title":"The Class of Random Graphs Arising from Exchangeable Random Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel M. Roy, Victor Veitch","submitted_at":"2015-12-07T16:44:35Z","abstract_excerpt":"We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a probabilistic symmetry: invariance of the distribution of each graph to an arbitrary relabelings of its vertices. In particular, following Caron and Fox, we interpret a symmetric simple point process on $\\mathbb{R}_+^2$ as the edge set of a random graph, and formalize the probabilistic symmetry as joint exchangeability of the point process. We give a representation th"},"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":"1512.03099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-12-07T16:44:35Z","cross_cats_sorted":["cs.SI","math.CO","stat.TH"],"title_canon_sha256":"301ac7578d2f60a55f0bfd6f0acbe5b4f0c3248a2a654a63727d191a0c6f100e","abstract_canon_sha256":"a5383e96e9b21366900d99072ddd2f2d494cb79439aa53e9ab6bfc78c294f554"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:37.885300Z","signature_b64":"PVwFv4Q67HoPtU3xofzRCSl65qkanmzOeqAPacnJVS0USTFj6DF1/s5legmDlUZ/yO/qfFUgEBfRYZn8Og3xDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5f1fa4e36953743bd2c71adf52869f86143c87b42c5c973011804708373e86f","last_reissued_at":"2026-05-18T01:24:37.884689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:37.884689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Class of Random Graphs Arising from Exchangeable Random Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.CO","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel M. Roy, Victor Veitch","submitted_at":"2015-12-07T16:44:35Z","abstract_excerpt":"We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a probabilistic symmetry: invariance of the distribution of each graph to an arbitrary relabelings of its vertices. In particular, following Caron and Fox, we interpret a symmetric simple point process on $\\mathbb{R}_+^2$ as the edge set of a random graph, and formalize the probabilistic symmetry as joint exchangeability of the point process. We give a representation th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03099","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":"1512.03099","created_at":"2026-05-18T01:24:37.884786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03099v1","created_at":"2026-05-18T01:24:37.884786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03099","created_at":"2026-05-18T01:24:37.884786+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XY7UTRWSU3U","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XY7UTRWSU3UHPJM","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XY7UTRW","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.01613","citing_title":"A correction to Kallenberg's theorem for jointly exchangeable random measures","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"1907.01605","citing_title":"Limits of Sparse Configuration Models and Beyond: Graphexes and Multi-Graphexes","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07810","citing_title":"Intensity Dot Product Graphs","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05294","citing_title":"Mean Field Games and Control on Large Expander Graphs","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B","json":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B.json","graph_json":"https://pith.science/api/pith-number/6XY7UTRWSU3UHPJMOGW7KKDJ7B/graph.json","events_json":"https://pith.science/api/pith-number/6XY7UTRWSU3UHPJMOGW7KKDJ7B/events.json","paper":"https://pith.science/paper/6XY7UTRW"},"agent_actions":{"view_html":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B","download_json":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B.json","view_paper":"https://pith.science/paper/6XY7UTRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03099&json=true","fetch_graph":"https://pith.science/api/pith-number/6XY7UTRWSU3UHPJMOGW7KKDJ7B/graph.json","fetch_events":"https://pith.science/api/pith-number/6XY7UTRWSU3UHPJMOGW7KKDJ7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B/action/storage_attestation","attest_author":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B/action/author_attestation","sign_citation":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B/action/citation_signature","submit_replication":"https://pith.science/pith/6XY7UTRWSU3UHPJMOGW7KKDJ7B/action/replication_record"}},"created_at":"2026-05-18T01:24:37.884786+00:00","updated_at":"2026-05-18T01:24:37.884786+00:00"}