{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BLNFFCNPCHLJYCT7ISZPVPKVH2","short_pith_number":"pith:BLNFFCNP","schema_version":"1.0","canonical_sha256":"0ada5289af11d69c0a7f44b2fabd553e9115635abefac942735fc12037e02d36","source":{"kind":"arxiv","id":"1902.01609","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Algorithm for Online Freeze-tag","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Josh Brunner, Julian Wellman","submitted_at":"2019-02-05T09:39:55Z","abstract_excerpt":"In the freeze-tag problem, one active robot must wake up many frozen robots. The robots are considered as points in a metric space, where active robots move at a constant rate and activate other robots by visiting them. In the (time-dependent) online variant of the problem, frozen robots are not revealed until a specified time. Hammar, Nilsson, and Persson have shown that no online algorithm can achieve a competitive ratio better than $7/3$ for online freeze-tag, and asked whether there is any $O(1)$-competitive algorithm. In this paper, we provide a $(1+\\sqrt{2})$-competitive algorithm for on"},"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":"1902.01609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-05T09:39:55Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"91d5c774bd133c5b393a9227f5225d258c34c8bcfd2306d1c9b355fec0db7247","abstract_canon_sha256":"68a9fb8d53db3c9f500dcc05ffc2397300696227bb30394df51eaacf13448ad8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:47.157888Z","signature_b64":"4ayEHrgaD0c1uRwWSQhya8XG58DHeX6w5jQv4nDhlW/rUki/ul+oIfLEgZziBQzlJsMFAqwgvxh7prqZEjBgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ada5289af11d69c0a7f44b2fabd553e9115635abefac942735fc12037e02d36","last_reissued_at":"2026-05-17T23:54:47.156722Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:47.156722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for Online Freeze-tag","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Josh Brunner, Julian Wellman","submitted_at":"2019-02-05T09:39:55Z","abstract_excerpt":"In the freeze-tag problem, one active robot must wake up many frozen robots. The robots are considered as points in a metric space, where active robots move at a constant rate and activate other robots by visiting them. In the (time-dependent) online variant of the problem, frozen robots are not revealed until a specified time. Hammar, Nilsson, and Persson have shown that no online algorithm can achieve a competitive ratio better than $7/3$ for online freeze-tag, and asked whether there is any $O(1)$-competitive algorithm. In this paper, we provide a $(1+\\sqrt{2})$-competitive algorithm for on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01609","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":"1902.01609","created_at":"2026-05-17T23:54:47.156822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01609v1","created_at":"2026-05-17T23:54:47.156822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01609","created_at":"2026-05-17T23:54:47.156822+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLNFFCNPCHLJ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLNFFCNPCHLJYCT7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLNFFCNP","created_at":"2026-05-18T12:33:12.712433+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/BLNFFCNPCHLJYCT7ISZPVPKVH2","json":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2.json","graph_json":"https://pith.science/api/pith-number/BLNFFCNPCHLJYCT7ISZPVPKVH2/graph.json","events_json":"https://pith.science/api/pith-number/BLNFFCNPCHLJYCT7ISZPVPKVH2/events.json","paper":"https://pith.science/paper/BLNFFCNP"},"agent_actions":{"view_html":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2","download_json":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2.json","view_paper":"https://pith.science/paper/BLNFFCNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01609&json=true","fetch_graph":"https://pith.science/api/pith-number/BLNFFCNPCHLJYCT7ISZPVPKVH2/graph.json","fetch_events":"https://pith.science/api/pith-number/BLNFFCNPCHLJYCT7ISZPVPKVH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2/action/storage_attestation","attest_author":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2/action/author_attestation","sign_citation":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2/action/citation_signature","submit_replication":"https://pith.science/pith/BLNFFCNPCHLJYCT7ISZPVPKVH2/action/replication_record"}},"created_at":"2026-05-17T23:54:47.156822+00:00","updated_at":"2026-05-17T23:54:47.156822+00:00"}