{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2BNF7L6HZFGT2PC4TXKQU6MTSD","short_pith_number":"pith:2BNF7L6H","schema_version":"1.0","canonical_sha256":"d05a5fafc7c94d3d3c5c9dd50a799390c13381184581a733635e498b62d5dc65","source":{"kind":"arxiv","id":"2008.09921","version":2},"attestation_state":"computed","paper":{"title":"Digraphs Homomorphism Problems with Maltsev Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Ashwin Murali, Jeff Kinne","submitted_at":"2020-08-22T22:17:18Z","abstract_excerpt":"We consider a generalization of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$, HOM($H$). In this setting, we are given an input digraph $G$ together with a list function from $G$ to $2^H$. The goal is to find a homomorphism from $G$ to $H$ with respect to the lists if one exists.\n  We show that if the list function is a Maltsev polymorphism then deciding whether $G$ admits a homomorphism to $H$ is polynomial time solvable. In our approach, we only use the existence of the Maltsev polymorphism. Furthermore, we show that deciding whether a relational structure $\\mathcal"},"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":"2008.09921","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-08-22T22:17:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"01a19b2e045b7c79ea8f03246435b6031a115ca66e41b07b7b1b0892770b0c25","abstract_canon_sha256":"7d62b21f07f3aeabcc6478d3f6ca20a893d2c29a80d866ebcf5b7d4efcb1f9f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:08.813171Z","signature_b64":"vaoke4aWyFe0SMH03DbRkqMYU/3nydFQPIqkznBXj4+DUK7eVZqiNvgc/tp7uu1XnDwI1XpCei7+k+ycg1xGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d05a5fafc7c94d3d3c5c9dd50a799390c13381184581a733635e498b62d5dc65","last_reissued_at":"2026-07-05T01:51:08.812793Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:08.812793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digraphs Homomorphism Problems with Maltsev Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey, Ashwin Murali, Jeff Kinne","submitted_at":"2020-08-22T22:17:18Z","abstract_excerpt":"We consider a generalization of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$, HOM($H$). In this setting, we are given an input digraph $G$ together with a list function from $G$ to $2^H$. The goal is to find a homomorphism from $G$ to $H$ with respect to the lists if one exists.\n  We show that if the list function is a Maltsev polymorphism then deciding whether $G$ admits a homomorphism to $H$ is polynomial time solvable. In our approach, we only use the existence of the Maltsev polymorphism. Furthermore, we show that deciding whether a relational structure $\\mathcal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.09921","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.09921/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":"2008.09921","created_at":"2026-07-05T01:51:08.812852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.09921v2","created_at":"2026-07-05T01:51:08.812852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.09921","created_at":"2026-07-05T01:51:08.812852+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BNF7L6HZFGT","created_at":"2026-07-05T01:51:08.812852+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BNF7L6HZFGT2PC4","created_at":"2026-07-05T01:51:08.812852+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BNF7L6H","created_at":"2026-07-05T01:51:08.812852+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/2BNF7L6HZFGT2PC4TXKQU6MTSD","json":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD.json","graph_json":"https://pith.science/api/pith-number/2BNF7L6HZFGT2PC4TXKQU6MTSD/graph.json","events_json":"https://pith.science/api/pith-number/2BNF7L6HZFGT2PC4TXKQU6MTSD/events.json","paper":"https://pith.science/paper/2BNF7L6H"},"agent_actions":{"view_html":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD","download_json":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD.json","view_paper":"https://pith.science/paper/2BNF7L6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.09921&json=true","fetch_graph":"https://pith.science/api/pith-number/2BNF7L6HZFGT2PC4TXKQU6MTSD/graph.json","fetch_events":"https://pith.science/api/pith-number/2BNF7L6HZFGT2PC4TXKQU6MTSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD/action/storage_attestation","attest_author":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD/action/author_attestation","sign_citation":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD/action/citation_signature","submit_replication":"https://pith.science/pith/2BNF7L6HZFGT2PC4TXKQU6MTSD/action/replication_record"}},"created_at":"2026-07-05T01:51:08.812852+00:00","updated_at":"2026-07-05T01:51:08.812852+00:00"}