{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZLXP4ROXJ2JJZQX3UDHVJZUZBG","short_pith_number":"pith:ZLXP4ROX","schema_version":"1.0","canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","source":{"kind":"arxiv","id":"2606.22105","version":1},"attestation_state":"computed","paper":{"title":"A Generative Model for Extremely Sparse Edge-Exchangeable Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Valentin Kilian","submitted_at":"2026-06-20T15:37:44Z","abstract_excerpt":"We propose a graph generative model for sequences of extremely sparse, edge-exchangeable networks. Models for sparse graphs often face a trade-off between desirable properties like exchangeability and the ability to capture the sparsity observed in real-world networks. While models based on vertex or edge exchangeability have successfully generated sparse graphs, achieving the \"extremely sparse\" regime, where the number of edges scales near-linearly with the number of nodes, has remained a challenge. Recently, a novel Completely Random Measure (CRM) was introduced, demonstrating that this rate"},"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":"2606.22105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2026-06-20T15:37:44Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"62b511e306a0a4022b74b541fd633d9c9eca60150205e311826f78fba3dafb3e","abstract_canon_sha256":"f7ba4a7373a3946b189336c8cf7557cda24e2afd48fb46c178bf9a8518ca525a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:28.357547Z","signature_b64":"XownrUOKczZ/axuQelNRhyJ7cR+7FnNTvNJTSV9fB6AYom4hOMZ0x20kybrSbHvaM49+B+wH1icUwy5sbzyEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","last_reissued_at":"2026-06-23T02:13:28.357196Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:28.357196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generative Model for Extremely Sparse Edge-Exchangeable Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Valentin Kilian","submitted_at":"2026-06-20T15:37:44Z","abstract_excerpt":"We propose a graph generative model for sequences of extremely sparse, edge-exchangeable networks. Models for sparse graphs often face a trade-off between desirable properties like exchangeability and the ability to capture the sparsity observed in real-world networks. While models based on vertex or edge exchangeability have successfully generated sparse graphs, achieving the \"extremely sparse\" regime, where the number of edges scales near-linearly with the number of nodes, has remained a challenge. Recently, a novel Completely Random Measure (CRM) was introduced, demonstrating that this rate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.22105","created_at":"2026-06-23T02:13:28.357251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22105v1","created_at":"2026-06-23T02:13:28.357251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22105","created_at":"2026-06-23T02:13:28.357251+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLXP4ROXJ2JJ","created_at":"2026-06-23T02:13:28.357251+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLXP4ROXJ2JJZQX3","created_at":"2026-06-23T02:13:28.357251+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLXP4ROX","created_at":"2026-06-23T02:13:28.357251+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/ZLXP4ROXJ2JJZQX3UDHVJZUZBG","json":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG.json","graph_json":"https://pith.science/api/pith-number/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/graph.json","events_json":"https://pith.science/api/pith-number/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/events.json","paper":"https://pith.science/paper/ZLXP4ROX"},"agent_actions":{"view_html":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG","download_json":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG.json","view_paper":"https://pith.science/paper/ZLXP4ROX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22105&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/action/storage_attestation","attest_author":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/action/author_attestation","sign_citation":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/action/citation_signature","submit_replication":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/action/replication_record"}},"created_at":"2026-06-23T02:13:28.357251+00:00","updated_at":"2026-06-23T02:13:28.357251+00:00"}