{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LCLV62PPG3HPJB7DXD62MSPIPR","short_pith_number":"pith:LCLV62PP","schema_version":"1.0","canonical_sha256":"58975f69ef36cef487e3b8fda649e87c4ea8a67dd6bac32fd4977cca1640e49b","source":{"kind":"arxiv","id":"2209.08427","version":1},"attestation_state":"computed","paper":{"title":"A Nearly Tight Lower Bound for the $d$-Dimensional Cow-Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kuszmaul, Nikhil Bansal, William Kuszmaul","submitted_at":"2022-09-17T23:37:21Z","abstract_excerpt":"In the $d$-dimensional cow-path problem, a cow living in $\\mathbb{R}^d$ must locate a $(d - 1)$-dimensional hyperplane $H$ whose location is unknown. The only way that the cow can find $H$ is to roam $\\mathbb{R}^d$ until it intersects $\\mathcal{H}$. If the cow travels a total distance $s$ to locate a hyperplane $H$ whose distance from the origin was $r \\ge 1$, then the cow is said to achieve competitive ratio $s / r$.\n  It is a classic result that, in $\\mathbb{R}^2$, the optimal (deterministic) competitive ratio is $9$. In $\\mathbb{R}^3$, the optimal competitive ratio is known to be at most $\\"},"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":"2209.08427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-09-17T23:37:21Z","cross_cats_sorted":[],"title_canon_sha256":"0baf8603130e15d4169412c4c265e04572d607df2795f3544c0f1a4bb39b9d98","abstract_canon_sha256":"925cab24431a095fb7c0df38a9b9fed1261d34d0df01a68cf62f64b06968d16e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:41.144799Z","signature_b64":"Thae4fi+SavxRvO/CjjqZ2ZLUQceg4we8gytFIiwkhHBTzU2f4/1eWfQuQgqqC7jmz2o2V5bKxKy70Kpqc0gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58975f69ef36cef487e3b8fda649e87c4ea8a67dd6bac32fd4977cca1640e49b","last_reissued_at":"2026-07-05T04:58:41.144439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:41.144439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nearly Tight Lower Bound for the $d$-Dimensional Cow-Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kuszmaul, Nikhil Bansal, William Kuszmaul","submitted_at":"2022-09-17T23:37:21Z","abstract_excerpt":"In the $d$-dimensional cow-path problem, a cow living in $\\mathbb{R}^d$ must locate a $(d - 1)$-dimensional hyperplane $H$ whose location is unknown. The only way that the cow can find $H$ is to roam $\\mathbb{R}^d$ until it intersects $\\mathcal{H}$. If the cow travels a total distance $s$ to locate a hyperplane $H$ whose distance from the origin was $r \\ge 1$, then the cow is said to achieve competitive ratio $s / r$.\n  It is a classic result that, in $\\mathbb{R}^2$, the optimal (deterministic) competitive ratio is $9$. In $\\mathbb{R}^3$, the optimal competitive ratio is known to be at most $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.08427/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2209.08427","created_at":"2026-07-05T04:58:41.144495+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.08427v1","created_at":"2026-07-05T04:58:41.144495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08427","created_at":"2026-07-05T04:58:41.144495+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCLV62PPG3HP","created_at":"2026-07-05T04:58:41.144495+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCLV62PPG3HPJB7D","created_at":"2026-07-05T04:58:41.144495+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCLV62PP","created_at":"2026-07-05T04:58:41.144495+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/LCLV62PPG3HPJB7DXD62MSPIPR","json":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR.json","graph_json":"https://pith.science/api/pith-number/LCLV62PPG3HPJB7DXD62MSPIPR/graph.json","events_json":"https://pith.science/api/pith-number/LCLV62PPG3HPJB7DXD62MSPIPR/events.json","paper":"https://pith.science/paper/LCLV62PP"},"agent_actions":{"view_html":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR","download_json":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR.json","view_paper":"https://pith.science/paper/LCLV62PP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.08427&json=true","fetch_graph":"https://pith.science/api/pith-number/LCLV62PPG3HPJB7DXD62MSPIPR/graph.json","fetch_events":"https://pith.science/api/pith-number/LCLV62PPG3HPJB7DXD62MSPIPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR/action/storage_attestation","attest_author":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR/action/author_attestation","sign_citation":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR/action/citation_signature","submit_replication":"https://pith.science/pith/LCLV62PPG3HPJB7DXD62MSPIPR/action/replication_record"}},"created_at":"2026-07-05T04:58:41.144495+00:00","updated_at":"2026-07-05T04:58:41.144495+00:00"}