{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QQYH6VPWCVQQBFC3V6SJLFKHAE","short_pith_number":"pith:QQYH6VPW","canonical_record":{"source":{"id":"1302.4615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-02-19T14:16:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"65b2d78759c15a970c11a1169aed46557236da7580aa71177f600bd0c89745fb","abstract_canon_sha256":"0a725ffc06c04a58670451f6ec2c0ed8fecfa62bc1dc67fe50fe43d19d5fc1f7"},"schema_version":"1.0"},"canonical_sha256":"84307f55f6156100945bafa4959547013dd3dbf7439c41707cf33bbbdff4a4d5","source":{"kind":"arxiv","id":"1302.4615","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4615","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4615v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4615","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"QQYH6VPWCVQQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QQYH6VPWCVQQBFC3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QQYH6VPW","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QQYH6VPWCVQQBFC3V6SJLFKHAE","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-02-19T14:16:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"65b2d78759c15a970c11a1169aed46557236da7580aa71177f600bd0c89745fb","abstract_canon_sha256":"0a725ffc06c04a58670451f6ec2c0ed8fecfa62bc1dc67fe50fe43d19d5fc1f7"},"schema_version":"1.0"},"canonical_sha256":"84307f55f6156100945bafa4959547013dd3dbf7439c41707cf33bbbdff4a4d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:12.737819Z","signature_b64":"9yaISU+pUwYfxsTVN+0TmCYejUPZHkZlivl0qi4bjiK1js9wEle/1zEsgfS7GX7fu4V0WWgJzOhbIZTjKRTsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84307f55f6156100945bafa4959547013dd3dbf7439c41707cf33bbbdff4a4d5","last_reissued_at":"2026-05-18T03:33:12.737074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:12.737074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4615","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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/M2DIEnRtoY04yc7aTNvcR54L9iy68i0uGXRxkqbEiJmnrIX7iQP7Q6tnKCY9dgYpc+vtJJqpWIMpxyAhLGWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:12.410414Z"},"content_sha256":"51a00ef3751ac81298a0f77382cbf4e57149ba231138511c1edcd0556443a90d","schema_version":"1.0","event_id":"sha256:51a00ef3751ac81298a0f77382cbf4e57149ba231138511c1edcd0556443a90d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QQYH6VPWCVQQBFC3V6SJLFKHAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergent sequences of sparse graphs: A large deviations approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christian Borgs, David Gamarnik, Jennifer Chayes","submitted_at":"2013-02-19T14:16:46Z","abstract_excerpt":"In this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by \"decorating\" the nodes of the graph with random uniform i.i.d. weights and constructing random measures on $[0,1]$ and $[0,1]^2$ based on the decoration of nodes and edges. A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on $[0,1]^d, d=1,2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4615","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-18T03:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJjV5TnqQpKN8jFyVUWUiq3uejhaWIeZA45rYXaieidUmVZ8TWhde7hpPf4rHfNhlFbwHnJNeGPmYbyvW66VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:52:12.410756Z"},"content_sha256":"330bef8d631b0a382390191c04a5f295120a3f1b371247c48d9b3de0bb971a66","schema_version":"1.0","event_id":"sha256:330bef8d631b0a382390191c04a5f295120a3f1b371247c48d9b3de0bb971a66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/bundle.json","state_url":"https://pith.science/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/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-28T12:52:12Z","links":{"resolver":"https://pith.science/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE","bundle":"https://pith.science/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/bundle.json","state":"https://pith.science/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQYH6VPWCVQQBFC3V6SJLFKHAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QQYH6VPWCVQQBFC3V6SJLFKHAE","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":"0a725ffc06c04a58670451f6ec2c0ed8fecfa62bc1dc67fe50fe43d19d5fc1f7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-02-19T14:16:46Z","title_canon_sha256":"65b2d78759c15a970c11a1169aed46557236da7580aa71177f600bd0c89745fb"},"schema_version":"1.0","source":{"id":"1302.4615","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4615","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4615v1","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4615","created_at":"2026-05-18T03:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"QQYH6VPWCVQQ","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QQYH6VPWCVQQBFC3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QQYH6VPW","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:330bef8d631b0a382390191c04a5f295120a3f1b371247c48d9b3de0bb971a66","target":"graph","created_at":"2026-05-18T03:33:12Z","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 this paper we introduce a new notion of convergence of sparse graphs which we call Large Deviations or LD-convergence and which is based on the theory of large deviations. The notion is introduced by \"decorating\" the nodes of the graph with random uniform i.i.d. weights and constructing random measures on $[0,1]$ and $[0,1]^2$ based on the decoration of nodes and edges. A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on $[0,1]^d, d=1,2$.","authors_text":"Christian Borgs, David Gamarnik, Jennifer Chayes","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-02-19T14:16:46Z","title":"Convergent sequences of sparse graphs: A large deviations approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4615","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:51a00ef3751ac81298a0f77382cbf4e57149ba231138511c1edcd0556443a90d","target":"record","created_at":"2026-05-18T03:33:12Z","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":"0a725ffc06c04a58670451f6ec2c0ed8fecfa62bc1dc67fe50fe43d19d5fc1f7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2013-02-19T14:16:46Z","title_canon_sha256":"65b2d78759c15a970c11a1169aed46557236da7580aa71177f600bd0c89745fb"},"schema_version":"1.0","source":{"id":"1302.4615","kind":"arxiv","version":1}},"canonical_sha256":"84307f55f6156100945bafa4959547013dd3dbf7439c41707cf33bbbdff4a4d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84307f55f6156100945bafa4959547013dd3dbf7439c41707cf33bbbdff4a4d5","first_computed_at":"2026-05-18T03:33:12.737074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:12.737074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9yaISU+pUwYfxsTVN+0TmCYejUPZHkZlivl0qi4bjiK1js9wEle/1zEsgfS7GX7fu4V0WWgJzOhbIZTjKRTsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:12.737819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4615","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51a00ef3751ac81298a0f77382cbf4e57149ba231138511c1edcd0556443a90d","sha256:330bef8d631b0a382390191c04a5f295120a3f1b371247c48d9b3de0bb971a66"],"state_sha256":"76e2680b2aa1e47bfa684039757a4bba884fb7ae03fcb84f39b626e3002b697e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmZZfKot0Pk0em7WUT/vAme7IpolWwJs9OgefGWI6rfZx3q3kzYLfLjG9Ca6FoJuM7ELoqH7HLqGtaSWbEWRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:52:12.412702Z","bundle_sha256":"95bb7ee6ead0c105a79a143ad85d1566a1cd2adff922d6c24e0b2a1372518349"}}