{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PBPKDZINNSU4A35STV7V2BYKOY","short_pith_number":"pith:PBPKDZIN","schema_version":"1.0","canonical_sha256":"785ea1e50d6ca9c06fb29d7f5d070a7621b1ca81595fdf474c9e26f286ceec66","source":{"kind":"arxiv","id":"1502.01335","version":2},"attestation_state":"computed","paper":{"title":"Approximately Counting H-Colourings is #BIS-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2015-02-04T20:57:56Z","abstract_excerpt":"We consider the problem of counting H-colourings from an input graph G to a target graph H. We show that if H is any fixed graph without trivial components, then the problem is as hard as the well-known problem #BIS, which is the problem of (approximately) counting independent sets in a bipartite graph. #BIS is a complete problem in an important complexity class for approximate counting, and is believed not to have an FPRAS. If this is so, then our result shows that for every graph H without trivial components, the H-colouring counting problem has no FPRAS. This problem was studied a decade ag"},"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":"1502.01335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-02-04T20:57:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd95f87dc0a8af6577e158921d29562c82f147ac9724f0ce5455f19e57ae58db","abstract_canon_sha256":"619552ee3788ba3816f65386b64c53d6855285ef4d20a9348e69670ba18f6c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:31.068221Z","signature_b64":"FU7X1wKSZvEuMh/zClVLZHKuE2mrXY+bcq5Qjmjz+k8Iuop4ITAIIGLiPvO7fz/TGaGTRxRrJhWPV9b6VIdvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785ea1e50d6ca9c06fb29d7f5d070a7621b1ca81595fdf474c9e26f286ceec66","last_reissued_at":"2026-05-18T01:13:31.067492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:31.067492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately Counting H-Colourings is #BIS-Hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2015-02-04T20:57:56Z","abstract_excerpt":"We consider the problem of counting H-colourings from an input graph G to a target graph H. We show that if H is any fixed graph without trivial components, then the problem is as hard as the well-known problem #BIS, which is the problem of (approximately) counting independent sets in a bipartite graph. #BIS is a complete problem in an important complexity class for approximate counting, and is believed not to have an FPRAS. If this is so, then our result shows that for every graph H without trivial components, the H-colouring counting problem has no FPRAS. This problem was studied a decade ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01335","kind":"arxiv","version":2},"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":"1502.01335","created_at":"2026-05-18T01:13:31.067608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01335v2","created_at":"2026-05-18T01:13:31.067608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01335","created_at":"2026-05-18T01:13:31.067608+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBPKDZINNSU4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBPKDZINNSU4A35S","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBPKDZIN","created_at":"2026-05-18T12:29:37.295048+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/PBPKDZINNSU4A35STV7V2BYKOY","json":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY.json","graph_json":"https://pith.science/api/pith-number/PBPKDZINNSU4A35STV7V2BYKOY/graph.json","events_json":"https://pith.science/api/pith-number/PBPKDZINNSU4A35STV7V2BYKOY/events.json","paper":"https://pith.science/paper/PBPKDZIN"},"agent_actions":{"view_html":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY","download_json":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY.json","view_paper":"https://pith.science/paper/PBPKDZIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01335&json=true","fetch_graph":"https://pith.science/api/pith-number/PBPKDZINNSU4A35STV7V2BYKOY/graph.json","fetch_events":"https://pith.science/api/pith-number/PBPKDZINNSU4A35STV7V2BYKOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY/action/storage_attestation","attest_author":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY/action/author_attestation","sign_citation":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY/action/citation_signature","submit_replication":"https://pith.science/pith/PBPKDZINNSU4A35STV7V2BYKOY/action/replication_record"}},"created_at":"2026-05-18T01:13:31.067608+00:00","updated_at":"2026-05-18T01:13:31.067608+00:00"}