{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5A3BSTYIKNDHV4NAWTJERVONWN","short_pith_number":"pith:5A3BSTYI","schema_version":"1.0","canonical_sha256":"e836194f0853467af1a0b4d248d5cdb35ce7b5ebe6b6d02729c77b9cee20b1d5","source":{"kind":"arxiv","id":"1607.04777","version":2},"attestation_state":"computed","paper":{"title":"The complexity of tropical graph homomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ararat Harutyunyan, Florent Foucaud, Pavol Hell, Reza Naserasr, Sylvain Legay, Yannis Manoussakis","submitted_at":"2016-07-16T17:58:36Z","abstract_excerpt":"A tropical graph $(H,c)$ consists of a graph $H$ and a (not necessarily proper) vertex-colouring $c$ of $H$. Given two tropical graphs $(G,c_1)$ and $(H,c)$, a homomorphism of $(G,c_1)$ to $(H,c)$ is a standard graph homomorphism of $G$ to $H$ that also preserves the vertex-colours. We initiate the study of the computational complexity of tropical graph homomorphism problems. We consider two settings. First, when the tropical graph $(H,c)$ is fixed; this is a problem called $(H,c)$-COLOURING. Second, when the colouring of $H$ is part of the input; the associated decision problem is called $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":"1607.04777","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-16T17:58:36Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"29dc03d590b4b0dee96bae12276548dfde26c4bf15f88a9e056ddfe88becdac4","abstract_canon_sha256":"9805e7513db99e7fb97a3691343a10562a74f73c1dc4f8fbdc0ead490e958e0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:53.285220Z","signature_b64":"YfXf/WGOdeEG2lz64HBzMXSGkfagtzdlbY7i2ZH7UbpQOPgIFaXzhR+nOWKCSiZnx55SPY7ezHSrDeU08o/3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e836194f0853467af1a0b4d248d5cdb35ce7b5ebe6b6d02729c77b9cee20b1d5","last_reissued_at":"2026-05-18T00:24:53.284518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:53.284518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of tropical graph homomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ararat Harutyunyan, Florent Foucaud, Pavol Hell, Reza Naserasr, Sylvain Legay, Yannis Manoussakis","submitted_at":"2016-07-16T17:58:36Z","abstract_excerpt":"A tropical graph $(H,c)$ consists of a graph $H$ and a (not necessarily proper) vertex-colouring $c$ of $H$. Given two tropical graphs $(G,c_1)$ and $(H,c)$, a homomorphism of $(G,c_1)$ to $(H,c)$ is a standard graph homomorphism of $G$ to $H$ that also preserves the vertex-colours. We initiate the study of the computational complexity of tropical graph homomorphism problems. We consider two settings. First, when the tropical graph $(H,c)$ is fixed; this is a problem called $(H,c)$-COLOURING. Second, when the colouring of $H$ is part of the input; the associated decision problem is called $H$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04777","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":""},"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":"1607.04777","created_at":"2026-05-18T00:24:53.284634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04777v2","created_at":"2026-05-18T00:24:53.284634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04777","created_at":"2026-05-18T00:24:53.284634+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A3BSTYIKNDH","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A3BSTYIKNDHV4NA","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A3BSTYI","created_at":"2026-05-18T12:29:58.707656+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/5A3BSTYIKNDHV4NAWTJERVONWN","json":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN.json","graph_json":"https://pith.science/api/pith-number/5A3BSTYIKNDHV4NAWTJERVONWN/graph.json","events_json":"https://pith.science/api/pith-number/5A3BSTYIKNDHV4NAWTJERVONWN/events.json","paper":"https://pith.science/paper/5A3BSTYI"},"agent_actions":{"view_html":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN","download_json":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN.json","view_paper":"https://pith.science/paper/5A3BSTYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04777&json=true","fetch_graph":"https://pith.science/api/pith-number/5A3BSTYIKNDHV4NAWTJERVONWN/graph.json","fetch_events":"https://pith.science/api/pith-number/5A3BSTYIKNDHV4NAWTJERVONWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN/action/storage_attestation","attest_author":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN/action/author_attestation","sign_citation":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN/action/citation_signature","submit_replication":"https://pith.science/pith/5A3BSTYIKNDHV4NAWTJERVONWN/action/replication_record"}},"created_at":"2026-05-18T00:24:53.284634+00:00","updated_at":"2026-05-18T00:24:53.284634+00:00"}