{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:57TYBDHDBHHW55UDMQVN4WTJGH","short_pith_number":"pith:57TYBDHD","schema_version":"1.0","canonical_sha256":"efe7808ce309cf6ef683642ade5a6931c0e86b479ed6c34c5987fcca807e395f","source":{"kind":"arxiv","id":"1306.5176","version":3},"attestation_state":"computed","paper":{"title":"Counting list matrix partitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas G\\\"obel, Colin McQuillan, David Richerby, Leslie Ann Goldberg, Tomoyuki Yamakami","submitted_at":"2013-06-21T15:41:59Z","abstract_excerpt":"Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G is a partition of G's vertices into D parts associated with the rows of M. The part of each vertex is chosen from a given list so that no edge of G maps to a 0 in M and no non-edge of G maps to a 1 in M. Many important graph-theoretic structures can be represented as list M-partitions, such as graph colourings, split graphs and homogeneous sets and pairs, which arise in the proofs of the weak and strong perfect graph conjectures. There has been quite a bit of work on determining for which matrices M computations invol"},"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":"1306.5176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-21T15:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"e2794a485edc24e77a8e021d595dc6b45e60ed1d28dda196905e3d6cf2cef554","abstract_canon_sha256":"b3213e060d3ec685f9b50c5cd4c380aa53ed87e5b74a5c82fe324974b41826fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:33.240354Z","signature_b64":"76EgiGCZEeab+s2jpSW5Q7mD4Sg+qKoPrvFO/LWeuyDAz6wxeMZ3npq6MxedE5KuJVbN4fJvWcNrZj6uFCI6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efe7808ce309cf6ef683642ade5a6931c0e86b479ed6c34c5987fcca807e395f","last_reissued_at":"2026-05-18T02:18:33.239838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:33.239838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting list matrix partitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andreas G\\\"obel, Colin McQuillan, David Richerby, Leslie Ann Goldberg, Tomoyuki Yamakami","submitted_at":"2013-06-21T15:41:59Z","abstract_excerpt":"Given a symmetric D*D matrix M over {0,1,*}, a list M-partition of a graph G is a partition of G's vertices into D parts associated with the rows of M. The part of each vertex is chosen from a given list so that no edge of G maps to a 0 in M and no non-edge of G maps to a 1 in M. Many important graph-theoretic structures can be represented as list M-partitions, such as graph colourings, split graphs and homogeneous sets and pairs, which arise in the proofs of the weak and strong perfect graph conjectures. There has been quite a bit of work on determining for which matrices M computations invol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5176","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":"1306.5176","created_at":"2026-05-18T02:18:33.239917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5176v3","created_at":"2026-05-18T02:18:33.239917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5176","created_at":"2026-05-18T02:18:33.239917+00:00"},{"alias_kind":"pith_short_12","alias_value":"57TYBDHDBHHW","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"57TYBDHDBHHW55UD","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"57TYBDHD","created_at":"2026-05-18T12:27:34.582898+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/57TYBDHDBHHW55UDMQVN4WTJGH","json":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH.json","graph_json":"https://pith.science/api/pith-number/57TYBDHDBHHW55UDMQVN4WTJGH/graph.json","events_json":"https://pith.science/api/pith-number/57TYBDHDBHHW55UDMQVN4WTJGH/events.json","paper":"https://pith.science/paper/57TYBDHD"},"agent_actions":{"view_html":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH","download_json":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH.json","view_paper":"https://pith.science/paper/57TYBDHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5176&json=true","fetch_graph":"https://pith.science/api/pith-number/57TYBDHDBHHW55UDMQVN4WTJGH/graph.json","fetch_events":"https://pith.science/api/pith-number/57TYBDHDBHHW55UDMQVN4WTJGH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH/action/storage_attestation","attest_author":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH/action/author_attestation","sign_citation":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH/action/citation_signature","submit_replication":"https://pith.science/pith/57TYBDHDBHHW55UDMQVN4WTJGH/action/replication_record"}},"created_at":"2026-05-18T02:18:33.239917+00:00","updated_at":"2026-05-18T02:18:33.239917+00:00"}