{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LYUUDXSXU5D4EGG2RS2Q7YCN5N","short_pith_number":"pith:LYUUDXSX","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"},"canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","source":{"kind":"arxiv","id":"1206.5106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5106","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5106v1","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5106","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"LYUUDXSXU5D4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LYUUDXSXU5D4EGG2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LYUUDXSX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LYUUDXSXU5D4EGG2RS2Q7YCN5N","target":"record","payload":{"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"},"canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","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"},"source_kind":"arxiv","source_id":"1206.5106","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EIHhntqlnr3JwUjMjLgIfaQRw4H3aYNJNE4ERhOELT6QUJhBK9QNfKNi/PGP8Td7vcCkuKFSmo+3hw8NJYUyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:46:33.614386Z"},"content_sha256":"34afd9cdb383968a728b239d1c250fc8fb7988b5a6fb851e6fd9e80e1e73c69a","schema_version":"1.0","event_id":"sha256:34afd9cdb383968a728b239d1c250fc8fb7988b5a6fb851e6fd9e80e1e73c69a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LYUUDXSXU5D4EGG2RS2Q7YCN5N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:52:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHWwKkBRgIFtp0hpTDIlTOXUiLK/na8VTsmZRMc9S3Mw9KfUstYJ5+5kufHNvMn/MnBm2a6+71eZLawmrlz3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:46:33.614736Z"},"content_sha256":"384bf343319f268aed13be4cba4216acbadc26955187f9f07411c3da508e2c98","schema_version":"1.0","event_id":"sha256:384bf343319f268aed13be4cba4216acbadc26955187f9f07411c3da508e2c98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/bundle.json","state_url":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T13:46:33Z","links":{"resolver":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N","bundle":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/bundle.json","state":"https://pith.science/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYUUDXSXU5D4EGG2RS2Q7YCN5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LYUUDXSXU5D4EGG2RS2Q7YCN5N","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":"02030f288ab94bde0f721b9d2d0a2b1f42bf18c045f39ac3f3799cd36d6e3d53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-22T10:42:36Z","title_canon_sha256":"2788064d6824ee23a31a805856ac59a9405090078be1575540cb91d246e9182f"},"schema_version":"1.0","source":{"id":"1206.5106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5106","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5106v1","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5106","created_at":"2026-05-18T03:52:52Z"},{"alias_kind":"pith_short_12","alias_value":"LYUUDXSXU5D4","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LYUUDXSXU5D4EGG2","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LYUUDXSX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:384bf343319f268aed13be4cba4216acbadc26955187f9f07411c3da508e2c98","target":"graph","created_at":"2026-05-18T03:52:52Z","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":"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.","authors_text":"Gabor Tardos, Jessica Enright, Lorna Stewart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-22T10:42:36Z","title":"On List Colouring and List Homomorphism of Permutation and Interval Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5106","kind":"arxiv","version":1},"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:34afd9cdb383968a728b239d1c250fc8fb7988b5a6fb851e6fd9e80e1e73c69a","target":"record","created_at":"2026-05-18T03:52:52Z","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":"02030f288ab94bde0f721b9d2d0a2b1f42bf18c045f39ac3f3799cd36d6e3d53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-06-22T10:42:36Z","title_canon_sha256":"2788064d6824ee23a31a805856ac59a9405090078be1575540cb91d246e9182f"},"schema_version":"1.0","source":{"id":"1206.5106","kind":"arxiv","version":1}},"canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e2941de57a747c218da8cb50fe04deb7a27b77aff9a08549a71b08fc9c8c575","first_computed_at":"2026-05-18T03:52:52.236462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:52.236462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rb3TMtiN0IIAIIOMjjddYHaMcyetns6wFnvGoIz7aVRvvdHT5LgeoHrAsLSIwMhpGO3e8Y9v/6tDebzHWyx9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:52.237292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34afd9cdb383968a728b239d1c250fc8fb7988b5a6fb851e6fd9e80e1e73c69a","sha256:384bf343319f268aed13be4cba4216acbadc26955187f9f07411c3da508e2c98"],"state_sha256":"793df365e1465781ccc2e1bc9fcc08c6bed21e8c9056cd0bed2ada46bb507637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKSrtKKWXAcUrwSwgTQdMnBV5iQPSLHZecdL+cEME7cjdJ023I9vYb8th9GhkaznQw6+jqDGsKP4vydmbC60CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T13:46:33.616700Z","bundle_sha256":"50b74b1485ecb505889156c3cfafae8ef9f6ce54f5ec6d841bb38e53799bd077"}}