{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TNIVDQRR23Z4RHQZAG3SNA4X5B","short_pith_number":"pith:TNIVDQRR","schema_version":"1.0","canonical_sha256":"9b5151c231d6f3c89e1901b7268397e8401cfbd8d2bbbef3027dee43fc4091e5","source":{"kind":"arxiv","id":"1402.2437","version":4},"attestation_state":"computed","paper":{"title":"On-line approach to off-line coloring problems on graphs with geometric representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bartosz Walczak, Tomasz Krawczyk","submitted_at":"2014-02-11T10:50:08Z","abstract_excerpt":"The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that on-line graph coloring problems give rise to classes of game graphs with a natural geometric interpretation. We use this concept to estimate the chromatic number of graphs with geometric representations by finding, for appropriate simpler g"},"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":"1402.2437","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-11T10:50:08Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"title_canon_sha256":"10449918085e8fa152451aaec69e279640a932352719d4426d9e196caad21bf8","abstract_canon_sha256":"3a9bb7a000b454caded28121e395e468fe3a7ce48e6745288e1116dacc89bcb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:51.582109Z","signature_b64":"cwjGOzAlmMietnnZfmqEHfClPwcLh6jAf2V43pdlT7XIZ2RJU1tlm7LKEApSHScNV0drXHpyGqHmo35Qhp/SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b5151c231d6f3c89e1901b7268397e8401cfbd8d2bbbef3027dee43fc4091e5","last_reissued_at":"2026-05-18T00:53:51.581524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:51.581524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On-line approach to off-line coloring problems on graphs with geometric representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Bartosz Walczak, Tomasz Krawczyk","submitted_at":"2014-02-11T10:50:08Z","abstract_excerpt":"The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs with geometric representations and competitive analysis of on-line algorithms, which became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that on-line graph coloring problems give rise to classes of game graphs with a natural geometric interpretation. We use this concept to estimate the chromatic number of graphs with geometric representations by finding, for appropriate simpler g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2437","kind":"arxiv","version":4},"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":"1402.2437","created_at":"2026-05-18T00:53:51.581599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2437v4","created_at":"2026-05-18T00:53:51.581599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2437","created_at":"2026-05-18T00:53:51.581599+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNIVDQRR23Z4","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNIVDQRR23Z4RHQZ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNIVDQRR","created_at":"2026-05-18T12:28:49.207871+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/TNIVDQRR23Z4RHQZAG3SNA4X5B","json":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B.json","graph_json":"https://pith.science/api/pith-number/TNIVDQRR23Z4RHQZAG3SNA4X5B/graph.json","events_json":"https://pith.science/api/pith-number/TNIVDQRR23Z4RHQZAG3SNA4X5B/events.json","paper":"https://pith.science/paper/TNIVDQRR"},"agent_actions":{"view_html":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B","download_json":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B.json","view_paper":"https://pith.science/paper/TNIVDQRR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2437&json=true","fetch_graph":"https://pith.science/api/pith-number/TNIVDQRR23Z4RHQZAG3SNA4X5B/graph.json","fetch_events":"https://pith.science/api/pith-number/TNIVDQRR23Z4RHQZAG3SNA4X5B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B/action/storage_attestation","attest_author":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B/action/author_attestation","sign_citation":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B/action/citation_signature","submit_replication":"https://pith.science/pith/TNIVDQRR23Z4RHQZAG3SNA4X5B/action/replication_record"}},"created_at":"2026-05-18T00:53:51.581599+00:00","updated_at":"2026-05-18T00:53:51.581599+00:00"}