{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DD4XBUVKRE7CR7EPCLCSI5CQFV","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":"c1a197801170dac61006ccde2aa4a5e980c81214ff2e8f160ab2573049c2e595","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T09:59:22Z","title_canon_sha256":"bc11c5892d35c738bc665383361129c571acd9fd9f73a25f7e7e53a47cf73710"},"schema_version":"1.0","source":{"id":"1210.2544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2544","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2544v2","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2544","created_at":"2026-05-18T03:27:22Z"},{"alias_kind":"pith_short_12","alias_value":"DD4XBUVKRE7C","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"DD4XBUVKRE7CR7EP","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"DD4XBUVK","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:e1ffc1bdfa11420f274df414a08a7d5f83a89905dc1a1df3fba14ae9c72119c7","target":"graph","created_at":"2026-05-18T03:27:22Z","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":"We consider the Functional Orientation 2-Color problem, which was introduced by Valiant in his seminal paper on holographic algorithms [SIAM J. Comput., 37(5), 2008]. For this decision problem, Valiant gave a polynomial time holographic algorithm for planar graphs of maximum degree 3, and showed that the problem is NP-complete for planar graphs of maximum degree 10. A recent result on defective graph coloring by Corr\\^ea et al. [Australas. J. Combin., 43, 2009] implies that the problem is already hard for planar graphs of maximum degree 8. Together, these results leave open the hardness questi","authors_text":"Hjalte Wedel Vildh{\\o}j, Morten St\\\"ockel, S{\\o}ren B{\\o}g","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T09:59:22Z","title":"The Hardness of the Functional Orientation 2-Color Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2544","kind":"arxiv","version":2},"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:654ffb4efc338fe61e6a236edfe8de2aebbf26c29101c41964242fcfb551627b","target":"record","created_at":"2026-05-18T03:27:22Z","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":"c1a197801170dac61006ccde2aa4a5e980c81214ff2e8f160ab2573049c2e595","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-10-09T09:59:22Z","title_canon_sha256":"bc11c5892d35c738bc665383361129c571acd9fd9f73a25f7e7e53a47cf73710"},"schema_version":"1.0","source":{"id":"1210.2544","kind":"arxiv","version":2}},"canonical_sha256":"18f970d2aa893e28fc8f12c52474502d4afd9f40fb6a69a8a7e05e4debd2e5de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18f970d2aa893e28fc8f12c52474502d4afd9f40fb6a69a8a7e05e4debd2e5de","first_computed_at":"2026-05-18T03:27:22.935787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:22.935787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vlkE/yQiRbyu2jbJDXHBpYWdSIAuGRkw9Td0NtJ2sNAYy+Lt0bB3nZ1qcDIU8+Lanp3rpHEUZjyNlDt+l0b7Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:22.936397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:654ffb4efc338fe61e6a236edfe8de2aebbf26c29101c41964242fcfb551627b","sha256:e1ffc1bdfa11420f274df414a08a7d5f83a89905dc1a1df3fba14ae9c72119c7"],"state_sha256":"bf2dcc052705afb4614554e5376e319b2b7fb18e1d8a6b0c7044cc38b8aaf9e2"}