{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VD7ZEX5NZDBD2WIM3Q3SHPX5XJ","short_pith_number":"pith:VD7ZEX5N","canonical_record":{"source":{"id":"1204.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-04-11T14:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"4322a9ac9f813a5547d77f2df60ea479622d91a857063328082ad1b071f53417","abstract_canon_sha256":"e0107ceaebd136abe44c079c0b851a7c671f645c542d52cef033afb55f74d2ef"},"schema_version":"1.0"},"canonical_sha256":"a8ff925fadc8c23d590cdc3723befdba6ec49257387aeee5c26504a324651ac4","source":{"kind":"arxiv","id":"1204.2454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2454","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2454v2","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2454","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"VD7ZEX5NZDBD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VD7ZEX5NZDBD2WIM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VD7ZEX5N","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VD7ZEX5NZDBD2WIM3Q3SHPX5XJ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-04-11T14:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"4322a9ac9f813a5547d77f2df60ea479622d91a857063328082ad1b071f53417","abstract_canon_sha256":"e0107ceaebd136abe44c079c0b851a7c671f645c542d52cef033afb55f74d2ef"},"schema_version":"1.0"},"canonical_sha256":"a8ff925fadc8c23d590cdc3723befdba6ec49257387aeee5c26504a324651ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:26.119481Z","signature_b64":"Qa4Cl27sy0VzsR7H2ZaTz4X37XnE/4aMSbaCajfJkzTCiGTs26OFbYVVqFmDxRTY+xXJc2D/3y/dvshK8ivaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8ff925fadc8c23d590cdc3723befdba6ec49257387aeee5c26504a324651ac4","last_reissued_at":"2026-05-18T03:33:26.118587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:26.118587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2454","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-18T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"199q+pWHrUWO89Ul/NmwGL0HIZwqne7oeRaZ6B/pd1OMCLj7ycz0l9pMWHK0/+2iyNrxxTkmYf4ThwJWDzInBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:44:02.206106Z"},"content_sha256":"118d8509958e9b1ba16c9bcb9b598a9e729cb1d2a87042bfe833d35a8ec64f84","schema_version":"1.0","event_id":"sha256:118d8509958e9b1ba16c9bcb9b598a9e729cb1d2a87042bfe833d35a8ec64f84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VD7ZEX5NZDBD2WIM3Q3SHPX5XJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A limit law of almost $l$-partite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Vera Koponen","submitted_at":"2012-04-11T14:05:04Z","abstract_excerpt":"For integers $l \\geq 2$, $d \\geq 1$ we study (undirected) graphs with vertices $1, ..., n$ such that the vertices can be partitioned into $l$ parts such that every vertex has at most $d$ neighbours in its own part. The set of all such graphs is denoted $\\mbP_n(l,d)$. We prove a labelled first-order limit law, i.e., for every first-order sentence $\\varphi$, the proportion of graphs in $\\mbP_n(l,d)$ that satisfy $\\varphi$ converges as $n \\to \\infty$. By combining this result with a result of Hundack, Pr\\\"omel and Steger \\cite{HPS} we also prove that if $1 \\leq s_1 \\leq ... \\leq s_l$ are integers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2454","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-18T03:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Yi2qb+pJagsN/+RIF/ioGNArFjgdXKR1RdpaTGSNcKFnEpjYCzO7w/XJogw2iUI2HwpxuLdAX34dhTDYn4dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T14:44:02.206463Z"},"content_sha256":"1a76338bedaf726e6f64784d6e2b274d3a43f089e93b5c27730b5e6aec1c14f2","schema_version":"1.0","event_id":"sha256:1a76338bedaf726e6f64784d6e2b274d3a43f089e93b5c27730b5e6aec1c14f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/bundle.json","state_url":"https://pith.science/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/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-24T14:44:02Z","links":{"resolver":"https://pith.science/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ","bundle":"https://pith.science/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/bundle.json","state":"https://pith.science/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VD7ZEX5NZDBD2WIM3Q3SHPX5XJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VD7ZEX5NZDBD2WIM3Q3SHPX5XJ","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":"e0107ceaebd136abe44c079c0b851a7c671f645c542d52cef033afb55f74d2ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-04-11T14:05:04Z","title_canon_sha256":"4322a9ac9f813a5547d77f2df60ea479622d91a857063328082ad1b071f53417"},"schema_version":"1.0","source":{"id":"1204.2454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2454","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2454v2","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2454","created_at":"2026-05-18T03:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"VD7ZEX5NZDBD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VD7ZEX5NZDBD2WIM","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VD7ZEX5N","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:1a76338bedaf726e6f64784d6e2b274d3a43f089e93b5c27730b5e6aec1c14f2","target":"graph","created_at":"2026-05-18T03:33:26Z","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":"For integers $l \\geq 2$, $d \\geq 1$ we study (undirected) graphs with vertices $1, ..., n$ such that the vertices can be partitioned into $l$ parts such that every vertex has at most $d$ neighbours in its own part. The set of all such graphs is denoted $\\mbP_n(l,d)$. We prove a labelled first-order limit law, i.e., for every first-order sentence $\\varphi$, the proportion of graphs in $\\mbP_n(l,d)$ that satisfy $\\varphi$ converges as $n \\to \\infty$. By combining this result with a result of Hundack, Pr\\\"omel and Steger \\cite{HPS} we also prove that if $1 \\leq s_1 \\leq ... \\leq s_l$ are integers","authors_text":"Vera Koponen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-04-11T14:05:04Z","title":"A limit law of almost $l$-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2454","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:118d8509958e9b1ba16c9bcb9b598a9e729cb1d2a87042bfe833d35a8ec64f84","target":"record","created_at":"2026-05-18T03:33:26Z","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":"e0107ceaebd136abe44c079c0b851a7c671f645c542d52cef033afb55f74d2ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-04-11T14:05:04Z","title_canon_sha256":"4322a9ac9f813a5547d77f2df60ea479622d91a857063328082ad1b071f53417"},"schema_version":"1.0","source":{"id":"1204.2454","kind":"arxiv","version":2}},"canonical_sha256":"a8ff925fadc8c23d590cdc3723befdba6ec49257387aeee5c26504a324651ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8ff925fadc8c23d590cdc3723befdba6ec49257387aeee5c26504a324651ac4","first_computed_at":"2026-05-18T03:33:26.118587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:26.118587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qa4Cl27sy0VzsR7H2ZaTz4X37XnE/4aMSbaCajfJkzTCiGTs26OFbYVVqFmDxRTY+xXJc2D/3y/dvshK8ivaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:26.119481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:118d8509958e9b1ba16c9bcb9b598a9e729cb1d2a87042bfe833d35a8ec64f84","sha256:1a76338bedaf726e6f64784d6e2b274d3a43f089e93b5c27730b5e6aec1c14f2"],"state_sha256":"16f994b269266ebfcf1bcccdce14a59a291b11c7043c42f15991d3c47b644972"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZUACkzuCyzvmW5lQVE5JkrL69d7JN2IZy8n01/gCyUtxXitkKrSLWBLscYJGVFvov9ps387RNS1kpZXYg7QBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T14:44:02.208380Z","bundle_sha256":"173d095c1f7ab468c7e34fd7be6e8abbcd75d6731e6a8e9c1bb6e971d0567753"}}