{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2INEBELBGAJNVGOIMFPFWO5B2T","short_pith_number":"pith:2INEBELB","schema_version":"1.0","canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","source":{"kind":"arxiv","id":"1407.7799","version":4},"attestation_state":"computed","paper":{"title":"Counting $4\\times 4$ Matrix Partitions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Richerby, Leslie Ann Goldberg, Martin Dyer","submitted_at":"2014-07-29T17:54:05Z","abstract_excerpt":"Given a symmetric matrix $M\\in \\{0,1,*\\}^{D\\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that, when $|D|=4$, the problem of counting the $M$-partitions of an input graph is either in FP or is #P-complete. Tractability is proved by reduction to the related problem of counting list $M$-partitions; intractability is shown using a gadget construction and interpolation. We use a computer program to determine which of the two cases holds for all but a small nu"},"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":"1407.7799","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-29T17:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"68cf8d5c6284c595efa1c29595813722d6962249f9961d537f59db09ef9d0b8c","abstract_canon_sha256":"c34612afafdcab76e61f1ba9bcad20a5769892cb8a48ade7078889d13af0bdf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:43.960603Z","signature_b64":"g/bZ3iLn9OKU9lpqm3r0nTPKBKTuEnceUeEx1pJ7Mw+gce4cNEzhahyFvfpWcWGvj3J5diSSOoRkgBdqE2GOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","last_reissued_at":"2026-05-18T01:11:43.960238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:43.960238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting $4\\times 4$ Matrix Partitions of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Richerby, Leslie Ann Goldberg, Martin Dyer","submitted_at":"2014-07-29T17:54:05Z","abstract_excerpt":"Given a symmetric matrix $M\\in \\{0,1,*\\}^{D\\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that, when $|D|=4$, the problem of counting the $M$-partitions of an input graph is either in FP or is #P-complete. Tractability is proved by reduction to the related problem of counting list $M$-partitions; intractability is shown using a gadget construction and interpolation. We use a computer program to determine which of the two cases holds for all but a small nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7799","kind":"arxiv","version":4},"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":"1407.7799","created_at":"2026-05-18T01:11:43.960309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7799v4","created_at":"2026-05-18T01:11:43.960309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7799","created_at":"2026-05-18T01:11:43.960309+00:00"},{"alias_kind":"pith_short_12","alias_value":"2INEBELBGAJN","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2INEBELBGAJNVGOI","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2INEBELB","created_at":"2026-05-18T12:28:11.866339+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/2INEBELBGAJNVGOIMFPFWO5B2T","json":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T.json","graph_json":"https://pith.science/api/pith-number/2INEBELBGAJNVGOIMFPFWO5B2T/graph.json","events_json":"https://pith.science/api/pith-number/2INEBELBGAJNVGOIMFPFWO5B2T/events.json","paper":"https://pith.science/paper/2INEBELB"},"agent_actions":{"view_html":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T","download_json":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T.json","view_paper":"https://pith.science/paper/2INEBELB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7799&json=true","fetch_graph":"https://pith.science/api/pith-number/2INEBELBGAJNVGOIMFPFWO5B2T/graph.json","fetch_events":"https://pith.science/api/pith-number/2INEBELBGAJNVGOIMFPFWO5B2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/action/storage_attestation","attest_author":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/action/author_attestation","sign_citation":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/action/citation_signature","submit_replication":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/action/replication_record"}},"created_at":"2026-05-18T01:11:43.960309+00:00","updated_at":"2026-05-18T01:11:43.960309+00:00"}