{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TNBIL7QFWNFRXYJYEMGHRBHGQ3","short_pith_number":"pith:TNBIL7QF","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"},"canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","source":{"kind":"arxiv","id":"1308.0180","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0180","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0180v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0180","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"TNBIL7QFWNFR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TNBIL7QFWNFRXYJY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TNBIL7QF","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TNBIL7QFWNFRXYJYEMGHRBHGQ3","target":"record","payload":{"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"},"canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","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"},"source_kind":"arxiv","source_id":"1308.0180","source_version":1,"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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"an//jNOd122ygbxHI3T3I6UwJVvNTAgIN0UkosMSa978UVVy/HcnbtmsKSEvf+VHNNcySUGYYb7BCyV3fH3JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:02:43.943443Z"},"content_sha256":"f3e0c90b0942b8b5493ceff43465a5c969628ebdd4bc6e4cab8348701d174fa8","schema_version":"1.0","event_id":"sha256:f3e0c90b0942b8b5493ceff43465a5c969628ebdd4bc6e4cab8348701d174fa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TNBIL7QFWNFRXYJYEMGHRBHGQ3","target":"graph","payload":{"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"},"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-18T03:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4LJZ4sYEyg1rIkNAkdhyeKncJrk5Z5bn+etiPLwFIIh1mRkXLvzSrdUN+/9q6qejM5hBo6TOZyGr69gug2jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:02:43.943794Z"},"content_sha256":"4fcfb19cde550e870379e84107c46c48065c5d9df11ed62b95f05e61bf901739","schema_version":"1.0","event_id":"sha256:4fcfb19cde550e870379e84107c46c48065c5d9df11ed62b95f05e61bf901739"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/bundle.json","state_url":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/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-06-23T04:02:43Z","links":{"resolver":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3","bundle":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/bundle.json","state":"https://pith.science/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNBIL7QFWNFRXYJYEMGHRBHGQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TNBIL7QFWNFRXYJYEMGHRBHGQ3","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":"cd0c2330ea1aca99498562568147b26aa632c684a4ecf7e468cc71dde8d77813","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-01T12:51:16Z","title_canon_sha256":"d95f0974f4de7cee2eb0e13ac34a4d29eb3ff70a6dada68d798af8c50f2eb2ec"},"schema_version":"1.0","source":{"id":"1308.0180","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0180","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0180v1","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0180","created_at":"2026-05-18T03:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"TNBIL7QFWNFR","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TNBIL7QFWNFRXYJY","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TNBIL7QF","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:4fcfb19cde550e870379e84107c46c48065c5d9df11ed62b95f05e61bf901739","target":"graph","created_at":"2026-05-18T03:16:59Z","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":"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","authors_text":"Arash Rafiey, Benoit Larose, Laszlo Egri, Pavol Hell","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-01T12:51:16Z","title":"Space complexity of list H-colouring: a dichotomy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0180","kind":"arxiv","version":1},"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:f3e0c90b0942b8b5493ceff43465a5c969628ebdd4bc6e4cab8348701d174fa8","target":"record","created_at":"2026-05-18T03:16:59Z","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":"cd0c2330ea1aca99498562568147b26aa632c684a4ecf7e468cc71dde8d77813","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-01T12:51:16Z","title_canon_sha256":"d95f0974f4de7cee2eb0e13ac34a4d29eb3ff70a6dada68d798af8c50f2eb2ec"},"schema_version":"1.0","source":{"id":"1308.0180","kind":"arxiv","version":1}},"canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b4285fe05b34b1be138230c7884e686e41c908e546ea59ff74bc5a009428b55","first_computed_at":"2026-05-18T03:16:59.613816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:59.613816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/FtWvEeMiJMAV2Gj8UPoblAtDnEFj9fuJlmW7LoJw6/a42KU/WtJMgD9zEnaoOoJrlyC1xmuv7/5KFmKwZV4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:59.614461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0180","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3e0c90b0942b8b5493ceff43465a5c969628ebdd4bc6e4cab8348701d174fa8","sha256:4fcfb19cde550e870379e84107c46c48065c5d9df11ed62b95f05e61bf901739"],"state_sha256":"a51b1020038a0f9613919569f80ea5d5b8687ee24ac92ec142752206696d75e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuLH6VFmcf4MNJ/K3W+Jqp71MXCwVPJ3UeqFfSBg3qYqiRfZZ0AGU2jsA3kkyGNsMhr24VHECJf46v7Bhc+pCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:02:43.945766Z","bundle_sha256":"514c05190479f5c6ddcbb85feaebb90a0e6ffc5e7a7aba3f6560b2c1dd021a0c"}}