{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZLXP4ROXJ2JJZQX3UDHVJZUZBG","short_pith_number":"pith:ZLXP4ROX","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"},"canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","source":{"kind":"arxiv","id":"2606.22105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22105","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22105v1","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22105","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZLXP4ROXJ2JJ","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZLXP4ROXJ2JJZQX3","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZLXP4ROX","created_at":"2026-06-23T02:13:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZLXP4ROXJ2JJZQX3UDHVJZUZBG","target":"record","payload":{"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"},"canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","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"},"source_kind":"arxiv","source_id":"2606.22105","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70n9v6PskQHoBlxNX7eLTenEML+dTmIQ08uDUo0HudJgvkGUljWthMtaq/HwjGaI6JWcRTwYD4d0ZbKQOd5eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:39:45.683292Z"},"content_sha256":"58289a62a56bca60b478d600043a34a91f76e9cd49118ab6d7ea2cb392962c42","schema_version":"1.0","event_id":"sha256:58289a62a56bca60b478d600043a34a91f76e9cd49118ab6d7ea2cb392962c42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZLXP4ROXJ2JJZQX3UDHVJZUZBG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QziHzNoMvneHyyFZuhlrg9mfFUKNK90HF9bUy83gUoaW81MH+OqO03Ak3COB+Z9G4EAuaUOnwfebQXG4S8OSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:39:45.683678Z"},"content_sha256":"f5031f0cbe4077f2a873fcf86d00ca821d584ae4db6087aca643a9f200187ba6","schema_version":"1.0","event_id":"sha256:f5031f0cbe4077f2a873fcf86d00ca821d584ae4db6087aca643a9f200187ba6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/bundle.json","state_url":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-02T22:39:45Z","links":{"resolver":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG","bundle":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/bundle.json","state":"https://pith.science/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZLXP4ROXJ2JJZQX3UDHVJZUZBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZLXP4ROXJ2JJZQX3UDHVJZUZBG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f7ba4a7373a3946b189336c8cf7557cda24e2afd48fb46c178bf9a8518ca525a","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2026-06-20T15:37:44Z","title_canon_sha256":"62b511e306a0a4022b74b541fd633d9c9eca60150205e311826f78fba3dafb3e"},"schema_version":"1.0","source":{"id":"2606.22105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22105","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22105v1","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22105","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZLXP4ROXJ2JJ","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_16","alias_value":"ZLXP4ROXJ2JJZQX3","created_at":"2026-06-23T02:13:28Z"},{"alias_kind":"pith_short_8","alias_value":"ZLXP4ROX","created_at":"2026-06-23T02:13:28Z"}],"graph_snapshots":[{"event_id":"sha256:f5031f0cbe4077f2a873fcf86d00ca821d584ae4db6087aca643a9f200187ba6","target":"graph","created_at":"2026-06-23T02:13:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Valentin Kilian","cross_cats":["stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2026-06-20T15:37:44Z","title":"A Generative Model for Extremely Sparse Edge-Exchangeable Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22105","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58289a62a56bca60b478d600043a34a91f76e9cd49118ab6d7ea2cb392962c42","target":"record","created_at":"2026-06-23T02:13:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f7ba4a7373a3946b189336c8cf7557cda24e2afd48fb46c178bf9a8518ca525a","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2026-06-20T15:37:44Z","title_canon_sha256":"62b511e306a0a4022b74b541fd633d9c9eca60150205e311826f78fba3dafb3e"},"schema_version":"1.0","source":{"id":"2606.22105","kind":"arxiv","version":1}},"canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"caeefe45d74e929cc2fba0cf54e69909a7e91520458b78de1eb960a7197a0a05","first_computed_at":"2026-06-23T02:13:28.357196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:28.357196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XownrUOKczZ/axuQelNRhyJ7cR+7FnNTvNJTSV9fB6AYom4hOMZ0x20kybrSbHvaM49+B+wH1icUwy5sbzyEBw==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:28.357547Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58289a62a56bca60b478d600043a34a91f76e9cd49118ab6d7ea2cb392962c42","sha256:f5031f0cbe4077f2a873fcf86d00ca821d584ae4db6087aca643a9f200187ba6"],"state_sha256":"89fa8c2c9a10a61912b368d230c02acff461bea3410187bde7db247168a360c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AHUXKHxN9doK/sj4KuEokXwxlRkDwlYeuj4nCCezR7DiuRXToNwSuFkrwgcTsO4/28wT9ux+BOz6NU9w6secCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:39:45.685613Z","bundle_sha256":"7bbc8b94727270347547e00249a61a88b2fa4d80f81ec8f0f4163a70d308902c"}}