{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QMCT6JFSHXBE4DUQZSRNT62QUS","short_pith_number":"pith:QMCT6JFS","canonical_record":{"source":{"id":"1804.03277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-09T23:59:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"126a4ba71e7c1b2d9d4aff2fbe7ff782e85ec734b6fd090e4a30ff699189ce68","abstract_canon_sha256":"31a6dab012d373d2107c30fe4162285474f68a0b14b0428775f24e9a0929a06b"},"schema_version":"1.0"},"canonical_sha256":"83053f24b23dc24e0e90cca2d9fb50a49dba0d1e15a1a194582ea5a381a0bff0","source":{"kind":"arxiv","id":"1804.03277","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03277","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03277v1","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03277","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"QMCT6JFSHXBE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMCT6JFSHXBE4DUQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMCT6JFS","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QMCT6JFSHXBE4DUQZSRNT62QUS","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-09T23:59:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"126a4ba71e7c1b2d9d4aff2fbe7ff782e85ec734b6fd090e4a30ff699189ce68","abstract_canon_sha256":"31a6dab012d373d2107c30fe4162285474f68a0b14b0428775f24e9a0929a06b"},"schema_version":"1.0"},"canonical_sha256":"83053f24b23dc24e0e90cca2d9fb50a49dba0d1e15a1a194582ea5a381a0bff0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:56.506005Z","signature_b64":"7XYQ8PQuXqw41ikFWpY6poX38D/zt9l6OFFKftrRLsr1urbd8xRKB1hSOrTNjhaUGgWk1V+krM5j/deNpkpIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83053f24b23dc24e0e90cca2d9fb50a49dba0d1e15a1a194582ea5a381a0bff0","last_reissued_at":"2026-05-18T00:18:56.505594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:56.505594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03277","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:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdIeokcUyxw/C+hpMLAUNg9W08/NoCJj0KzS/Wm0d2qviFfbfjL9uQLAbOsgKzzNGRLM4AQPYfGSj5nCY1twDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:05:37.664194Z"},"content_sha256":"1d028e2885a7d0c6e65c5c81ec0e0c753b975dc746d755cdea71e162118e9109","schema_version":"1.0","event_id":"sha256:1d028e2885a7d0c6e65c5c81ec0e0c753b975dc746d755cdea71e162118e9109"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QMCT6JFSHXBE4DUQZSRNT62QUS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifiability for graphexes and the weak kernel metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christian Borgs, Henry Cohn, Jennifer T. Chayes, L\\'aszl\\'o Mikl\\'os Lov\\'asz","submitted_at":"2018-04-09T23:59:36Z","abstract_excerpt":"In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over $\\sigma$-finite measure spaces has been introduced. In this paper, we introduce a metric for graphexes that generalizes the cut metric for the graphons of the dense theory of graph convergence. We show that a sequence of graphexes converges in this metric if and only if the sequence of graph processes generated by the graphexes converges in distribution. In the course of the proof, we establish a regularity lemma and determine which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03277","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:18:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhZ/enjrinoRgaN0u3He8E7DWMzs7UZkf3y/C3lY1vCxU2grTaOZ4A+zpId5LCqYZlM4VwjpkQZGw99rPU0hBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:05:37.664713Z"},"content_sha256":"b3ef33047a78755d4c193e48681094ed5bc8f9b36bf5fe019df3b13f32423edb","schema_version":"1.0","event_id":"sha256:b3ef33047a78755d4c193e48681094ed5bc8f9b36bf5fe019df3b13f32423edb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/bundle.json","state_url":"https://pith.science/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/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-25T21:05:37Z","links":{"resolver":"https://pith.science/pith/QMCT6JFSHXBE4DUQZSRNT62QUS","bundle":"https://pith.science/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/bundle.json","state":"https://pith.science/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMCT6JFSHXBE4DUQZSRNT62QUS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QMCT6JFSHXBE4DUQZSRNT62QUS","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":"31a6dab012d373d2107c30fe4162285474f68a0b14b0428775f24e9a0929a06b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-09T23:59:36Z","title_canon_sha256":"126a4ba71e7c1b2d9d4aff2fbe7ff782e85ec734b6fd090e4a30ff699189ce68"},"schema_version":"1.0","source":{"id":"1804.03277","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03277","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03277v1","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03277","created_at":"2026-05-18T00:18:56Z"},{"alias_kind":"pith_short_12","alias_value":"QMCT6JFSHXBE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QMCT6JFSHXBE4DUQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QMCT6JFS","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:b3ef33047a78755d4c193e48681094ed5bc8f9b36bf5fe019df3b13f32423edb","target":"graph","created_at":"2026-05-18T00:18:56Z","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":"In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over $\\sigma$-finite measure spaces has been introduced. In this paper, we introduce a metric for graphexes that generalizes the cut metric for the graphons of the dense theory of graph convergence. We show that a sequence of graphexes converges in this metric if and only if the sequence of graph processes generated by the graphexes converges in distribution. In the course of the proof, we establish a regularity lemma and determine which ","authors_text":"Christian Borgs, Henry Cohn, Jennifer T. Chayes, L\\'aszl\\'o Mikl\\'os Lov\\'asz","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-09T23:59:36Z","title":"Identifiability for graphexes and the weak kernel metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03277","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:1d028e2885a7d0c6e65c5c81ec0e0c753b975dc746d755cdea71e162118e9109","target":"record","created_at":"2026-05-18T00:18:56Z","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":"31a6dab012d373d2107c30fe4162285474f68a0b14b0428775f24e9a0929a06b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-04-09T23:59:36Z","title_canon_sha256":"126a4ba71e7c1b2d9d4aff2fbe7ff782e85ec734b6fd090e4a30ff699189ce68"},"schema_version":"1.0","source":{"id":"1804.03277","kind":"arxiv","version":1}},"canonical_sha256":"83053f24b23dc24e0e90cca2d9fb50a49dba0d1e15a1a194582ea5a381a0bff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83053f24b23dc24e0e90cca2d9fb50a49dba0d1e15a1a194582ea5a381a0bff0","first_computed_at":"2026-05-18T00:18:56.505594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:56.505594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7XYQ8PQuXqw41ikFWpY6poX38D/zt9l6OFFKftrRLsr1urbd8xRKB1hSOrTNjhaUGgWk1V+krM5j/deNpkpIAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:56.506005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03277","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d028e2885a7d0c6e65c5c81ec0e0c753b975dc746d755cdea71e162118e9109","sha256:b3ef33047a78755d4c193e48681094ed5bc8f9b36bf5fe019df3b13f32423edb"],"state_sha256":"b76fa59abaee9ce80b7cd85a9b4bb4a588475b02718e52733577fe19319f9703"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQRC/XHCVNPE3qzFx/me0ZndttFjTeIbgZ52ep0hznkcj5cjXtMJa+Uzf3GYCPXoTbcZCD+YO9VXY10KyTd2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:05:37.667378Z","bundle_sha256":"95d5ec4cb847d8a6cc16fd75b5a1c6c7397af878ab2db9460b4a09594b2ae140"}}