{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HPXXYRC43FTNIAXJVLKSBEM37F","short_pith_number":"pith:HPXXYRC4","schema_version":"1.0","canonical_sha256":"3bef7c445cd966d402e9aad520919bf944ab40dd220c234618a74cba486f17d8","source":{"kind":"arxiv","id":"1509.05637","version":3},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05637","created_at":"2026-05-18T01:11:03.440282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05637v3","created_at":"2026-05-18T01:11:03.440282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05637","created_at":"2026-05-18T01:11:03.440282+00:00"},{"alias_kind":"pith_short_12","alias_value":"HPXXYRC43FTN","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HPXXYRC43FTNIAXJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HPXXYRC4","created_at":"2026-05-18T12:29:25.134429+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/HPXXYRC43FTNIAXJVLKSBEM37F","json":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F.json","graph_json":"https://pith.science/api/pith-number/HPXXYRC43FTNIAXJVLKSBEM37F/graph.json","events_json":"https://pith.science/api/pith-number/HPXXYRC43FTNIAXJVLKSBEM37F/events.json","paper":"https://pith.science/paper/HPXXYRC4"},"agent_actions":{"view_html":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F","download_json":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F.json","view_paper":"https://pith.science/paper/HPXXYRC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05637&json=true","fetch_graph":"https://pith.science/api/pith-number/HPXXYRC43FTNIAXJVLKSBEM37F/graph.json","fetch_events":"https://pith.science/api/pith-number/HPXXYRC43FTNIAXJVLKSBEM37F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/action/storage_attestation","attest_author":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/action/author_attestation","sign_citation":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/action/citation_signature","submit_replication":"https://pith.science/pith/HPXXYRC43FTNIAXJVLKSBEM37F/action/replication_record"}},"created_at":"2026-05-18T01:11:03.440282+00:00","updated_at":"2026-05-18T01:11:03.440282+00:00"}