{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TNBIL7QFWNFRXYJYEMGHRBHGQ3","short_pith_number":"pith:TNBIL7QF","schema_version":"1.0","canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","source":{"kind":"arxiv","id":"1308.0180","version":1},"attestation_state":"computed","paper":{"title":"Space complexity of list H-colouring: a dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Arash Rafiey, Benoit Larose, Laszlo Egri, Pavol Hell","submitted_at":"2013-08-01T12:51:16Z","abstract_excerpt":"The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A. Bulatov (2003). We augment this result by showing that for digraph templates H, every conservative CSP, denoted LHOM(H), is solvable in logspace or is hard for NL. More precisely, we introduce a digraph structure we call a circular N, and prove the following dichotomy: if H contains no circular N then LHOM(H) admits a logspace algorithm, and otherwise LHOM(H) is h"},"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":"1308.0180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-01T12:51:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d95f0974f4de7cee2eb0e13ac34a4d29eb3ff70a6dada68d798af8c50f2eb2ec","abstract_canon_sha256":"cd0c2330ea1aca99498562568147b26aa632c684a4ecf7e468cc71dde8d77813"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:59.614461Z","signature_b64":"/FtWvEeMiJMAV2Gj8UPoblAtDnEFj9fuJlmW7LoJw6/a42KU/WtJMgD9zEnaoOoJrlyC1xmuv7/5KFmKwZV4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","last_reissued_at":"2026-05-18T03:16:59.613816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:59.613816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space complexity of list H-colouring: a dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Arash Rafiey, Benoit Larose, Laszlo Egri, Pavol Hell","submitted_at":"2013-08-01T12:51:16Z","abstract_excerpt":"The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A. Bulatov (2003). We augment this result by showing that for digraph templates H, every conservative CSP, denoted LHOM(H), is solvable in logspace or is hard for NL. More precisely, we introduce a digraph structure we call a circular N, and prove the following dichotomy: if H contains no circular N then LHOM(H) admits a logspace algorithm, and otherwise LHOM(H) is h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0180","kind":"arxiv","version":1},"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":"1308.0180","created_at":"2026-05-18T03:16:59.613899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0180v1","created_at":"2026-05-18T03:16:59.613899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0180","created_at":"2026-05-18T03:16:59.613899+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNBIL7QFWNFR","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNBIL7QFWNFRXYJY","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNBIL7QF","created_at":"2026-05-18T12:28:02.375192+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/TNBIL7QFWNFRXYJYEMGHRBHGQ3","json":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3.json","graph_json":"https://pith.science/api/pith-number/TNBIL7QFWNFRXYJYEMGHRBHGQ3/graph.json","events_json":"https://pith.science/api/pith-number/TNBIL7QFWNFRXYJYEMGHRBHGQ3/events.json","paper":"https://pith.science/paper/TNBIL7QF"},"agent_actions":{"view_html":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3","download_json":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3.json","view_paper":"https://pith.science/paper/TNBIL7QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0180&json=true","fetch_graph":"https://pith.science/api/pith-number/TNBIL7QFWNFRXYJYEMGHRBHGQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/TNBIL7QFWNFRXYJYEMGHRBHGQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/action/storage_attestation","attest_author":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/action/author_attestation","sign_citation":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/action/citation_signature","submit_replication":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/action/replication_record"}},"created_at":"2026-05-18T03:16:59.613899+00:00","updated_at":"2026-05-18T03:16:59.613899+00:00"}