{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HXK2UM3E5RU374KWWU37J4GOY2","short_pith_number":"pith:HXK2UM3E","schema_version":"1.0","canonical_sha256":"3dd5aa3364ec69bff156b537f4f0cec692d68e607e701a2395298d6a1f4b6e52","source":{"kind":"arxiv","id":"1602.03985","version":6},"attestation_state":"computed","paper":{"title":"A complexity trichotomy for approximately counting list H-colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2016-02-12T09:14:23Z","abstract_excerpt":"We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexive proper interval graph then approximately counting list H-colourings is equivalent to #BIS, the problem of approximately counting independent sets in a bipartite graph. This is a well-studied problem wh"},"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":"1602.03985","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-12T09:14:23Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ba97d86373fabc911a2bb6a9ce28b4409f18c968f1d49801ed18fe27a1e4cb72","abstract_canon_sha256":"868517208012840936d767527f509beab64758a1b0aa85271c085af42d5e5e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:20.996128Z","signature_b64":"bt1ihHteIhNSojdrQGAJxiMvCgesqF+G8tb65M1UPrbA06srHMbXDm1fPNGxZxW35CKmr3CNPqjiXw8rvXWKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd5aa3364ec69bff156b537f4f0cec692d68e607e701a2395298d6a1f4b6e52","last_reissued_at":"2026-05-18T00:53:20.995710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:20.995710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complexity trichotomy for approximately counting list H-colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2016-02-12T09:14:23Z","abstract_excerpt":"We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexive proper interval graph then approximately counting list H-colourings is equivalent to #BIS, the problem of approximately counting independent sets in a bipartite graph. This is a well-studied problem wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03985","kind":"arxiv","version":6},"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":"1602.03985","created_at":"2026-05-18T00:53:20.995784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03985v6","created_at":"2026-05-18T00:53:20.995784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03985","created_at":"2026-05-18T00:53:20.995784+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXK2UM3E5RU3","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXK2UM3E5RU374KW","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXK2UM3E","created_at":"2026-05-18T12:30:22.444734+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/HXK2UM3E5RU374KWWU37J4GOY2","json":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2.json","graph_json":"https://pith.science/api/pith-number/HXK2UM3E5RU374KWWU37J4GOY2/graph.json","events_json":"https://pith.science/api/pith-number/HXK2UM3E5RU374KWWU37J4GOY2/events.json","paper":"https://pith.science/paper/HXK2UM3E"},"agent_actions":{"view_html":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2","download_json":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2.json","view_paper":"https://pith.science/paper/HXK2UM3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03985&json=true","fetch_graph":"https://pith.science/api/pith-number/HXK2UM3E5RU374KWWU37J4GOY2/graph.json","fetch_events":"https://pith.science/api/pith-number/HXK2UM3E5RU374KWWU37J4GOY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2/action/storage_attestation","attest_author":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2/action/author_attestation","sign_citation":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2/action/citation_signature","submit_replication":"https://pith.science/pith/HXK2UM3E5RU374KWWU37J4GOY2/action/replication_record"}},"created_at":"2026-05-18T00:53:20.995784+00:00","updated_at":"2026-05-18T00:53:20.995784+00:00"}