{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HPXXYRC43FTNIAXJVLKSBEM37F","short_pith_number":"pith:HPXXYRC4","canonical_record":{"source":{"id":"1509.05637","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T14:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"04e6054bcf483a7aea4b60e785738d2e9f22f5ea9866593952665d0d1160d243","abstract_canon_sha256":"2e0224a69438f7398bc58560326a06473ffd05c34cc0af52e6681a0faa5636fa"},"schema_version":"1.0"},"canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","source":{"kind":"arxiv","id":"1509.05637","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05637","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05637v3","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05637","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"HPXXYRC43FTN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HPXXYRC43FTNIAXJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HPXXYRC4","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HPXXYRC43FTNIAXJVLKSBEM37F","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05637","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T14:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"04e6054bcf483a7aea4b60e785738d2e9f22f5ea9866593952665d0d1160d243","abstract_canon_sha256":"2e0224a69438f7398bc58560326a06473ffd05c34cc0af52e6681a0faa5636fa"},"schema_version":"1.0"},"canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:03.440615Z","signature_b64":"loKz+PnhvaCmn5ZpBoSoTjPKloz5het9ez+BcIQeHeGuEKINqtdFygwfqTCPDNb08LYE+/12Y6482hhsbM0mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","last_reissued_at":"2026-05-18T01:11:03.440207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:03.440207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05637","source_version":3,"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-18T01:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oWB847L8WM6HwXKY/CkNLJ1RgxuP+h1hL2Ma5uU9eWM7ysi71p8s6vVknz0ON35AENuMXaI3M19sdEFOf5wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:22:46.859373Z"},"content_sha256":"f9978f5b7dd6c210331200f01db481fe9ca5f2b09aeaad1d64ff709128b2b064","schema_version":"1.0","event_id":"sha256:f9978f5b7dd6c210331200f01db481fe9ca5f2b09aeaad1d64ff709128b2b064"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HPXXYRC43FTNIAXJVLKSBEM37F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Shortest Path Problem with Edge Information Reuse is NP-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2015-09-18T14:17:59Z","abstract_excerpt":"We show that the following variation of the single-source shortest path problem is NP-complete. Let a weighted, directed, acyclic graph $G=(V,E,w)$ with source and sink vertices $s$ and $t$ be given. Let in addition a mapping $f$ on $E$ be given that associates information with the edges (e.g., a pointer), such that $f(e)=f(e')$ means that edges $e$ and $e'$ carry the same information; for such edges it is required that $w(e)=w(e')$. The length of a simple $st$ path $U$ is the sum of the weights of the edges on $U$ but edges with $f(e)=f(e')$ are counted only once. The problem is to determine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05637","kind":"arxiv","version":3},"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-18T01:11:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6KbfGSf7RBGI8iUZkTp5plTSxUE5K+zt4mIo0glaCznSHyLjaJigtJdNwUOcNS9rIHJF7tbYFOKVyR3hD0KVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:22:46.859861Z"},"content_sha256":"77fc1a177449c079d601a05ac3d61f03880ddac4dac70db6e8e4b909aab14f1a","schema_version":"1.0","event_id":"sha256:77fc1a177449c079d601a05ac3d61f03880ddac4dac70db6e8e4b909aab14f1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/bundle.json","state_url":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPXXYRC43FTNIAXJVLKSBEM37F/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-24T08:22:46Z","links":{"resolver":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F","bundle":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/bundle.json","state":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPXXYRC43FTNIAXJVLKSBEM37F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HPXXYRC43FTNIAXJVLKSBEM37F","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":"2e0224a69438f7398bc58560326a06473ffd05c34cc0af52e6681a0faa5636fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T14:17:59Z","title_canon_sha256":"04e6054bcf483a7aea4b60e785738d2e9f22f5ea9866593952665d0d1160d243"},"schema_version":"1.0","source":{"id":"1509.05637","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05637","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05637v3","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05637","created_at":"2026-05-18T01:11:03Z"},{"alias_kind":"pith_short_12","alias_value":"HPXXYRC43FTN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HPXXYRC43FTNIAXJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HPXXYRC4","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:77fc1a177449c079d601a05ac3d61f03880ddac4dac70db6e8e4b909aab14f1a","target":"graph","created_at":"2026-05-18T01:11:03Z","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 show that the following variation of the single-source shortest path problem is NP-complete. Let a weighted, directed, acyclic graph $G=(V,E,w)$ with source and sink vertices $s$ and $t$ be given. Let in addition a mapping $f$ on $E$ be given that associates information with the edges (e.g., a pointer), such that $f(e)=f(e')$ means that edges $e$ and $e'$ carry the same information; for such edges it is required that $w(e)=w(e')$. The length of a simple $st$ path $U$ is the sum of the weights of the edges on $U$ but edges with $f(e)=f(e')$ are counted only once. The problem is to determine ","authors_text":"Jesper Larsson Tr\\\"aff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T14:17:59Z","title":"The Shortest Path Problem with Edge Information Reuse is NP-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05637","kind":"arxiv","version":3},"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:f9978f5b7dd6c210331200f01db481fe9ca5f2b09aeaad1d64ff709128b2b064","target":"record","created_at":"2026-05-18T01:11:03Z","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":"2e0224a69438f7398bc58560326a06473ffd05c34cc0af52e6681a0faa5636fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-18T14:17:59Z","title_canon_sha256":"04e6054bcf483a7aea4b60e785738d2e9f22f5ea9866593952665d0d1160d243"},"schema_version":"1.0","source":{"id":"1509.05637","kind":"arxiv","version":3}},"canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","first_computed_at":"2026-05-18T01:11:03.440207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:03.440207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"loKz+PnhvaCmn5ZpBoSoTjPKloz5het9ez+BcIQeHeGuEKINqtdFygwfqTCPDNb08LYE+/12Y6482hhsbM0mDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:03.440615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05637","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9978f5b7dd6c210331200f01db481fe9ca5f2b09aeaad1d64ff709128b2b064","sha256:77fc1a177449c079d601a05ac3d61f03880ddac4dac70db6e8e4b909aab14f1a"],"state_sha256":"3112675136a7a3bf2ac0693c97d848a949b31e8d6cc15489d1b8d12547d926d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhqBcgTnU3Pm1vNvJNJwb8Hui7wVGHtTIL7Zo1KP7o7wXoZ6LAvcc/iNHN8QLSB/yj9R41XsF/3IoagooxvPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:22:46.862428Z","bundle_sha256":"ed879c334920a7193a3eeacfab63d2da79ad47d340fc6bd693322efa2a528ad7"}}