{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3DDAGAAQ2RFKPNC3HENLP2I4LL","short_pith_number":"pith:3DDAGAAQ","schema_version":"1.0","canonical_sha256":"d8c6030010d44aa7b45b391ab7e91c5afccceddfa7fe84bf5366770f7b003d50","source":{"kind":"arxiv","id":"1701.02409","version":5},"attestation_state":"computed","paper":{"title":"Dichotomy for Digraph Homomorphism Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arash Rafiey, Ashwin Murali, Jeff Kinne, Tom\\'as Feder","submitted_at":"2017-01-10T02:07:33Z","abstract_excerpt":"We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is polynomial time solvable? This gives a proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi [29]. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov [9] and Zhuk [46] in 2017. We have implemented our algorithm and show some experimental results."},"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":"1701.02409","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-10T02:07:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d0f1ae01107b126e93e2882a5d8f140ae1ba62de82635be8db6b584120e3edae","abstract_canon_sha256":"228d57f6ce486ba7c89176890ee5b2fa057acff234a2e704b7e8667e19b64b30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:33.012022Z","signature_b64":"/toCns1gznb951OW3pBB2DQVh/ar0fkT5T0HG6WAWMWZhX1oQv+tFi/ePGVkKoCMGRxsV8sfiXomqKelreoFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c6030010d44aa7b45b391ab7e91c5afccceddfa7fe84bf5366770f7b003d50","last_reissued_at":"2026-07-05T01:25:33.011542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:33.011542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dichotomy for Digraph Homomorphism Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arash Rafiey, Ashwin Murali, Jeff Kinne, Tom\\'as Feder","submitted_at":"2017-01-10T02:07:33Z","abstract_excerpt":"We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is polynomial time solvable? This gives a proof of the dichotomy conjecture (now dichotomy theorem) by Feder and Vardi [29]. Our approach is combinatorial, and it is simpler than the two algorithms found by Bulatov [9] and Zhuk [46] in 2017. We have implemented our algorithm and show some experimental results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02409","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1701.02409/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1701.02409","created_at":"2026-07-05T01:25:33.011600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02409v5","created_at":"2026-07-05T01:25:33.011600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02409","created_at":"2026-07-05T01:25:33.011600+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DDAGAAQ2RFK","created_at":"2026-07-05T01:25:33.011600+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DDAGAAQ2RFKPNC3","created_at":"2026-07-05T01:25:33.011600+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DDAGAAQ","created_at":"2026-07-05T01:25:33.011600+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/3DDAGAAQ2RFKPNC3HENLP2I4LL","json":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL.json","graph_json":"https://pith.science/api/pith-number/3DDAGAAQ2RFKPNC3HENLP2I4LL/graph.json","events_json":"https://pith.science/api/pith-number/3DDAGAAQ2RFKPNC3HENLP2I4LL/events.json","paper":"https://pith.science/paper/3DDAGAAQ"},"agent_actions":{"view_html":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL","download_json":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL.json","view_paper":"https://pith.science/paper/3DDAGAAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02409&json=true","fetch_graph":"https://pith.science/api/pith-number/3DDAGAAQ2RFKPNC3HENLP2I4LL/graph.json","fetch_events":"https://pith.science/api/pith-number/3DDAGAAQ2RFKPNC3HENLP2I4LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL/action/storage_attestation","attest_author":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL/action/author_attestation","sign_citation":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL/action/citation_signature","submit_replication":"https://pith.science/pith/3DDAGAAQ2RFKPNC3HENLP2I4LL/action/replication_record"}},"created_at":"2026-07-05T01:25:33.011600+00:00","updated_at":"2026-07-05T01:25:33.011600+00:00"}