{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2INEBELBGAJNVGOIMFPFWO5B2T","short_pith_number":"pith:2INEBELB","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"},"canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","source":{"kind":"arxiv","id":"1407.7799","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7799","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7799v4","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7799","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"2INEBELBGAJN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2INEBELBGAJNVGOI","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2INEBELB","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2INEBELBGAJNVGOIMFPFWO5B2T","target":"record","payload":{"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"},"canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","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"},"source_kind":"arxiv","source_id":"1407.7799","source_version":4,"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-18T01:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16kKbQ3QCWUhxo0h0gNnJ7yyev9lcgDzyEXMVLZw38zMxhd56CuHL95Ye9x1HZmVi2ix1s2XpheaNehAxzMyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:51:33.792312Z"},"content_sha256":"b9e88018c76d32b700020818d5a96a59329ee0377af88758ac139936f10bbafa","schema_version":"1.0","event_id":"sha256:b9e88018c76d32b700020818d5a96a59329ee0377af88758ac139936f10bbafa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2INEBELBGAJNVGOIMFPFWO5B2T","target":"graph","payload":{"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"},"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-18T01:11:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EitZuAGXsXbXZhHdygLjyTDAqGLiFeZoXRHudqR3zIpOG2rIsWLVcgJfnKJXnNRjX2TMxuJHJT3Nx5sox5XFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:51:33.792754Z"},"content_sha256":"cd88154257e087838ce3b2e57b4ab9de83a2f439670b8d3b7264141f5e78f34d","schema_version":"1.0","event_id":"sha256:cd88154257e087838ce3b2e57b4ab9de83a2f439670b8d3b7264141f5e78f34d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/bundle.json","state_url":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2INEBELBGAJNVGOIMFPFWO5B2T/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-05-31T01:51:33Z","links":{"resolver":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T","bundle":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/bundle.json","state":"https://pith.science/pith/2INEBELBGAJNVGOIMFPFWO5B2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2INEBELBGAJNVGOIMFPFWO5B2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2INEBELBGAJNVGOIMFPFWO5B2T","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":"c34612afafdcab76e61f1ba9bcad20a5769892cb8a48ade7078889d13af0bdf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-29T17:54:05Z","title_canon_sha256":"68cf8d5c6284c595efa1c29595813722d6962249f9961d537f59db09ef9d0b8c"},"schema_version":"1.0","source":{"id":"1407.7799","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7799","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7799v4","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7799","created_at":"2026-05-18T01:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"2INEBELBGAJN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2INEBELBGAJNVGOI","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2INEBELB","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:cd88154257e087838ce3b2e57b4ab9de83a2f439670b8d3b7264141f5e78f34d","target":"graph","created_at":"2026-05-18T01:11:43Z","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":"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","authors_text":"David Richerby, Leslie Ann Goldberg, Martin Dyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-29T17:54:05Z","title":"Counting $4\\times 4$ Matrix Partitions of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7799","kind":"arxiv","version":4},"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:b9e88018c76d32b700020818d5a96a59329ee0377af88758ac139936f10bbafa","target":"record","created_at":"2026-05-18T01:11:43Z","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":"c34612afafdcab76e61f1ba9bcad20a5769892cb8a48ade7078889d13af0bdf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-07-29T17:54:05Z","title_canon_sha256":"68cf8d5c6284c595efa1c29595813722d6962249f9961d537f59db09ef9d0b8c"},"schema_version":"1.0","source":{"id":"1407.7799","kind":"arxiv","version":4}},"canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d21a4091613012da99c8615e5b3ba1d4e9c5c5ec9781b6387bcfafd9cb6eaa47","first_computed_at":"2026-05-18T01:11:43.960238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:43.960238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g/bZ3iLn9OKU9lpqm3r0nTPKBKTuEnceUeEx1pJ7Mw+gce4cNEzhahyFvfpWcWGvj3J5diSSOoRkgBdqE2GOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:43.960603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7799","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9e88018c76d32b700020818d5a96a59329ee0377af88758ac139936f10bbafa","sha256:cd88154257e087838ce3b2e57b4ab9de83a2f439670b8d3b7264141f5e78f34d"],"state_sha256":"1ae05e04e30ed55b1c6eec49520bc40af588527719cbfe2fc508edba713e7cc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmIpzMcqcswNvSBHDK0PHk6iloM3fmPU2UvgGMYqGqtOSxr7hmXBudEQrNSxUxsiFRX2ZERyTYTQRBiI42XoAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:51:33.795498Z","bundle_sha256":"97f02cb73d1e1d37c74faee2260933283899c5f667a6c915e8a7c23e4dd89dc9"}}