{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BTYGJ46HRMFZMXL73BO7RGPNVS","short_pith_number":"pith:BTYGJ46H","schema_version":"1.0","canonical_sha256":"0cf064f3c78b0b965d7fd85df899edacb811fa0fdd89bee1426dd48aae828241","source":{"kind":"arxiv","id":"1210.7638","version":10},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.7638","created_at":"2026-05-18T00:11:51.280477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7638v10","created_at":"2026-05-18T00:11:51.280477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7638","created_at":"2026-05-18T00:11:51.280477+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTYGJ46HRMFZ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTYGJ46HRMFZMXL7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTYGJ46H","created_at":"2026-05-18T12:27:01.376967+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/BTYGJ46HRMFZMXL73BO7RGPNVS","json":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS.json","graph_json":"https://pith.science/api/pith-number/BTYGJ46HRMFZMXL73BO7RGPNVS/graph.json","events_json":"https://pith.science/api/pith-number/BTYGJ46HRMFZMXL73BO7RGPNVS/events.json","paper":"https://pith.science/paper/BTYGJ46H"},"agent_actions":{"view_html":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS","download_json":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS.json","view_paper":"https://pith.science/paper/BTYGJ46H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7638&json=true","fetch_graph":"https://pith.science/api/pith-number/BTYGJ46HRMFZMXL73BO7RGPNVS/graph.json","fetch_events":"https://pith.science/api/pith-number/BTYGJ46HRMFZMXL73BO7RGPNVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/action/storage_attestation","attest_author":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/action/author_attestation","sign_citation":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/action/citation_signature","submit_replication":"https://pith.science/pith/BTYGJ46HRMFZMXL73BO7RGPNVS/action/replication_record"}},"created_at":"2026-05-18T00:11:51.280477+00:00","updated_at":"2026-05-18T00:11:51.280477+00:00"}