{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YMFO54DVFHR7RVGQI4XXNR35UA","short_pith_number":"pith:YMFO54DV","schema_version":"1.0","canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","source":{"kind":"arxiv","id":"1605.03542","version":1},"attestation_state":"computed","paper":{"title":"An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Jafari, Mohammad Ghodsi, Sharareh Alipour","submitted_at":"2016-05-11T18:40:58Z","abstract_excerpt":"Given a set $S$ of $n$ disjoint line segments in $\\mathbb{R}^{2}$, the visibility counting problem (VCP) is to preprocess $S$ such that the number of segments in $S$ visible from any query point $p$ can be computed quickly. This problem can trivially be solved in logarithmic query time using $O(n^{4})$ preprocessing time and space. Gudmundsson and Morin proposed a 2-approximation algorithm for this problem with a tradeoff between the space and the query time. They answer any query in $O_{\\epsilon}(n^{1-\\alpha})$ with $O_{\\epsilon}(n^{2+2\\alpha})$ of preprocessing time and space, where $\\alpha$"},"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":"1605.03542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-11T18:40:58Z","cross_cats_sorted":[],"title_canon_sha256":"f798caa86a601831d63e28f9d57045940cbf6956c771223e2c0429abfd04be58","abstract_canon_sha256":"45b1820719b187931caabb94c913d833ccb557c5d4f8ada55a490ffc8ab183a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:01.161742Z","signature_b64":"z22YhrsGOO2kywPZ5QA7ME7sLzm1VU/SyU/AzD488SuKVl0iTrZasoF3yklM1jlQ9ao73mUvsr5jwhS7kcmMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","last_reissued_at":"2026-05-18T01:15:01.161285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:01.161285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amir Jafari, Mohammad Ghodsi, Sharareh Alipour","submitted_at":"2016-05-11T18:40:58Z","abstract_excerpt":"Given a set $S$ of $n$ disjoint line segments in $\\mathbb{R}^{2}$, the visibility counting problem (VCP) is to preprocess $S$ such that the number of segments in $S$ visible from any query point $p$ can be computed quickly. This problem can trivially be solved in logarithmic query time using $O(n^{4})$ preprocessing time and space. Gudmundsson and Morin proposed a 2-approximation algorithm for this problem with a tradeoff between the space and the query time. They answer any query in $O_{\\epsilon}(n^{1-\\alpha})$ with $O_{\\epsilon}(n^{2+2\\alpha})$ of preprocessing time and space, where $\\alpha$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03542","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":"1605.03542","created_at":"2026-05-18T01:15:01.161353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03542v1","created_at":"2026-05-18T01:15:01.161353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03542","created_at":"2026-05-18T01:15:01.161353+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMFO54DVFHR7","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMFO54DVFHR7RVGQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMFO54DV","created_at":"2026-05-18T12:30:53.716459+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/YMFO54DVFHR7RVGQI4XXNR35UA","json":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA.json","graph_json":"https://pith.science/api/pith-number/YMFO54DVFHR7RVGQI4XXNR35UA/graph.json","events_json":"https://pith.science/api/pith-number/YMFO54DVFHR7RVGQI4XXNR35UA/events.json","paper":"https://pith.science/paper/YMFO54DV"},"agent_actions":{"view_html":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA","download_json":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA.json","view_paper":"https://pith.science/paper/YMFO54DV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03542&json=true","fetch_graph":"https://pith.science/api/pith-number/YMFO54DVFHR7RVGQI4XXNR35UA/graph.json","fetch_events":"https://pith.science/api/pith-number/YMFO54DVFHR7RVGQI4XXNR35UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/action/storage_attestation","attest_author":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/action/author_attestation","sign_citation":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/action/citation_signature","submit_replication":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/action/replication_record"}},"created_at":"2026-05-18T01:15:01.161353+00:00","updated_at":"2026-05-18T01:15:01.161353+00:00"}