{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JYADBY26TOCJUKCZOTQLBHEDFO","short_pith_number":"pith:JYADBY26","canonical_record":{"source":{"id":"1702.06396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T14:25:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3c9421bb82abf9c93c40fe3fbaf3b238fd1c9a6e507a7a98423e3c25a3f79644","abstract_canon_sha256":"2c9c1be4ab1b756306ea7323f25c0f20dc5388d54b55f91261271a302d91d821"},"schema_version":"1.0"},"canonical_sha256":"4e0030e35e9b849a285974e0b09c832bb6c8e96125928b17a60cd6b0297d636c","source":{"kind":"arxiv","id":"1702.06396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06396","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06396v1","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06396","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"JYADBY26TOCJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JYADBY26TOCJUKCZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JYADBY26","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JYADBY26TOCJUKCZOTQLBHEDFO","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T14:25:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3c9421bb82abf9c93c40fe3fbaf3b238fd1c9a6e507a7a98423e3c25a3f79644","abstract_canon_sha256":"2c9c1be4ab1b756306ea7323f25c0f20dc5388d54b55f91261271a302d91d821"},"schema_version":"1.0"},"canonical_sha256":"4e0030e35e9b849a285974e0b09c832bb6c8e96125928b17a60cd6b0297d636c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:57.442019Z","signature_b64":"TieFnzMPpc1o+96tXZ431TaFKI1tHRrcSwH1Usu3VSpfS2zkGtNaLB71Feauy8QagZCaNGXi0OwRJOlU5qmDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0030e35e9b849a285974e0b09c832bb6c8e96125928b17a60cd6b0297d636c","last_reissued_at":"2026-05-18T00:38:57.441411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:57.441411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06396","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-05-18T00:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ppde0gLoEmmls2xj6UAGssQij5pHj2bqvmvlZUbb1ao2rQbsWxx0HvUet9FqXG13QHUR3g11jhGiD8bnGjaGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:04:54.242438Z"},"content_sha256":"fa64953ea9dea7572d181f57c0404b0babdbe2ed333e468ea873c477d95809ab","schema_version":"1.0","event_id":"sha256:fa64953ea9dea7572d181f57c0404b0babdbe2ed333e468ea873c477d95809ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JYADBY26TOCJUKCZOTQLBHEDFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On edge exchangeable random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Svante Janson","submitted_at":"2017-02-21T14:25:55Z","abstract_excerpt":"We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06396","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"},"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-05-18T00:38:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UUjm2W6NIUd2i5LZWnUfu3ilMHWyxeRGuN4Z3rF1Ci7rMw4WrChtBhNkMnaQGW3cJRcs4ZHxEVf5xgTR+yDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:04:54.242863Z"},"content_sha256":"968f54e535de08a178b6d7bcf42b44e26a61e35bd4fc653175e10a952f957229","schema_version":"1.0","event_id":"sha256:968f54e535de08a178b6d7bcf42b44e26a61e35bd4fc653175e10a952f957229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYADBY26TOCJUKCZOTQLBHEDFO/bundle.json","state_url":"https://pith.science/pith/JYADBY26TOCJUKCZOTQLBHEDFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYADBY26TOCJUKCZOTQLBHEDFO/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-05-26T11:04:54Z","links":{"resolver":"https://pith.science/pith/JYADBY26TOCJUKCZOTQLBHEDFO","bundle":"https://pith.science/pith/JYADBY26TOCJUKCZOTQLBHEDFO/bundle.json","state":"https://pith.science/pith/JYADBY26TOCJUKCZOTQLBHEDFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYADBY26TOCJUKCZOTQLBHEDFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JYADBY26TOCJUKCZOTQLBHEDFO","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":"2c9c1be4ab1b756306ea7323f25c0f20dc5388d54b55f91261271a302d91d821","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T14:25:55Z","title_canon_sha256":"3c9421bb82abf9c93c40fe3fbaf3b238fd1c9a6e507a7a98423e3c25a3f79644"},"schema_version":"1.0","source":{"id":"1702.06396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06396","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06396v1","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06396","created_at":"2026-05-18T00:38:57Z"},{"alias_kind":"pith_short_12","alias_value":"JYADBY26TOCJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JYADBY26TOCJUKCZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JYADBY26","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:968f54e535de08a178b6d7bcf42b44e26a61e35bd4fc653175e10a952f957229","target":"graph","created_at":"2026-05-18T00:38:57Z","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"},"paper":{"abstract_excerpt":"We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields c","authors_text":"Svante Janson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T14:25:55Z","title":"On edge exchangeable random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06396","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:fa64953ea9dea7572d181f57c0404b0babdbe2ed333e468ea873c477d95809ab","target":"record","created_at":"2026-05-18T00:38:57Z","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":"2c9c1be4ab1b756306ea7323f25c0f20dc5388d54b55f91261271a302d91d821","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-02-21T14:25:55Z","title_canon_sha256":"3c9421bb82abf9c93c40fe3fbaf3b238fd1c9a6e507a7a98423e3c25a3f79644"},"schema_version":"1.0","source":{"id":"1702.06396","kind":"arxiv","version":1}},"canonical_sha256":"4e0030e35e9b849a285974e0b09c832bb6c8e96125928b17a60cd6b0297d636c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e0030e35e9b849a285974e0b09c832bb6c8e96125928b17a60cd6b0297d636c","first_computed_at":"2026-05-18T00:38:57.441411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:57.441411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TieFnzMPpc1o+96tXZ431TaFKI1tHRrcSwH1Usu3VSpfS2zkGtNaLB71Feauy8QagZCaNGXi0OwRJOlU5qmDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:57.442019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa64953ea9dea7572d181f57c0404b0babdbe2ed333e468ea873c477d95809ab","sha256:968f54e535de08a178b6d7bcf42b44e26a61e35bd4fc653175e10a952f957229"],"state_sha256":"d92d0d26b50b60d0caeab5c43af1d4c56675bf374334f3992f099d3f1cb8ca45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nNs85XN1GQPADf2qQHm7wN9++EjoQKKC/ZWmRdPCvZQLIsIf5BskbDP5/9uVrvb8PKQLN6j9jFrUCTkF2+ffAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:04:54.246672Z","bundle_sha256":"befd3380d9036f829597bc8263c8fefff8c42240094837c3cb60a51844b0b074"}}