{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IHLMPCADOUPAXCRFG2SDBPAMEL","short_pith_number":"pith:IHLMPCAD","schema_version":"1.0","canonical_sha256":"41d6c78803751e0b8a2536a430bc0c22d45a7f6014a30d54c2c97deb0abdafbe","source":{"kind":"arxiv","id":"1905.05066","version":1},"attestation_state":"computed","paper":{"title":"Color spanning Localized query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Ankush Acharyya, Subhas C. Nandy","submitted_at":"2019-05-13T14:47:45Z","abstract_excerpt":"Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q, we can quickly identify the smallest color spanning object of the desired type containing q. In this paper, we focus on (i) intervals, (ii) axis-parallel square, (iii) axis-parallel rectangle, (iv) equilateral triangle of fixed orientation and (v) circle, as our desired type of objects."},"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":"1905.05066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-13T14:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"d1e5db43b814702f27a1e6007bc76e14c4c5db176fda343d5fe3919083f9eb17","abstract_canon_sha256":"9e933620f6116cc4c82b4bbf29d39fd1bb50cb74a41c9a8a514ceb7b13145e77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:22.632978Z","signature_b64":"djVpdPtxcHw90cMxbjhcbdQ8pNW3DdJq/JBJYBOegL5cVP2jb1NKJo01osLCib8cbFuSF1IycBmDEZQHQLZ5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d6c78803751e0b8a2536a430bc0c22d45a7f6014a30d54c2c97deb0abdafbe","last_reissued_at":"2026-05-17T23:46:22.632344Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:22.632344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Color spanning Localized query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Ankush Acharyya, Subhas C. Nandy","submitted_at":"2019-05-13T14:47:45Z","abstract_excerpt":"Let P be a set of n points and each of the points is colored with one of the k possible colors. We present efficient algorithms to pre-process P such that for a given query point q, we can quickly identify the smallest color spanning object of the desired type containing q. In this paper, we focus on (i) intervals, (ii) axis-parallel square, (iii) axis-parallel rectangle, (iv) equilateral triangle of fixed orientation and (v) circle, as our desired type of objects."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05066","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":"1905.05066","created_at":"2026-05-17T23:46:22.632441+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05066v1","created_at":"2026-05-17T23:46:22.632441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05066","created_at":"2026-05-17T23:46:22.632441+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHLMPCADOUPA","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHLMPCADOUPAXCRF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHLMPCAD","created_at":"2026-05-18T12:33:18.533446+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/IHLMPCADOUPAXCRFG2SDBPAMEL","json":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL.json","graph_json":"https://pith.science/api/pith-number/IHLMPCADOUPAXCRFG2SDBPAMEL/graph.json","events_json":"https://pith.science/api/pith-number/IHLMPCADOUPAXCRFG2SDBPAMEL/events.json","paper":"https://pith.science/paper/IHLMPCAD"},"agent_actions":{"view_html":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL","download_json":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL.json","view_paper":"https://pith.science/paper/IHLMPCAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05066&json=true","fetch_graph":"https://pith.science/api/pith-number/IHLMPCADOUPAXCRFG2SDBPAMEL/graph.json","fetch_events":"https://pith.science/api/pith-number/IHLMPCADOUPAXCRFG2SDBPAMEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL/action/storage_attestation","attest_author":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL/action/author_attestation","sign_citation":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL/action/citation_signature","submit_replication":"https://pith.science/pith/IHLMPCADOUPAXCRFG2SDBPAMEL/action/replication_record"}},"created_at":"2026-05-17T23:46:22.632441+00:00","updated_at":"2026-05-17T23:46:22.632441+00:00"}