{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ONFP5VORPX7RL3IQK2XY745CEN","short_pith_number":"pith:ONFP5VOR","canonical_record":{"source":{"id":"1401.1170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-06T19:11:41Z","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"title_canon_sha256":"ea736e549860cdec6ffe08bd642b3b306ae1f8b0895aea46ad79423b0bfbc47c","abstract_canon_sha256":"7baf7b5c41fe3e6991d441ef8452012ad11175207ef7316d270ebb8cea7288d1"},"schema_version":"1.0"},"canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","source":{"kind":"arxiv","id":"1401.1170","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1170","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1170v2","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1170","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"ONFP5VORPX7R","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONFP5VORPX7RL3IQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONFP5VOR","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ONFP5VORPX7RL3IQK2XY745CEN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.1170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-06T19:11:41Z","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"title_canon_sha256":"ea736e549860cdec6ffe08bd642b3b306ae1f8b0895aea46ad79423b0bfbc47c","abstract_canon_sha256":"7baf7b5c41fe3e6991d441ef8452012ad11175207ef7316d270ebb8cea7288d1"},"schema_version":"1.0"},"canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:43.489088Z","signature_b64":"WIIXuHQ01e4AR1XVp8Tz2o8jOYKtVEt4+zxS78c5jlZ/NiOo6cBH8chlMFfTeTRJSeIA0Mi7Q9722isrb5OJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","last_reissued_at":"2026-05-18T00:48:43.488296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:43.488296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.1170","source_version":2,"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gs2ZXid7fFUCsmFeIvkuob5uOXVlZJRjNIwfN3d5QR1RNfMyzAVbDXQTZyIOY26vjz/t829QC0FLGR30OsCYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:16:36.516280Z"},"content_sha256":"8204c565e6e12bb25e6e058d8b1400c2234f4a86aba2b2f00a0fb289bcbbf9c9","schema_version":"1.0","event_id":"sha256:8204c565e6e12bb25e6e058d8b1400c2234f4a86aba2b2f00a0fb289bcbbf9c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ONFP5VORPX7RL3IQK2XY745CEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Asymptotics of Large Constrained Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math-ph","math.MP"],"primary_cat":"math.CO","authors_text":"Charles Radin, Kui Ren, Lorenzo Sadun","submitted_at":"2014-01-06T19:11:41Z","abstract_excerpt":"We show, through local estimates and simulation, that if one constrains simple graphs by their densities $\\varepsilon$ of edges and $\\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\\%$ of the possible range of those densities there is a well-defined typical graph, and it has a very simple structure: the vertices are decomposed into two subsets $V_1$ and $V_2$ of fixed relative size $c$ and $1-c$, and there are well-defined probabilities of edges, $g_{jk}$, between $v_j\\in V_j$, and $v_k\\in V_k$. Furthermore the four parameters $c, g_{11}, g_{22}$ and $g_{12}$ ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1170","kind":"arxiv","version":2},"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:48:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMAFeXHTurDXSa81QDrCQQFme7I3v1yMWJesZEMOIfyzcv41UOgnZUbS4g5Yx4RPdEansSoI8RdvF7x3ahsABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:16:36.516639Z"},"content_sha256":"a31bcaaef1fa445f1bd35888e2b37cfa8978a4448edb56e7c084f8eed1013902","schema_version":"1.0","event_id":"sha256:a31bcaaef1fa445f1bd35888e2b37cfa8978a4448edb56e7c084f8eed1013902"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/bundle.json","state_url":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONFP5VORPX7RL3IQK2XY745CEN/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-06-01T05:16:36Z","links":{"resolver":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN","bundle":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/bundle.json","state":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONFP5VORPX7RL3IQK2XY745CEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ONFP5VORPX7RL3IQK2XY745CEN","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":"7baf7b5c41fe3e6991d441ef8452012ad11175207ef7316d270ebb8cea7288d1","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-06T19:11:41Z","title_canon_sha256":"ea736e549860cdec6ffe08bd642b3b306ae1f8b0895aea46ad79423b0bfbc47c"},"schema_version":"1.0","source":{"id":"1401.1170","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1170","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1170v2","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1170","created_at":"2026-05-18T00:48:43Z"},{"alias_kind":"pith_short_12","alias_value":"ONFP5VORPX7R","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ONFP5VORPX7RL3IQ","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ONFP5VOR","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:a31bcaaef1fa445f1bd35888e2b37cfa8978a4448edb56e7c084f8eed1013902","target":"graph","created_at":"2026-05-18T00:48:43Z","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 show, through local estimates and simulation, that if one constrains simple graphs by their densities $\\varepsilon$ of edges and $\\tau$ of triangles, then asymptotically (in the number of vertices) for over $95\\%$ of the possible range of those densities there is a well-defined typical graph, and it has a very simple structure: the vertices are decomposed into two subsets $V_1$ and $V_2$ of fixed relative size $c$ and $1-c$, and there are well-defined probabilities of edges, $g_{jk}$, between $v_j\\in V_j$, and $v_k\\in V_k$. Furthermore the four parameters $c, g_{11}, g_{22}$ and $g_{12}$ ar","authors_text":"Charles Radin, Kui Ren, Lorenzo Sadun","cross_cats":["cs.SI","math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-06T19:11:41Z","title":"The Asymptotics of Large Constrained Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1170","kind":"arxiv","version":2},"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:8204c565e6e12bb25e6e058d8b1400c2234f4a86aba2b2f00a0fb289bcbbf9c9","target":"record","created_at":"2026-05-18T00:48:43Z","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":"7baf7b5c41fe3e6991d441ef8452012ad11175207ef7316d270ebb8cea7288d1","cross_cats_sorted":["cs.SI","math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-06T19:11:41Z","title_canon_sha256":"ea736e549860cdec6ffe08bd642b3b306ae1f8b0895aea46ad79423b0bfbc47c"},"schema_version":"1.0","source":{"id":"1401.1170","kind":"arxiv","version":2}},"canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","first_computed_at":"2026-05-18T00:48:43.488296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:43.488296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WIIXuHQ01e4AR1XVp8Tz2o8jOYKtVEt4+zxS78c5jlZ/NiOo6cBH8chlMFfTeTRJSeIA0Mi7Q9722isrb5OJAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:43.489088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1170","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8204c565e6e12bb25e6e058d8b1400c2234f4a86aba2b2f00a0fb289bcbbf9c9","sha256:a31bcaaef1fa445f1bd35888e2b37cfa8978a4448edb56e7c084f8eed1013902"],"state_sha256":"56cbacb611efbb1964a376b4063a551520568cf379dddd1ff9127af6d1b534cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAlAzoU2zulC3I92x425dwMjWdA6WKvu3VIo2n28Yxu44LjIV5fdvE44Bcg6bYDtRW+3qEP6uIEmq8sMXznDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:16:36.518737Z","bundle_sha256":"80f701c5f6b1b3291aa7e08b5c252e0c956ceb8d4a41edbc089d0e426c6f575a"}}