{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OKEHJNE6KF3QCPOV7SZ6RFU4VT","short_pith_number":"pith:OKEHJNE6","schema_version":"1.0","canonical_sha256":"728874b49e5177013dd5fcb3e8969cacebd70b52c3b7c715adda076773d6a39c","source":{"kind":"arxiv","id":"1211.2243","version":3},"attestation_state":"computed","paper":{"title":"Graph decomposition and parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Redlich, Bobby DeMarco","submitted_at":"2012-11-09T21:10:45Z","abstract_excerpt":"Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a sufficient condition for this distribution to tend to uniform modulo $q$. We determine the asymptotic distribution of all fixed two-component graphs in $G(n,p)$ for all $q$, and we give infinite families of many-component graphs with a uniform asymptotic distribution for all $q$. We also prove a negative result, that no simple proof of uniform asymptotic distri"},"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":"1211.2243","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-09T21:10:45Z","cross_cats_sorted":[],"title_canon_sha256":"f343fc328356fa49eefe6da0226f6abcc58353bfa0bdd4d61ca531700573aa24","abstract_canon_sha256":"5324f7bfbb3143b8abbd22423e8843ed347d742959aa42563793d28617422bd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:13.580653Z","signature_b64":"8pGqILUVrgVtTN2zifo9tpPiQHQQNd21ZKkl8I66tYLMJPChxOxSL5JsMbYRflsEa+zAk1xntukNSmfKhzSNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"728874b49e5177013dd5fcb3e8969cacebd70b52c3b7c715adda076773d6a39c","last_reissued_at":"2026-05-18T02:28:13.579830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:13.579830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph decomposition and parity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amanda Redlich, Bobby DeMarco","submitted_at":"2012-11-09T21:10:45Z","abstract_excerpt":"Motivated by a recent extension of the zero-one law by Kolaitis and Kopparty, we study the distribution of the number of copies of a fixed disconnected graph in the random graph $G(n,p)$. We use an idea of graph decompositions to give a sufficient condition for this distribution to tend to uniform modulo $q$. We determine the asymptotic distribution of all fixed two-component graphs in $G(n,p)$ for all $q$, and we give infinite families of many-component graphs with a uniform asymptotic distribution for all $q$. We also prove a negative result, that no simple proof of uniform asymptotic distri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2243","kind":"arxiv","version":3},"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":"1211.2243","created_at":"2026-05-18T02:28:13.579945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.2243v3","created_at":"2026-05-18T02:28:13.579945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2243","created_at":"2026-05-18T02:28:13.579945+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKEHJNE6KF3Q","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKEHJNE6KF3QCPOV","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKEHJNE6","created_at":"2026-05-18T12:27:16.716162+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/OKEHJNE6KF3QCPOV7SZ6RFU4VT","json":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT.json","graph_json":"https://pith.science/api/pith-number/OKEHJNE6KF3QCPOV7SZ6RFU4VT/graph.json","events_json":"https://pith.science/api/pith-number/OKEHJNE6KF3QCPOV7SZ6RFU4VT/events.json","paper":"https://pith.science/paper/OKEHJNE6"},"agent_actions":{"view_html":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT","download_json":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT.json","view_paper":"https://pith.science/paper/OKEHJNE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.2243&json=true","fetch_graph":"https://pith.science/api/pith-number/OKEHJNE6KF3QCPOV7SZ6RFU4VT/graph.json","fetch_events":"https://pith.science/api/pith-number/OKEHJNE6KF3QCPOV7SZ6RFU4VT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT/action/storage_attestation","attest_author":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT/action/author_attestation","sign_citation":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT/action/citation_signature","submit_replication":"https://pith.science/pith/OKEHJNE6KF3QCPOV7SZ6RFU4VT/action/replication_record"}},"created_at":"2026-05-18T02:28:13.579945+00:00","updated_at":"2026-05-18T02:28:13.579945+00:00"}