{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FCGSYXLYARD25PCB4O5O2I43HH","short_pith_number":"pith:FCGSYXLY","schema_version":"1.0","canonical_sha256":"288d2c5d780447aebc41e3baed239b39cd6566dddeb3745823c5b05f9f7bc32b","source":{"kind":"arxiv","id":"1406.1623","version":1},"attestation_state":"computed","paper":{"title":"Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Kudahl","submitted_at":"2014-06-06T09:52:33Z","abstract_excerpt":"The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete."},"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":"1406.1623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-06-06T09:52:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0873475029e8a075bd634428939b42b9336cd3e595047cdc1753dd6ab0f5f4cf","abstract_canon_sha256":"f6edf75a3946795bb9f0486cf5c91c45d3aa39012794da647825884fc2317c60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.028541Z","signature_b64":"knH37UXE1VQPzehbMxE5Oebs1bhptgH4eWi2GmD2hgJkfnS97idY1mWSXnpyZ2hmqdiK3FSFNC1k4w9TZH0GAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288d2c5d780447aebc41e3baed239b39cd6566dddeb3745823c5b05f9f7bc32b","last_reissued_at":"2026-05-18T02:50:22.027984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.027984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding the On-line Chromatic Number of a Graph with Pre-Coloring is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Kudahl","submitted_at":"2014-06-06T09:52:33Z","abstract_excerpt":"The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.1623","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":"1406.1623","created_at":"2026-05-18T02:50:22.028060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.1623v1","created_at":"2026-05-18T02:50:22.028060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.1623","created_at":"2026-05-18T02:50:22.028060+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCGSYXLYARD2","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCGSYXLYARD25PCB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCGSYXLY","created_at":"2026-05-18T12:28:28.263976+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/FCGSYXLYARD25PCB4O5O2I43HH","json":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH.json","graph_json":"https://pith.science/api/pith-number/FCGSYXLYARD25PCB4O5O2I43HH/graph.json","events_json":"https://pith.science/api/pith-number/FCGSYXLYARD25PCB4O5O2I43HH/events.json","paper":"https://pith.science/paper/FCGSYXLY"},"agent_actions":{"view_html":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH","download_json":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH.json","view_paper":"https://pith.science/paper/FCGSYXLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.1623&json=true","fetch_graph":"https://pith.science/api/pith-number/FCGSYXLYARD25PCB4O5O2I43HH/graph.json","fetch_events":"https://pith.science/api/pith-number/FCGSYXLYARD25PCB4O5O2I43HH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH/action/storage_attestation","attest_author":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH/action/author_attestation","sign_citation":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH/action/citation_signature","submit_replication":"https://pith.science/pith/FCGSYXLYARD25PCB4O5O2I43HH/action/replication_record"}},"created_at":"2026-05-18T02:50:22.028060+00:00","updated_at":"2026-05-18T02:50:22.028060+00:00"}