{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTYGJ46HRMFZMXL73BO7RGPNVS","short_pith_number":"pith:BTYGJ46H","canonical_record":{"source":{"id":"1210.7638","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-29T12:27:18Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0779844b122e2c1690b03ed69ec8d86076a3ae4a8fcc7dc73202b16c752a95d0","abstract_canon_sha256":"0bdfc1c9cea017d406f49f016c691b5ac97f9970867c923a3650067c1e65f5e9"},"schema_version":"1.0"},"canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","source":{"kind":"arxiv","id":"1210.7638","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7638","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7638v10","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7638","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"BTYGJ46HRMFZ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTYGJ46HRMFZMXL7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTYGJ46H","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTYGJ46HRMFZMXL73BO7RGPNVS","target":"record","payload":{"canonical_record":{"source":{"id":"1210.7638","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-29T12:27:18Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"0779844b122e2c1690b03ed69ec8d86076a3ae4a8fcc7dc73202b16c752a95d0","abstract_canon_sha256":"0bdfc1c9cea017d406f49f016c691b5ac97f9970867c923a3650067c1e65f5e9"},"schema_version":"1.0"},"canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:51.281040Z","signature_b64":"BnP8J+sS4S3qTyj/j0PZqex7TYuujlhyQ07D4U68aYxwgdf960ZBwKRydRoWPVAio8n2iAO1KYmn3OXga8ikCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","last_reissued_at":"2026-05-18T00:11:51.280377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:51.280377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.7638","source_version":10,"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-18T00:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDhOdUoaX+YqOQHczq1oxM98VFXKeEIJ4qAlmVfLrmPT9CwpF+VKUhzRBjFrDttiVfDTrjjJ/DRwhGOPs74kBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:49:15.307658Z"},"content_sha256":"9f2804d392ae1ebaaecdeccda16e013a0102030ece1ae7e6fb9089627ce93421","schema_version":"1.0","event_id":"sha256:9f2804d392ae1ebaaecdeccda16e013a0102030ece1ae7e6fb9089627ce93421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTYGJ46HRMFZMXL73BO7RGPNVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Efficient Region in The Plane with Line segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Jack Wang","submitted_at":"2012-10-29T12:27:18Z","abstract_excerpt":"Let $\\mathscr O$ be a set of $n$ disjoint obstacles in $\\mathbb{R}^2$, $\\mathscr M$ be a moving object. Let $s$ and $l$ denote the starting point and maximum path length of the moving object $\\mathscr M$, respectively. Given a point $p$ in ${R}^2$, we say the point $p$ is achievable for $\\mathscr M$ such that $\\pi(s,p)\\leq l$, where $\\pi(\\cdot)$ denotes the shortest path length in the presence of obstacles. One is to find a region $\\mathscr R$ such that, for any point $p\\in \\mathbb{R}^2$, if it is achievable for $\\mathscr M$, then $p\\in \\mathscr R$; otherwise, $p\\notin \\mathscr R$. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7638","kind":"arxiv","version":10},"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-18T00:11:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOIDMsgQztYnRmgNuKVHF6TiCeRyvhvN2S1nebgA1NTmbVyPKtkOHFObMr/RKDk1CuBeOLT9xlQFi3FXTrQrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:49:15.307998Z"},"content_sha256":"ea2d50a7b34ad9c436fdc3dc4b4342b50f052ef7afe289434e169231cd38722a","schema_version":"1.0","event_id":"sha256:ea2d50a7b34ad9c436fdc3dc4b4342b50f052ef7afe289434e169231cd38722a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/bundle.json","state_url":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/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-25T10:49:15Z","links":{"resolver":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS","bundle":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/bundle.json","state":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTYGJ46HRMFZMXL73BO7RGPNVS","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":"0bdfc1c9cea017d406f49f016c691b5ac97f9970867c923a3650067c1e65f5e9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-29T12:27:18Z","title_canon_sha256":"0779844b122e2c1690b03ed69ec8d86076a3ae4a8fcc7dc73202b16c752a95d0"},"schema_version":"1.0","source":{"id":"1210.7638","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7638","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7638v10","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7638","created_at":"2026-05-18T00:11:51Z"},{"alias_kind":"pith_short_12","alias_value":"BTYGJ46HRMFZ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTYGJ46HRMFZMXL7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTYGJ46H","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:ea2d50a7b34ad9c436fdc3dc4b4342b50f052ef7afe289434e169231cd38722a","target":"graph","created_at":"2026-05-18T00:11:51Z","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":"Let $\\mathscr O$ be a set of $n$ disjoint obstacles in $\\mathbb{R}^2$, $\\mathscr M$ be a moving object. Let $s$ and $l$ denote the starting point and maximum path length of the moving object $\\mathscr M$, respectively. Given a point $p$ in ${R}^2$, we say the point $p$ is achievable for $\\mathscr M$ such that $\\pi(s,p)\\leq l$, where $\\pi(\\cdot)$ denotes the shortest path length in the presence of obstacles. One is to find a region $\\mathscr R$ such that, for any point $p\\in \\mathbb{R}^2$, if it is achievable for $\\mathscr M$, then $p\\in \\mathscr R$; otherwise, $p\\notin \\mathscr R$. In this pap","authors_text":"Jack Wang","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-29T12:27:18Z","title":"Finding Efficient Region in The Plane with Line segments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7638","kind":"arxiv","version":10},"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:9f2804d392ae1ebaaecdeccda16e013a0102030ece1ae7e6fb9089627ce93421","target":"record","created_at":"2026-05-18T00:11:51Z","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":"0bdfc1c9cea017d406f49f016c691b5ac97f9970867c923a3650067c1e65f5e9","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-29T12:27:18Z","title_canon_sha256":"0779844b122e2c1690b03ed69ec8d86076a3ae4a8fcc7dc73202b16c752a95d0"},"schema_version":"1.0","source":{"id":"1210.7638","kind":"arxiv","version":10}},"canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","first_computed_at":"2026-05-18T00:11:51.280377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:51.280377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BnP8J+sS4S3qTyj/j0PZqex7TYuujlhyQ07D4U68aYxwgdf960ZBwKRydRoWPVAio8n2iAO1KYmn3OXga8ikCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:51.281040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7638","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f2804d392ae1ebaaecdeccda16e013a0102030ece1ae7e6fb9089627ce93421","sha256:ea2d50a7b34ad9c436fdc3dc4b4342b50f052ef7afe289434e169231cd38722a"],"state_sha256":"40cc4d430b6649160405a35cacd95c7b9807d7590393aa3b66f3f3ea72591f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u0e38RfxnPF+WpG/Y+b9toAJdWElv+uk3mMr4GdWR4U69tP0xRqOmJz1tADiBVLe7CCDZ4clICHeyrjxwozxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:49:15.309865Z","bundle_sha256":"33ac2f32e318d2743aa924476c1218f82c90ef53c61acbc8bd5ac3d939ac586b"}}