{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Z72TVM2VDVSI2HGHOOEPBQ5VFI","short_pith_number":"pith:Z72TVM2V","canonical_record":{"source":{"id":"1906.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:56:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9a152d6741fbe2a69157e8450c33a5316ffe9386a86a7c4d72d96b5d85512028","abstract_canon_sha256":"dcd023ecfe228e0d44d5bb63f9ddf25b9146705e4b760b60bb144b432b871927"},"schema_version":"1.0"},"canonical_sha256":"cff53ab3551d648d1cc77388f0c3b52a3990410b7ecf668f23bbed287795d1d5","source":{"kind":"arxiv","id":"1906.05101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05101","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05101v2","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05101","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"Z72TVM2VDVSI","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_16","alias_value":"Z72TVM2VDVSI2HGH","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_8","alias_value":"Z72TVM2V","created_at":"2026-07-04T23:59:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Z72TVM2VDVSI2HGHOOEPBQ5VFI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:56:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9a152d6741fbe2a69157e8450c33a5316ffe9386a86a7c4d72d96b5d85512028","abstract_canon_sha256":"dcd023ecfe228e0d44d5bb63f9ddf25b9146705e4b760b60bb144b432b871927"},"schema_version":"1.0"},"canonical_sha256":"cff53ab3551d648d1cc77388f0c3b52a3990410b7ecf668f23bbed287795d1d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:22.937539Z","signature_b64":"sru62CCVZARb7zeMfJfyDnq5O5eKxnqOuPoY1/JEbHtIH9uAk3ehi0TDbuhN1wvUEu6FfBgwheqdd3XYSLQoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cff53ab3551d648d1cc77388f0c3b52a3990410b7ecf668f23bbed287795d1d5","last_reissued_at":"2026-07-04T23:59:22.937053Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:22.937053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05101","source_version":2,"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-07-04T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGmBQPnWonVYzS+BpCMk3i9Wf0hLP7QC+V/FGFm1nV+qrCDDxoBrztnthGCfVBdl//gq9KlB43lN6+mKVJhcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:03.532717Z"},"content_sha256":"72117d5d056ba6d8b21963adc941135f8f5b22be4a6382f0c52d587ab2be0302","schema_version":"1.0","event_id":"sha256:72117d5d056ba6d8b21963adc941135f8f5b22be4a6382f0c52d587ab2be0302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Z72TVM2VDVSI2HGHOOEPBQ5VFI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Universal Near Shortest Simple Paths Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrea Maier, Luca E. Sch\\\"afer, Stefan Ruzika","submitted_at":"2019-06-12T12:56:27Z","abstract_excerpt":"This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path problems by introducing a universal weight vector. We apply this concept to the Near Shortest Paths Problem in a way that we are able to enumerate all universal near shortest simple paths. We present two recursive algorithms to compute the set of universal near shortest simple paths between two prespecified vertices and evaluate the running time com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05101","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.05101/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1HCyRGNyjrC7vT/VWFB9hC/PsSCSTuFahZZtCHCOKvoD1IkMfF32ql+wfJ1Sb8eCpCix21AzGZ0kToD140uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:03.533339Z"},"content_sha256":"729f99644e4e462950dcd761619b865dd484e94da45461130b0f3318aa0be0fb","schema_version":"1.0","event_id":"sha256:729f99644e4e462950dcd761619b865dd484e94da45461130b0f3318aa0be0fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/bundle.json","state_url":"https://pith.science/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/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-08-03T15:51:03Z","links":{"resolver":"https://pith.science/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI","bundle":"https://pith.science/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/bundle.json","state":"https://pith.science/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z72TVM2VDVSI2HGHOOEPBQ5VFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Z72TVM2VDVSI2HGHOOEPBQ5VFI","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":"dcd023ecfe228e0d44d5bb63f9ddf25b9146705e4b760b60bb144b432b871927","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:56:27Z","title_canon_sha256":"9a152d6741fbe2a69157e8450c33a5316ffe9386a86a7c4d72d96b5d85512028"},"schema_version":"1.0","source":{"id":"1906.05101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05101","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05101v2","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05101","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"Z72TVM2VDVSI","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_16","alias_value":"Z72TVM2VDVSI2HGH","created_at":"2026-07-04T23:59:22Z"},{"alias_kind":"pith_short_8","alias_value":"Z72TVM2V","created_at":"2026-07-04T23:59:22Z"}],"graph_snapshots":[{"event_id":"sha256:729f99644e4e462950dcd761619b865dd484e94da45461130b0f3318aa0be0fb","target":"graph","created_at":"2026-07-04T23:59:22Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1906.05101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path problems by introducing a universal weight vector. We apply this concept to the Near Shortest Paths Problem in a way that we are able to enumerate all universal near shortest simple paths. We present two recursive algorithms to compute the set of universal near shortest simple paths between two prespecified vertices and evaluate the running time com","authors_text":"Andrea Maier, Luca E. Sch\\\"afer, Stefan Ruzika","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:56:27Z","title":"On the Universal Near Shortest Simple Paths Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05101","kind":"arxiv","version":2},"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:72117d5d056ba6d8b21963adc941135f8f5b22be4a6382f0c52d587ab2be0302","target":"record","created_at":"2026-07-04T23:59:22Z","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":"dcd023ecfe228e0d44d5bb63f9ddf25b9146705e4b760b60bb144b432b871927","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:56:27Z","title_canon_sha256":"9a152d6741fbe2a69157e8450c33a5316ffe9386a86a7c4d72d96b5d85512028"},"schema_version":"1.0","source":{"id":"1906.05101","kind":"arxiv","version":2}},"canonical_sha256":"cff53ab3551d648d1cc77388f0c3b52a3990410b7ecf668f23bbed287795d1d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cff53ab3551d648d1cc77388f0c3b52a3990410b7ecf668f23bbed287795d1d5","first_computed_at":"2026-07-04T23:59:22.937053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:22.937053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sru62CCVZARb7zeMfJfyDnq5O5eKxnqOuPoY1/JEbHtIH9uAk3ehi0TDbuhN1wvUEu6FfBgwheqdd3XYSLQoAg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:22.937539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72117d5d056ba6d8b21963adc941135f8f5b22be4a6382f0c52d587ab2be0302","sha256:729f99644e4e462950dcd761619b865dd484e94da45461130b0f3318aa0be0fb"],"state_sha256":"4addd30069a082e2a33fd641dfa36a8cca80d1957699570ce3c379ff430efbc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Uism/9Ad2KJgee526YPUK5WhK80LI0ck12eNlzn6lnojIVKyqav/FsgVYVtfWyjusUybA+ggbJdpkQ64JdEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:51:03.537054Z","bundle_sha256":"0ab5b7429c635bfd9557553d069104d8e182df73fa3efa987b530c08c3bb2d5d"}}