{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NEF73HXVFQ5MDREEDWRRQMBODN","short_pith_number":"pith:NEF73HXV","schema_version":"1.0","canonical_sha256":"690bfd9ef52c3ac1c4841da318302e1b69e88e081f3583ee21a12ec7656db801","source":{"kind":"arxiv","id":"1111.2918","version":2},"attestation_state":"computed","paper":{"title":"Localized Geometric Query Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, John Augustine, Sandip Das, Sasanka Roy, Subhas C. Nandy, Swami Sarvattomananda","submitted_at":"2011-11-12T11:28:47Z","abstract_excerpt":"A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not contain any member of $P$, can be reported efficiently. The geometric sets that we consider are point sets and boundaries of simple polygons."},"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":"1111.2918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-11-12T11:28:47Z","cross_cats_sorted":[],"title_canon_sha256":"9cf441f7ace4cf62520ae50c0308a26337f7b91af3bdbbce9536a6fb8cb7a394","abstract_canon_sha256":"1f8da32e1c55276198f5337f6c7c6c51bc64e80cf1f6b6bc3dda9ee5bfb68cc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:34.739969Z","signature_b64":"RLpPCKZWU4EcvwmLHRmlCa7g4qS0Jy8U+qs7UgfQEV4xiBxIgG8ZzNqLE3+yfqUKWnAR4NzLlZrU9zPSgHr6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690bfd9ef52c3ac1c4841da318302e1b69e88e081f3583ee21a12ec7656db801","last_reissued_at":"2026-05-18T02:21:34.739506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:34.739506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Localized Geometric Query Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, John Augustine, Sandip Das, Sasanka Roy, Subhas C. Nandy, Swami Sarvattomananda","submitted_at":"2011-11-12T11:28:47Z","abstract_excerpt":"A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects $P$ in the plane, so that for any arbitrary query point $q$, the largest circle that contains $q$ but does not contain any member of $P$, can be reported efficiently. The geometric sets that we consider are point sets and boundaries of simple polygons."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.2918","kind":"arxiv","version":2},"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":"1111.2918","created_at":"2026-05-18T02:21:34.739573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.2918v2","created_at":"2026-05-18T02:21:34.739573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.2918","created_at":"2026-05-18T02:21:34.739573+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEF73HXVFQ5M","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEF73HXVFQ5MDREE","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEF73HXV","created_at":"2026-05-18T12:26:37.096874+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/NEF73HXVFQ5MDREEDWRRQMBODN","json":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN.json","graph_json":"https://pith.science/api/pith-number/NEF73HXVFQ5MDREEDWRRQMBODN/graph.json","events_json":"https://pith.science/api/pith-number/NEF73HXVFQ5MDREEDWRRQMBODN/events.json","paper":"https://pith.science/paper/NEF73HXV"},"agent_actions":{"view_html":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN","download_json":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN.json","view_paper":"https://pith.science/paper/NEF73HXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.2918&json=true","fetch_graph":"https://pith.science/api/pith-number/NEF73HXVFQ5MDREEDWRRQMBODN/graph.json","fetch_events":"https://pith.science/api/pith-number/NEF73HXVFQ5MDREEDWRRQMBODN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN/action/storage_attestation","attest_author":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN/action/author_attestation","sign_citation":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN/action/citation_signature","submit_replication":"https://pith.science/pith/NEF73HXVFQ5MDREEDWRRQMBODN/action/replication_record"}},"created_at":"2026-05-18T02:21:34.739573+00:00","updated_at":"2026-05-18T02:21:34.739573+00:00"}