{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YMFO54DVFHR7RVGQI4XXNR35UA","short_pith_number":"pith:YMFO54DV","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"},"canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","source":{"kind":"arxiv","id":"1605.03542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03542","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03542v1","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03542","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"YMFO54DVFHR7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMFO54DVFHR7RVGQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMFO54DV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YMFO54DVFHR7RVGQI4XXNR35UA","target":"record","payload":{"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"},"canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","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"},"source_kind":"arxiv","source_id":"1605.03542","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-05-18T01:15:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjH75zJ8ZpHFOJXPEwVsJuLZFr7P6Q4bgqG+O0qOIZHf35j/MVWReJct39viWmh+9YslEWR755j/aub/gKwPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:10:02.967253Z"},"content_sha256":"0047606db3d1f6cb57f25891c1aab0c9d718d337dcd5ac30812cf35f78401bf8","schema_version":"1.0","event_id":"sha256:0047606db3d1f6cb57f25891c1aab0c9d718d337dcd5ac30812cf35f78401bf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YMFO54DVFHR7RVGQI4XXNR35UA","target":"graph","payload":{"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"},"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-05-18T01:15:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jI98umiIuOaP1tofa2I4TCKrDwZjxbk2nT41DdWbRGgwnsa/X1mLEp8SCWUKnjaT93OZPzoxAgEOdupSu2yyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:10:02.967983Z"},"content_sha256":"bd6886bad87edd1edade2076b26a42be92a7d632b17ee5f724bc7122b4f408f0","schema_version":"1.0","event_id":"sha256:bd6886bad87edd1edade2076b26a42be92a7d632b17ee5f724bc7122b4f408f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/bundle.json","state_url":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMFO54DVFHR7RVGQI4XXNR35UA/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-06-08T15:10:02Z","links":{"resolver":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA","bundle":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/bundle.json","state":"https://pith.science/pith/YMFO54DVFHR7RVGQI4XXNR35UA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMFO54DVFHR7RVGQI4XXNR35UA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YMFO54DVFHR7RVGQI4XXNR35UA","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":"45b1820719b187931caabb94c913d833ccb557c5d4f8ada55a490ffc8ab183a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-11T18:40:58Z","title_canon_sha256":"f798caa86a601831d63e28f9d57045940cbf6956c771223e2c0429abfd04be58"},"schema_version":"1.0","source":{"id":"1605.03542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.03542","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"1605.03542v1","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03542","created_at":"2026-05-18T01:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"YMFO54DVFHR7","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YMFO54DVFHR7RVGQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YMFO54DV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:bd6886bad87edd1edade2076b26a42be92a7d632b17ee5f724bc7122b4f408f0","target":"graph","created_at":"2026-05-18T01:15:01Z","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"},"paper":{"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$","authors_text":"Amir Jafari, Mohammad Ghodsi, Sharareh Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-11T18:40:58Z","title":"An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03542","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:0047606db3d1f6cb57f25891c1aab0c9d718d337dcd5ac30812cf35f78401bf8","target":"record","created_at":"2026-05-18T01:15:01Z","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":"45b1820719b187931caabb94c913d833ccb557c5d4f8ada55a490ffc8ab183a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-05-11T18:40:58Z","title_canon_sha256":"f798caa86a601831d63e28f9d57045940cbf6956c771223e2c0429abfd04be58"},"schema_version":"1.0","source":{"id":"1605.03542","kind":"arxiv","version":1}},"canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c30aeef07529e3f8d4d0472f76c77da02920a8fd1d28fae32f7639504d18bac7","first_computed_at":"2026-05-18T01:15:01.161285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:01.161285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z22YhrsGOO2kywPZ5QA7ME7sLzm1VU/SyU/AzD488SuKVl0iTrZasoF3yklM1jlQ9ao73mUvsr5jwhS7kcmMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:01.161742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.03542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0047606db3d1f6cb57f25891c1aab0c9d718d337dcd5ac30812cf35f78401bf8","sha256:bd6886bad87edd1edade2076b26a42be92a7d632b17ee5f724bc7122b4f408f0"],"state_sha256":"75eec62393e07dc64b93ee5fc65fa4db85aa16ec2a3a101d8f0a7008e5815be9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbbwboCZM3hgK5UeArOwkz2PkRKOcgGb01XU3WIbxNl2s0baRYboupLT6OnyGNwQ9yY+7myluAxKtZS/hkDMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:10:02.971950Z","bundle_sha256":"10e5db120a4957d339f6ae990e686f220f818bab1299d17bb17d540255e862d6"}}