{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YY72YPFLOWTNJTJYBXX5LNDUE2","short_pith_number":"pith:YY72YPFL","canonical_record":{"source":{"id":"1904.03050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-05T13:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"b8bc158f5d4ae5aa471bf8089d31a342b88e1603eeb999d053a14e8ab5dde391","abstract_canon_sha256":"60f8522535086197bedc0c019cf8b103b38bc88e1d150ff50a5ad152dd5419ee"},"schema_version":"1.0"},"canonical_sha256":"c63fac3cab75a6d4cd380defd5b4742699602d364e546641e0fa20b83614f198","source":{"kind":"arxiv","id":"1904.03050","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03050","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03050v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03050","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"YY72YPFLOWTN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YY72YPFLOWTNJTJY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YY72YPFL","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YY72YPFLOWTNJTJYBXX5LNDUE2","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-05T13:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"b8bc158f5d4ae5aa471bf8089d31a342b88e1603eeb999d053a14e8ab5dde391","abstract_canon_sha256":"60f8522535086197bedc0c019cf8b103b38bc88e1d150ff50a5ad152dd5419ee"},"schema_version":"1.0"},"canonical_sha256":"c63fac3cab75a6d4cd380defd5b4742699602d364e546641e0fa20b83614f198","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:18.757921Z","signature_b64":"jEpYOICVPmu1yjvRcCUhxYNemrlIMBHaVMRjGEBDi2vvNkALDxrtj/ycjDEjBOQLxJotwtNwFwZouaW+bMWlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63fac3cab75a6d4cd380defd5b4742699602d364e546641e0fa20b83614f198","last_reissued_at":"2026-05-17T23:49:18.757301Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:18.757301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03050","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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kr6xzyvosOsBshNKmzHyTrIpgTmjtppiIvgKdbzPczXmmsUPU72YSaoJfXkVsRNZoilw6dQzohnAxheI9GOQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:22.175614Z"},"content_sha256":"71477dbd509d65b3d25f129d528aef93b2524b1e95ced45cdfeffc819122d92b","schema_version":"1.0","event_id":"sha256:71477dbd509d65b3d25f129d528aef93b2524b1e95ced45cdfeffc819122d92b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YY72YPFLOWTNJTJYBXX5LNDUE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jonas Cleve, Wolfgang Mulzer","submitted_at":"2019-04-05T13:20:09Z","abstract_excerpt":"We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, the input resides in a read-only array that can be accessed at random. In addition, the algorithm may use a constant number of words for reading and for writing. The constant-workspace model has been studied extensively in recent years, and algorithms for geodesic shortest paths have received particular attention.\n  We have implemented three such algorithms in Python, and we compare them to the classic algorithm by Le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03050","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-17T23:49:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hfRL6iMN97y+rESm8MJryJy2vwKilug4FgzqD9QAPRabnb9y4wOhpUAefdVwHYzoJv/oD/HhthhWe9HKqWofBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:20:22.176196Z"},"content_sha256":"e4067a9d50c0057a70e570b9003e460d5f399f2c62a92c3e92a6a872f76c3375","schema_version":"1.0","event_id":"sha256:e4067a9d50c0057a70e570b9003e460d5f399f2c62a92c3e92a6a872f76c3375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/bundle.json","state_url":"https://pith.science/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/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-31T03:20:22Z","links":{"resolver":"https://pith.science/pith/YY72YPFLOWTNJTJYBXX5LNDUE2","bundle":"https://pith.science/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/bundle.json","state":"https://pith.science/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY72YPFLOWTNJTJYBXX5LNDUE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YY72YPFLOWTNJTJYBXX5LNDUE2","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":"60f8522535086197bedc0c019cf8b103b38bc88e1d150ff50a5ad152dd5419ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-05T13:20:09Z","title_canon_sha256":"b8bc158f5d4ae5aa471bf8089d31a342b88e1603eeb999d053a14e8ab5dde391"},"schema_version":"1.0","source":{"id":"1904.03050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03050","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03050v1","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03050","created_at":"2026-05-17T23:49:18Z"},{"alias_kind":"pith_short_12","alias_value":"YY72YPFLOWTN","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YY72YPFLOWTNJTJY","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YY72YPFL","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:e4067a9d50c0057a70e570b9003e460d5f399f2c62a92c3e92a6a872f76c3375","target":"graph","created_at":"2026-05-17T23:49:18Z","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":"We perform an experimental evaluation of algorithms for finding geodesic shortest paths between two points inside a simple polygon in the constant-workspace model. In this model, the input resides in a read-only array that can be accessed at random. In addition, the algorithm may use a constant number of words for reading and for writing. The constant-workspace model has been studied extensively in recent years, and algorithms for geodesic shortest paths have received particular attention.\n  We have implemented three such algorithms in Python, and we compare them to the classic algorithm by Le","authors_text":"Jonas Cleve, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-05T13:20:09Z","title":"An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03050","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:71477dbd509d65b3d25f129d528aef93b2524b1e95ced45cdfeffc819122d92b","target":"record","created_at":"2026-05-17T23:49:18Z","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":"60f8522535086197bedc0c019cf8b103b38bc88e1d150ff50a5ad152dd5419ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-05T13:20:09Z","title_canon_sha256":"b8bc158f5d4ae5aa471bf8089d31a342b88e1603eeb999d053a14e8ab5dde391"},"schema_version":"1.0","source":{"id":"1904.03050","kind":"arxiv","version":1}},"canonical_sha256":"c63fac3cab75a6d4cd380defd5b4742699602d364e546641e0fa20b83614f198","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63fac3cab75a6d4cd380defd5b4742699602d364e546641e0fa20b83614f198","first_computed_at":"2026-05-17T23:49:18.757301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:18.757301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jEpYOICVPmu1yjvRcCUhxYNemrlIMBHaVMRjGEBDi2vvNkALDxrtj/ycjDEjBOQLxJotwtNwFwZouaW+bMWlAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:18.757921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71477dbd509d65b3d25f129d528aef93b2524b1e95ced45cdfeffc819122d92b","sha256:e4067a9d50c0057a70e570b9003e460d5f399f2c62a92c3e92a6a872f76c3375"],"state_sha256":"b3a4b23b8d039c1f0441b99c471fa74444f8aa76239fb427f18ed73e7723ed02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m5s4TAGWurh5AajrGh36IdmazG1UAQ7UypKaUbN2bYGMJEGqcGde7375VylzjYzIRz44UeNkxElS7fTS4HxJAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:20:22.178908Z","bundle_sha256":"0b31a943c61109e494f9c771742324d5e3226051d1ef12f05be150beda137dac"}}