{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TM5G3YTROJY6DYK5Y4H2AMLOML","short_pith_number":"pith:TM5G3YTR","schema_version":"1.0","canonical_sha256":"9b3a6de2717271e1e15dc70fa0316e62d36a5da1205d6030c6ae064668cdd573","source":{"kind":"arxiv","id":"1004.2393","version":3},"attestation_state":"computed","paper":{"title":"On the Continuous CNN Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Augustine, Nick Gravin","submitted_at":"2010-04-14T13:34:03Z","abstract_excerpt":"In the (discrete) CNN problem, online requests appear as points in $\\mathbb{R}^2$. Each request must be served before the next one is revealed. We have a server that can serve a request simply by aligning either its $x$ or $y$ coordinate with the request. The goal of the online algorithm is to minimize the total $L_1$ distance traveled by the server to serve all the requests. The best known competitive ratio for the discrete version is 879 (due to Sitters and Stougie).\n  We study the continuous version, in which, the request can move continuously in $\\mathbb{R}^2$ and the server must continuou"},"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":"1004.2393","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-14T13:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"d6ae6683a98e08e8f3b1ba9f339d2a93597b666afbfd1d9d1c318f499c92528e","abstract_canon_sha256":"74e20f31d39a0cdfa2b1a5682f1f488aeb1802555a8c7485e9d78ed8aef329b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:17.815799Z","signature_b64":"HujONya7IBLvjz0YAhKnFyTiRZNtlIxPumPSMpkdISGmt0TwR4GZNmAU8IVOfN6UfenOG50shm+lisLz6HbcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b3a6de2717271e1e15dc70fa0316e62d36a5da1205d6030c6ae064668cdd573","last_reissued_at":"2026-05-18T03:53:17.815017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:17.815017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Continuous CNN Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Augustine, Nick Gravin","submitted_at":"2010-04-14T13:34:03Z","abstract_excerpt":"In the (discrete) CNN problem, online requests appear as points in $\\mathbb{R}^2$. Each request must be served before the next one is revealed. We have a server that can serve a request simply by aligning either its $x$ or $y$ coordinate with the request. The goal of the online algorithm is to minimize the total $L_1$ distance traveled by the server to serve all the requests. The best known competitive ratio for the discrete version is 879 (due to Sitters and Stougie).\n  We study the continuous version, in which, the request can move continuously in $\\mathbb{R}^2$ and the server must continuou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2393","kind":"arxiv","version":3},"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":"1004.2393","created_at":"2026-05-18T03:53:17.815146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2393v3","created_at":"2026-05-18T03:53:17.815146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2393","created_at":"2026-05-18T03:53:17.815146+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM5G3YTROJY6","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM5G3YTROJY6DYK5","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM5G3YTR","created_at":"2026-05-18T12:26:13.927090+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/TM5G3YTROJY6DYK5Y4H2AMLOML","json":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML.json","graph_json":"https://pith.science/api/pith-number/TM5G3YTROJY6DYK5Y4H2AMLOML/graph.json","events_json":"https://pith.science/api/pith-number/TM5G3YTROJY6DYK5Y4H2AMLOML/events.json","paper":"https://pith.science/paper/TM5G3YTR"},"agent_actions":{"view_html":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML","download_json":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML.json","view_paper":"https://pith.science/paper/TM5G3YTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2393&json=true","fetch_graph":"https://pith.science/api/pith-number/TM5G3YTROJY6DYK5Y4H2AMLOML/graph.json","fetch_events":"https://pith.science/api/pith-number/TM5G3YTROJY6DYK5Y4H2AMLOML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML/action/storage_attestation","attest_author":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML/action/author_attestation","sign_citation":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML/action/citation_signature","submit_replication":"https://pith.science/pith/TM5G3YTROJY6DYK5Y4H2AMLOML/action/replication_record"}},"created_at":"2026-05-18T03:53:17.815146+00:00","updated_at":"2026-05-18T03:53:17.815146+00:00"}