{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ONFP5VORPX7RL3IQK2XY745CEN","short_pith_number":"pith:ONFP5VOR","schema_version":"1.0","canonical_sha256":"734afed5d17dff15ed1056af8ff3a2234a41d1fdc403bbd304a3ced457bf5e84","source":{"kind":"arxiv","id":"1401.1170","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.1170","created_at":"2026-05-18T00:48:43.488653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1170v2","created_at":"2026-05-18T00:48:43.488653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1170","created_at":"2026-05-18T00:48:43.488653+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONFP5VORPX7R","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONFP5VORPX7RL3IQ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONFP5VOR","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN","json":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN.json","graph_json":"https://pith.science/api/pith-number/ONFP5VORPX7RL3IQK2XY745CEN/graph.json","events_json":"https://pith.science/api/pith-number/ONFP5VORPX7RL3IQK2XY745CEN/events.json","paper":"https://pith.science/paper/ONFP5VOR"},"agent_actions":{"view_html":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN","download_json":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN.json","view_paper":"https://pith.science/paper/ONFP5VOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1170&json=true","fetch_graph":"https://pith.science/api/pith-number/ONFP5VORPX7RL3IQK2XY745CEN/graph.json","fetch_events":"https://pith.science/api/pith-number/ONFP5VORPX7RL3IQK2XY745CEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/action/storage_attestation","attest_author":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/action/author_attestation","sign_citation":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/action/citation_signature","submit_replication":"https://pith.science/pith/ONFP5VORPX7RL3IQK2XY745CEN/action/replication_record"}},"created_at":"2026-05-18T00:48:43.488653+00:00","updated_at":"2026-05-18T00:48:43.488653+00:00"}