{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:USXTEVIWSZTR2DGGXZTWYVNMUF","short_pith_number":"pith:USXTEVIW","schema_version":"1.0","canonical_sha256":"a4af32551696671d0cc6be676c55aca142dfc1b3087e2db3934fc70992b96923","source":{"kind":"arxiv","id":"1204.2446","version":2},"attestation_state":"computed","paper":{"title":"Random graphs with bounded maximum degree: asymptotic structure and a logical limit law","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vera Koponen","submitted_at":"2012-04-11T13:44:39Z","abstract_excerpt":"For any fixed integer $R \\geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled limit law for first-order logic. If $R \\geq 5$ then also an unlabelled limit law holds."},"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":"1204.2446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-11T13:44:39Z","cross_cats_sorted":[],"title_canon_sha256":"1c27dd025d318e4dad0a179c70ad4a6693d71d382bf57dc7dbadd53a35f6fc48","abstract_canon_sha256":"f4d01339f6d27284d241b0f5dbd57a0473508ae38e7916d71a4e162847ae47a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:23.582098Z","signature_b64":"uWyJwC6JG9MkQz8wopESKT/vN4jemfJBeIH9OnFaTkF6NflPP9Ojtf3tY2N02g6UOHwhsEN3p35EOcLzJJ4CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4af32551696671d0cc6be676c55aca142dfc1b3087e2db3934fc70992b96923","last_reissued_at":"2026-05-18T03:38:23.581487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:23.581487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random graphs with bounded maximum degree: asymptotic structure and a logical limit law","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Vera Koponen","submitted_at":"2012-04-11T13:44:39Z","abstract_excerpt":"For any fixed integer $R \\geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled limit law for first-order logic. If $R \\geq 5$ then also an unlabelled limit law holds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2446","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":"1204.2446","created_at":"2026-05-18T03:38:23.581591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2446v2","created_at":"2026-05-18T03:38:23.581591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2446","created_at":"2026-05-18T03:38:23.581591+00:00"},{"alias_kind":"pith_short_12","alias_value":"USXTEVIWSZTR","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"USXTEVIWSZTR2DGG","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"USXTEVIW","created_at":"2026-05-18T12:27:25.539911+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/USXTEVIWSZTR2DGGXZTWYVNMUF","json":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF.json","graph_json":"https://pith.science/api/pith-number/USXTEVIWSZTR2DGGXZTWYVNMUF/graph.json","events_json":"https://pith.science/api/pith-number/USXTEVIWSZTR2DGGXZTWYVNMUF/events.json","paper":"https://pith.science/paper/USXTEVIW"},"agent_actions":{"view_html":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF","download_json":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF.json","view_paper":"https://pith.science/paper/USXTEVIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2446&json=true","fetch_graph":"https://pith.science/api/pith-number/USXTEVIWSZTR2DGGXZTWYVNMUF/graph.json","fetch_events":"https://pith.science/api/pith-number/USXTEVIWSZTR2DGGXZTWYVNMUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF/action/storage_attestation","attest_author":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF/action/author_attestation","sign_citation":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF/action/citation_signature","submit_replication":"https://pith.science/pith/USXTEVIWSZTR2DGGXZTWYVNMUF/action/replication_record"}},"created_at":"2026-05-18T03:38:23.581591+00:00","updated_at":"2026-05-18T03:38:23.581591+00:00"}