{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LYUUDXSXU5D4EGG2RS2Q7YCN5N","short_pith_number":"pith:LYUUDXSX","schema_version":"1.0","canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","source":{"kind":"arxiv","id":"1206.5106","version":1},"attestation_state":"computed","paper":{"title":"On List Colouring and List Homomorphism of Permutation and Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Gabor Tardos, Jessica Enright, Lorna Stewart","submitted_at":"2012-06-22T10:42:36Z","abstract_excerpt":"List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded total number of colours. More generally we give a polynomial-time algorithm that solves the list-homomorphism problem to any fixed target graph for a large class of input graphs including all permutation and interval graphs."},"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":"1206.5106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-22T10:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"2788064d6824ee23a31a805856ac59a9405090078be1575540cb91d246e9182f","abstract_canon_sha256":"02030f288ab94bde0f721b9d2d0a2b1f42bf18c045f39ac3f3799cd36d6e3d53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:52.237292Z","signature_b64":"rb3TMtiN0IIAIIOMjjddYHaMcyetns6wFnvGoIz7aVRvvdHT5LgeoHrAsLSIwMhpGO3e8Y9v/6tDebzHWyx9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","last_reissued_at":"2026-05-18T03:52:52.236462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:52.236462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On List Colouring and List Homomorphism of Permutation and Interval Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Gabor Tardos, Jessica Enright, Lorna Stewart","submitted_at":"2012-06-22T10:42:36Z","abstract_excerpt":"List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded total number of colours. More generally we give a polynomial-time algorithm that solves the list-homomorphism problem to any fixed target graph for a large class of input graphs including all permutation and interval graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5106","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5106","created_at":"2026-05-18T03:52:52.236583+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5106v1","created_at":"2026-05-18T03:52:52.236583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5106","created_at":"2026-05-18T03:52:52.236583+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYUUDXSXU5D4","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYUUDXSXU5D4EGG2","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYUUDXSX","created_at":"2026-05-18T12:27:14.488303+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/LYUUDXSXU5D4EGG2RS2Q7YCN5N","json":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N.json","graph_json":"https://pith.science/api/pith-number/LYUUDXSXU5D4EGG2RS2Q7YCN5N/graph.json","events_json":"https://pith.science/api/pith-number/LYUUDXSXU5D4EGG2RS2Q7YCN5N/events.json","paper":"https://pith.science/paper/LYUUDXSX"},"agent_actions":{"view_html":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N","download_json":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N.json","view_paper":"https://pith.science/paper/LYUUDXSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5106&json=true","fetch_graph":"https://pith.science/api/pith-number/LYUUDXSXU5D4EGG2RS2Q7YCN5N/graph.json","fetch_events":"https://pith.science/api/pith-number/LYUUDXSXU5D4EGG2RS2Q7YCN5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/action/storage_attestation","attest_author":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/action/author_attestation","sign_citation":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/action/citation_signature","submit_replication":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/action/replication_record"}},"created_at":"2026-05-18T03:52:52.236583+00:00","updated_at":"2026-05-18T03:52:52.236583+00:00"}