{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MOV7NBZG3TMLHEAMIAU2SOAKA7","short_pith_number":"pith:MOV7NBZG","canonical_record":{"source":{"id":"1305.5209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-22T17:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"ee12b54ed1800056e92898702c1f42269969143c16fee22430975f2b864fade8","abstract_canon_sha256":"a931261f77e4e3d57b7c001fd3dcba38c1722c7de486d86dcd10cbaa68b7bca0"},"schema_version":"1.0"},"canonical_sha256":"63abf68726dcd8b3900c4029a9380a07c38a674916051e35ce65b50602eab2eb","source":{"kind":"arxiv","id":"1305.5209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5209","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5209v1","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5209","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"MOV7NBZG3TML","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOV7NBZG3TMLHEAM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOV7NBZG","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MOV7NBZG3TMLHEAMIAU2SOAKA7","target":"record","payload":{"canonical_record":{"source":{"id":"1305.5209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-22T17:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"ee12b54ed1800056e92898702c1f42269969143c16fee22430975f2b864fade8","abstract_canon_sha256":"a931261f77e4e3d57b7c001fd3dcba38c1722c7de486d86dcd10cbaa68b7bca0"},"schema_version":"1.0"},"canonical_sha256":"63abf68726dcd8b3900c4029a9380a07c38a674916051e35ce65b50602eab2eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:06.534254Z","signature_b64":"TzzFMB3yoz4w9ioxo9qv1YukZEkOh+wac1RXU73uHTA9MyxTJP+RuOz8KBPSlE1tqHRmLXN53+nVxBincfifCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63abf68726dcd8b3900c4029a9380a07c38a674916051e35ce65b50602eab2eb","last_reissued_at":"2026-05-18T03:25:06.533742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:06.533742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.5209","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-18T03:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XpBcVq3jsbK+j2O2pb2m6zbapJOOZskIqV1/drcrOpiCPh+bCofrK9YO5s/vhc/i2e7Ej2MFGuMhz3C/Cu3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:13.594385Z"},"content_sha256":"67e7d8fa0672bdb8ebf7558c6456d3ba49f3dcaed285d7091e763a08a9ebb54d","schema_version":"1.0","event_id":"sha256:67e7d8fa0672bdb8ebf7558c6456d3ba49f3dcaed285d7091e763a08a9ebb54d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MOV7NBZG3TMLHEAMIAU2SOAKA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Unsolvability of the Weighted Region Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Megan Owen, Michiel Smid","submitted_at":"2013-05-22T17:53:29Z","abstract_excerpt":"Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortest path in S between two points s, t in R^2, where the distances are measured according to the weighted Euclidean metric-the length of a path is defined to be the weighted sum of (Euclidean) lengths of the sub-paths within each region. We show that this problem cannot be solved in the Algebraic Computation Model over the Rational Numbers (ACMQ). In the ACMQ, one can compute exactly any number that can be obtained from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5209","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-18T03:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/VXFHOSoFcQHU35szG6pafzTmLWXw1SHgVSa9WubibUh575pbO04Yfv26b/i/wmU2ywBz/MKdfyyn7gj2BWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:13.595035Z"},"content_sha256":"c5a71d7dff5c962c90ad6eaaf1d3399069dde824b005472903cbc92b5fbd81e7","schema_version":"1.0","event_id":"sha256:c5a71d7dff5c962c90ad6eaaf1d3399069dde824b005472903cbc92b5fbd81e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/bundle.json","state_url":"https://pith.science/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/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-05-28T21:09:13Z","links":{"resolver":"https://pith.science/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7","bundle":"https://pith.science/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/bundle.json","state":"https://pith.science/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOV7NBZG3TMLHEAMIAU2SOAKA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MOV7NBZG3TMLHEAMIAU2SOAKA7","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":"a931261f77e4e3d57b7c001fd3dcba38c1722c7de486d86dcd10cbaa68b7bca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-22T17:53:29Z","title_canon_sha256":"ee12b54ed1800056e92898702c1f42269969143c16fee22430975f2b864fade8"},"schema_version":"1.0","source":{"id":"1305.5209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.5209","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1305.5209v1","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5209","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"MOV7NBZG3TML","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MOV7NBZG3TMLHEAM","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MOV7NBZG","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:c5a71d7dff5c962c90ad6eaaf1d3399069dde824b005472903cbc92b5fbd81e7","target":"graph","created_at":"2026-05-18T03:25:06Z","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 S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortest path in S between two points s, t in R^2, where the distances are measured according to the weighted Euclidean metric-the length of a path is defined to be the weighted sum of (Euclidean) lengths of the sub-paths within each region. We show that this problem cannot be solved in the Algebraic Computation Model over the Rational Numbers (ACMQ). In the ACMQ, one can compute exactly any number that can be obtained from","authors_text":"Anil Maheshwari, Carsten Grimm, Jean-Lou De Carufel, Megan Owen, Michiel Smid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-22T17:53:29Z","title":"A Note on the Unsolvability of the Weighted Region Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5209","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:67e7d8fa0672bdb8ebf7558c6456d3ba49f3dcaed285d7091e763a08a9ebb54d","target":"record","created_at":"2026-05-18T03:25:06Z","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":"a931261f77e4e3d57b7c001fd3dcba38c1722c7de486d86dcd10cbaa68b7bca0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-22T17:53:29Z","title_canon_sha256":"ee12b54ed1800056e92898702c1f42269969143c16fee22430975f2b864fade8"},"schema_version":"1.0","source":{"id":"1305.5209","kind":"arxiv","version":1}},"canonical_sha256":"63abf68726dcd8b3900c4029a9380a07c38a674916051e35ce65b50602eab2eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63abf68726dcd8b3900c4029a9380a07c38a674916051e35ce65b50602eab2eb","first_computed_at":"2026-05-18T03:25:06.533742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:06.533742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TzzFMB3yoz4w9ioxo9qv1YukZEkOh+wac1RXU73uHTA9MyxTJP+RuOz8KBPSlE1tqHRmLXN53+nVxBincfifCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:06.534254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.5209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e7d8fa0672bdb8ebf7558c6456d3ba49f3dcaed285d7091e763a08a9ebb54d","sha256:c5a71d7dff5c962c90ad6eaaf1d3399069dde824b005472903cbc92b5fbd81e7"],"state_sha256":"71a4f4293246bda6b865db5243d331a43da2942dcb8a9bda1520cb2819aa8284"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlo+5RPrGdkFcI8tP4zJYtLTqVqzbDLnvJju+hSyRcTflkYaZLI88UgNzeNGuHRfqbBUgouLFu+EzUku6ZWFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:09:13.597642Z","bundle_sha256":"d2649a20c6ce84562ec27dfefa2e6081a81f798e2687e67fa421060aced23f77"}}