{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A6NR7VDAINW4XWWH4OA3UIPQLX","short_pith_number":"pith:A6NR7VDA","canonical_record":{"source":{"id":"1306.2827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-12T13:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"ba391867a6fe8516d254c52f3e364584ccf312ebd7ec3708c812e67e39082b0a","abstract_canon_sha256":"72b4ddb8523b0bd7bef76289447936be494943fde4f190aca92acfa674d9b14c"},"schema_version":"1.0"},"canonical_sha256":"079b1fd460436dcbdac7e381ba21f05dfcd183682b4acc2e0aece3549dc42d4c","source":{"kind":"arxiv","id":"1306.2827","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2827","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2827v1","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2827","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"A6NR7VDAINW4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6NR7VDAINW4XWWH","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6NR7VDA","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A6NR7VDAINW4XWWH4OA3UIPQLX","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-12T13:59:01Z","cross_cats_sorted":[],"title_canon_sha256":"ba391867a6fe8516d254c52f3e364584ccf312ebd7ec3708c812e67e39082b0a","abstract_canon_sha256":"72b4ddb8523b0bd7bef76289447936be494943fde4f190aca92acfa674d9b14c"},"schema_version":"1.0"},"canonical_sha256":"079b1fd460436dcbdac7e381ba21f05dfcd183682b4acc2e0aece3549dc42d4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:09.302278Z","signature_b64":"rTsevWlNnAzmyKE275k70Jh11eqzVEQeOrluVTp9gXjgBV9hRLbsPMkXK4wmt73OVZMAOsTfynaNoF5sSyWJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079b1fd460436dcbdac7e381ba21f05dfcd183682b4acc2e0aece3549dc42d4c","last_reissued_at":"2026-05-18T03:21:09.301674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:09.301674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2827","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:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTYBPgjtGBOg8Kz/V6vjys6v73D8jL3H96m6xoZMXP8Yviwo6+1KoFYfoS2z6vgpWXUHBDkfXSi2WPfzNdzoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:48.839276Z"},"content_sha256":"b5adb23d3d99c08bb38e165d9562dd6236f086108b612a6d6a1ebe4e355ed431","schema_version":"1.0","event_id":"sha256:b5adb23d3d99c08bb38e165d9562dd6236f086108b612a6d6a1ebe4e355ed431"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A6NR7VDAINW4XWWH4OA3UIPQLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Map Matching with Simplicity Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Wouter Meulemans","submitted_at":"2013-06-12T13:59:01Z","abstract_excerpt":"We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path according to this measure. However, these methods cannot guarantee that the result is simple (i.e. it does not intersect itself) even if the given curve is simple. In this paper, we prove that it is in fact NP-complete to determine the existence a simple cycle in a planar straight-line embedding of a graph that has at most a given Fr\\'echet distance to a given"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2827","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:21:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tTt+79uhcjpsCNjodomqqovMe4CZjYnOWi+zRB+DXdRpThROYIxAvcGMtpgz4uyGefA9IhMEIu6Ylzpm0euwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:11:48.839644Z"},"content_sha256":"da3e1408c02b2674169fa3c757f22b1aad60a7cefb118e1698d49330ae24a4ee","schema_version":"1.0","event_id":"sha256:da3e1408c02b2674169fa3c757f22b1aad60a7cefb118e1698d49330ae24a4ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/bundle.json","state_url":"https://pith.science/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/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-03T15:11:48Z","links":{"resolver":"https://pith.science/pith/A6NR7VDAINW4XWWH4OA3UIPQLX","bundle":"https://pith.science/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/bundle.json","state":"https://pith.science/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6NR7VDAINW4XWWH4OA3UIPQLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A6NR7VDAINW4XWWH4OA3UIPQLX","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":"72b4ddb8523b0bd7bef76289447936be494943fde4f190aca92acfa674d9b14c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-12T13:59:01Z","title_canon_sha256":"ba391867a6fe8516d254c52f3e364584ccf312ebd7ec3708c812e67e39082b0a"},"schema_version":"1.0","source":{"id":"1306.2827","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2827","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2827v1","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2827","created_at":"2026-05-18T03:21:09Z"},{"alias_kind":"pith_short_12","alias_value":"A6NR7VDAINW4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6NR7VDAINW4XWWH","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6NR7VDA","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:da3e1408c02b2674169fa3c757f22b1aad60a7cefb118e1698d49330ae24a4ee","target":"graph","created_at":"2026-05-18T03:21:09Z","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 study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path according to this measure. However, these methods cannot guarantee that the result is simple (i.e. it does not intersect itself) even if the given curve is simple. In this paper, we prove that it is in fact NP-complete to determine the existence a simple cycle in a planar straight-line embedding of a graph that has at most a given Fr\\'echet distance to a given","authors_text":"Wouter Meulemans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-12T13:59:01Z","title":"Map Matching with Simplicity Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2827","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:b5adb23d3d99c08bb38e165d9562dd6236f086108b612a6d6a1ebe4e355ed431","target":"record","created_at":"2026-05-18T03:21:09Z","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":"72b4ddb8523b0bd7bef76289447936be494943fde4f190aca92acfa674d9b14c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-06-12T13:59:01Z","title_canon_sha256":"ba391867a6fe8516d254c52f3e364584ccf312ebd7ec3708c812e67e39082b0a"},"schema_version":"1.0","source":{"id":"1306.2827","kind":"arxiv","version":1}},"canonical_sha256":"079b1fd460436dcbdac7e381ba21f05dfcd183682b4acc2e0aece3549dc42d4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"079b1fd460436dcbdac7e381ba21f05dfcd183682b4acc2e0aece3549dc42d4c","first_computed_at":"2026-05-18T03:21:09.301674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:09.301674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rTsevWlNnAzmyKE275k70Jh11eqzVEQeOrluVTp9gXjgBV9hRLbsPMkXK4wmt73OVZMAOsTfynaNoF5sSyWJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:09.302278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2827","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5adb23d3d99c08bb38e165d9562dd6236f086108b612a6d6a1ebe4e355ed431","sha256:da3e1408c02b2674169fa3c757f22b1aad60a7cefb118e1698d49330ae24a4ee"],"state_sha256":"748132bc1b078d5963b473fa5ac0bfd3f8c829cae5a7cbc3bbc2ae059208b46c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFFDfpflo5SnFyyOjGvaDqBtAP0iKHFdIzmTEnL2HaXwsqZPhgsXgUy9ushUme986gIFBX/YVgsvpT4ibgAtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:11:48.841592Z","bundle_sha256":"4de10c5b1c744abb462f6510e2864019d007aba452df075e8f5dad0b8745c3ff"}}