{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2TTV2G4ZQKAFQU5NFIRYOKBZYO","short_pith_number":"pith:2TTV2G4Z","canonical_record":{"source":{"id":"2112.01860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-12-03T11:41:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"621f35bc1cb5fa14d5df80052781f316a587fa1c2d9c0f2226dd0f6aaf05504a","abstract_canon_sha256":"2fcff3a9b81ed0acf9cf2f768a66b423e6f1f4bacdfd717b8d1216e2bb7e2157"},"schema_version":"1.0"},"canonical_sha256":"d4e75d1b9982805853ad2a23872839c39db55d213f5cf7345b36d3b9a3e592cc","source":{"kind":"arxiv","id":"2112.01860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01860","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01860v1","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01860","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"2TTV2G4ZQKAF","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"2TTV2G4ZQKAFQU5N","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"2TTV2G4Z","created_at":"2026-07-05T06:43:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2TTV2G4ZQKAFQU5NFIRYOKBZYO","target":"record","payload":{"canonical_record":{"source":{"id":"2112.01860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-12-03T11:41:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"621f35bc1cb5fa14d5df80052781f316a587fa1c2d9c0f2226dd0f6aaf05504a","abstract_canon_sha256":"2fcff3a9b81ed0acf9cf2f768a66b423e6f1f4bacdfd717b8d1216e2bb7e2157"},"schema_version":"1.0"},"canonical_sha256":"d4e75d1b9982805853ad2a23872839c39db55d213f5cf7345b36d3b9a3e592cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:43.519594Z","signature_b64":"Mur++OyB6KWoE4dH2weX6/toFEAlMKJv8F//ZgA3fycUAXnhuTZh/1cDxwSWZGZZu/ExFUWLBKdiVObc7IC4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e75d1b9982805853ad2a23872839c39db55d213f5cf7345b36d3b9a3e592cc","last_reissued_at":"2026-07-05T06:43:43.519128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:43.519128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.01860","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdMlsRrHXx18DDuAzMTTytP409hA7kWIGwfiiMUkSi/pTrQYo9ok3UWz0fqeSjcpK1vJdefJZrP72P+4A8lmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:39:58.197725Z"},"content_sha256":"6e08d255c217fed456f2ab60b3bd4a65af77a87d33eae97cc49485179acc287b","schema_version":"1.0","event_id":"sha256:6e08d255c217fed456f2ab60b3bd4a65af77a87d33eae97cc49485179acc287b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2TTV2G4ZQKAFQU5NFIRYOKBZYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point Enclosure Problem for Homothetic Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Sanjeev Saxena, Waseem Akram","submitted_at":"2021-12-03T11:41:34Z","abstract_excerpt":"In this paper, we investigate the homothetic point enclosure problem: given a set $S$ of $n$ triangles with sides parallel to three fixed directions, find a data structure for $S$ that can report all the triangles of $S$ that contain a query point efficiently. The problem is \"inverse\" of the homothetic range search problem. We present an $O(n\\log n)$ space solution that supports the queries in $O(\\log n + k)$ time, where $k$ is the output size. The preprocessing time is $O(n\\log n)$. The same results also hold for homothetic polygons."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01860","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/2112.01860/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lTA8cZU+VJSsy0U0L/9tvdop7jR1YGKWJCZPFsWAJQI/3jSlkVzHA4W1T1bXfSkjlmj0OLOLScuLS8buNw8EBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:39:58.198096Z"},"content_sha256":"07cf2cb0474db62bacca6bb8ac0eb2bebdb3ca1c24c7172827efbe5c4789ce92","schema_version":"1.0","event_id":"sha256:07cf2cb0474db62bacca6bb8ac0eb2bebdb3ca1c24c7172827efbe5c4789ce92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/bundle.json","state_url":"https://pith.science/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T11:39:58Z","links":{"resolver":"https://pith.science/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO","bundle":"https://pith.science/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/bundle.json","state":"https://pith.science/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TTV2G4ZQKAFQU5NFIRYOKBZYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2TTV2G4ZQKAFQU5NFIRYOKBZYO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2fcff3a9b81ed0acf9cf2f768a66b423e6f1f4bacdfd717b8d1216e2bb7e2157","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-12-03T11:41:34Z","title_canon_sha256":"621f35bc1cb5fa14d5df80052781f316a587fa1c2d9c0f2226dd0f6aaf05504a"},"schema_version":"1.0","source":{"id":"2112.01860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01860","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01860v1","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01860","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"2TTV2G4ZQKAF","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_16","alias_value":"2TTV2G4ZQKAFQU5N","created_at":"2026-07-05T06:43:43Z"},{"alias_kind":"pith_short_8","alias_value":"2TTV2G4Z","created_at":"2026-07-05T06:43:43Z"}],"graph_snapshots":[{"event_id":"sha256:07cf2cb0474db62bacca6bb8ac0eb2bebdb3ca1c24c7172827efbe5c4789ce92","target":"graph","created_at":"2026-07-05T06:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.01860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate the homothetic point enclosure problem: given a set $S$ of $n$ triangles with sides parallel to three fixed directions, find a data structure for $S$ that can report all the triangles of $S$ that contain a query point efficiently. The problem is \"inverse\" of the homothetic range search problem. We present an $O(n\\log n)$ space solution that supports the queries in $O(\\log n + k)$ time, where $k$ is the output size. The preprocessing time is $O(n\\log n)$. The same results also hold for homothetic polygons.","authors_text":"Sanjeev Saxena, Waseem Akram","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-12-03T11:41:34Z","title":"Point Enclosure Problem for Homothetic Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01860","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6e08d255c217fed456f2ab60b3bd4a65af77a87d33eae97cc49485179acc287b","target":"record","created_at":"2026-07-05T06:43:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2fcff3a9b81ed0acf9cf2f768a66b423e6f1f4bacdfd717b8d1216e2bb7e2157","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-12-03T11:41:34Z","title_canon_sha256":"621f35bc1cb5fa14d5df80052781f316a587fa1c2d9c0f2226dd0f6aaf05504a"},"schema_version":"1.0","source":{"id":"2112.01860","kind":"arxiv","version":1}},"canonical_sha256":"d4e75d1b9982805853ad2a23872839c39db55d213f5cf7345b36d3b9a3e592cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4e75d1b9982805853ad2a23872839c39db55d213f5cf7345b36d3b9a3e592cc","first_computed_at":"2026-07-05T06:43:43.519128Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:43:43.519128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mur++OyB6KWoE4dH2weX6/toFEAlMKJv8F//ZgA3fycUAXnhuTZh/1cDxwSWZGZZu/ExFUWLBKdiVObc7IC4CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:43:43.519594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.01860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e08d255c217fed456f2ab60b3bd4a65af77a87d33eae97cc49485179acc287b","sha256:07cf2cb0474db62bacca6bb8ac0eb2bebdb3ca1c24c7172827efbe5c4789ce92"],"state_sha256":"2ce64c34af6e3f0a5e539783a36332a5b98e1837134c503bab03daeaf9b74a87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pwjLS/vdOaP49CGjPJRsieQkebFlMGAKflCVryjrCV885kS7ylm3LC6vdW6Y8BSbM4xSVQK5hhmpADA4wTnJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:39:58.200228Z","bundle_sha256":"eed9171ab9686a0eed8af5b60d1d83401f23828d004539053a78ad2bc38bdd59"}}