{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EKOD3N45NVGGN3DBNW6LEZLO3A","short_pith_number":"pith:EKOD3N45","schema_version":"1.0","canonical_sha256":"229c3db79d6d4c66ec616dbcb2656ed8273f12b758f16b892a430204637cb930","source":{"kind":"arxiv","id":"1502.00859","version":1},"attestation_state":"computed","paper":{"title":"An on-line competitive algorithm for coloring bipartite graphs without long induced paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Piotr Micek, Veit Wiechert","submitted_at":"2015-02-03T13:32:08Z","abstract_excerpt":"The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced subgraphs. We propose a new on-line competitive coloring algorithm for $P_9$-free bipartite 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":"1502.00859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T13:32:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0a27ef0fb468f45b9648deeaacfa734727167dbafa801c2b9c4b311c49b190b3","abstract_canon_sha256":"fcf6c18cfe627a30a138153cfc7ec6836bc27f428e75231bfa861f24748fc677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:59.435856Z","signature_b64":"UbeRwERG8ZBdKLjDIxdsN3ga5uNrHVc7n2dC76xyfLrC1+ERH+Sh9k1+asiLy+CQM+0aHkpnPA498ko1C7OqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229c3db79d6d4c66ec616dbcb2656ed8273f12b758f16b892a430204637cb930","last_reissued_at":"2026-05-18T02:27:59.435180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:59.435180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An on-line competitive algorithm for coloring bipartite graphs without long induced paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Piotr Micek, Veit Wiechert","submitted_at":"2015-02-03T13:32:08Z","abstract_excerpt":"The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced subgraphs. We propose a new on-line competitive coloring algorithm for $P_9$-free bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00859","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":"1502.00859","created_at":"2026-05-18T02:27:59.435280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00859v1","created_at":"2026-05-18T02:27:59.435280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00859","created_at":"2026-05-18T02:27:59.435280+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKOD3N45NVGG","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKOD3N45NVGGN3DB","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKOD3N45","created_at":"2026-05-18T12:29:19.899920+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/EKOD3N45NVGGN3DBNW6LEZLO3A","json":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A.json","graph_json":"https://pith.science/api/pith-number/EKOD3N45NVGGN3DBNW6LEZLO3A/graph.json","events_json":"https://pith.science/api/pith-number/EKOD3N45NVGGN3DBNW6LEZLO3A/events.json","paper":"https://pith.science/paper/EKOD3N45"},"agent_actions":{"view_html":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A","download_json":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A.json","view_paper":"https://pith.science/paper/EKOD3N45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00859&json=true","fetch_graph":"https://pith.science/api/pith-number/EKOD3N45NVGGN3DBNW6LEZLO3A/graph.json","fetch_events":"https://pith.science/api/pith-number/EKOD3N45NVGGN3DBNW6LEZLO3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A/action/storage_attestation","attest_author":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A/action/author_attestation","sign_citation":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A/action/citation_signature","submit_replication":"https://pith.science/pith/EKOD3N45NVGGN3DBNW6LEZLO3A/action/replication_record"}},"created_at":"2026-05-18T02:27:59.435280+00:00","updated_at":"2026-05-18T02:27:59.435280+00:00"}