{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AH3ZX5BGFID3KBA5VQFJYP6MNJ","short_pith_number":"pith:AH3ZX5BG","canonical_record":{"source":{"id":"1808.09410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T16:59:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fc30a942576f287f6f918bf69ab9a451acabf4c8f9d95a83b09cce4e72784021","abstract_canon_sha256":"75d72882bfb1365875e8e55b15e0732770d1b43d24a25493b5e56d6b3e732f52"},"schema_version":"1.0"},"canonical_sha256":"01f79bf4262a07b5041dac0a9c3fcc6a589890457ac6a40f3aed4d7cca102f5f","source":{"kind":"arxiv","id":"1808.09410","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09410","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09410v2","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09410","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"AH3ZX5BGFID3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH3ZX5BGFID3KBA5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH3ZX5BG","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AH3ZX5BGFID3KBA5VQFJYP6MNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T16:59:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"fc30a942576f287f6f918bf69ab9a451acabf4c8f9d95a83b09cce4e72784021","abstract_canon_sha256":"75d72882bfb1365875e8e55b15e0732770d1b43d24a25493b5e56d6b3e732f52"},"schema_version":"1.0"},"canonical_sha256":"01f79bf4262a07b5041dac0a9c3fcc6a589890457ac6a40f3aed4d7cca102f5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:22.338650Z","signature_b64":"xvtI7utSF2TT6f0iINzSHG1TgOKbj/fMdHAn44TzXbb6e5kr4aVQqPuMhb+zAo1nmvvi7Rr14l3mle6C2kOHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f79bf4262a07b5041dac0a9c3fcc6a589890457ac6a40f3aed4d7cca102f5f","last_reissued_at":"2026-05-18T00:06:22.338036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:22.338036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09410","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-05-18T00:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcBFCjTjs7v5hundyqTmnEDnC9bQxpf7oiGyUyJOoadhuCAI1TzMOVNwrOrHyI3e5Fj0aefah1q6DB/oHJyzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:33:47.918358Z"},"content_sha256":"b0941837e799d1648d6430413d2a31685809ff71c61cd326626e90279945941e","schema_version":"1.0","event_id":"sha256:b0941837e799d1648d6430413d2a31685809ff71c61cd326626e90279945941e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AH3ZX5BGFID3KBA5VQFJYP6MNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shortest Paths with Ordinal Weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Jos\\'e Rui Figueira, Luca E. Sch\\\"afer, Nicolas Fr\\\"ohlich, Stefan Ruzika, Tobias Dietz","submitted_at":"2018-08-28T16:59:23Z","abstract_excerpt":"We investigate the single-source-single-destination \"shortest\" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Further, we show that the number of ordinally non-dominated paths vectors from the source node to every other node in the graph is polynomially bounded and we propose a polynomial time labeling algorithm for solving the problem of finding the set of ordinally non-dominated paths vectors from source to sink."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09410","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":""},"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-18T00:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTMWhRWDN4e+gFz4GPBmPFMU6jx1e6dTfXtSLHSR3W6gC1jAekJpptrfhIelEcA4Y5tK47uLTYKDrhZ/CCrwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:33:47.918703Z"},"content_sha256":"84bbf05d07d90c9092492d39472a0388c379621700566602750001c6728f1a0a","schema_version":"1.0","event_id":"sha256:84bbf05d07d90c9092492d39472a0388c379621700566602750001c6728f1a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/bundle.json","state_url":"https://pith.science/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/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-03T16:33:47Z","links":{"resolver":"https://pith.science/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ","bundle":"https://pith.science/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/bundle.json","state":"https://pith.science/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AH3ZX5BGFID3KBA5VQFJYP6MNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AH3ZX5BGFID3KBA5VQFJYP6MNJ","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":"75d72882bfb1365875e8e55b15e0732770d1b43d24a25493b5e56d6b3e732f52","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T16:59:23Z","title_canon_sha256":"fc30a942576f287f6f918bf69ab9a451acabf4c8f9d95a83b09cce4e72784021"},"schema_version":"1.0","source":{"id":"1808.09410","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09410","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09410v2","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09410","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"AH3ZX5BGFID3","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AH3ZX5BGFID3KBA5","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AH3ZX5BG","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:84bbf05d07d90c9092492d39472a0388c379621700566602750001c6728f1a0a","target":"graph","created_at":"2026-05-18T00:06: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"},"paper":{"abstract_excerpt":"We investigate the single-source-single-destination \"shortest\" paths problem in acyclic graphs with ordinal weighted arc costs. We define the concepts of ordinal dominance and efficiency for paths and their associated ordinal levels, respectively. Further, we show that the number of ordinally non-dominated paths vectors from the source node to every other node in the graph is polynomially bounded and we propose a polynomial time labeling algorithm for solving the problem of finding the set of ordinally non-dominated paths vectors from source to sink.","authors_text":"Jos\\'e Rui Figueira, Luca E. Sch\\\"afer, Nicolas Fr\\\"ohlich, Stefan Ruzika, Tobias Dietz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T16:59:23Z","title":"Shortest Paths with Ordinal Weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09410","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:b0941837e799d1648d6430413d2a31685809ff71c61cd326626e90279945941e","target":"record","created_at":"2026-05-18T00:06: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":"75d72882bfb1365875e8e55b15e0732770d1b43d24a25493b5e56d6b3e732f52","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-28T16:59:23Z","title_canon_sha256":"fc30a942576f287f6f918bf69ab9a451acabf4c8f9d95a83b09cce4e72784021"},"schema_version":"1.0","source":{"id":"1808.09410","kind":"arxiv","version":2}},"canonical_sha256":"01f79bf4262a07b5041dac0a9c3fcc6a589890457ac6a40f3aed4d7cca102f5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01f79bf4262a07b5041dac0a9c3fcc6a589890457ac6a40f3aed4d7cca102f5f","first_computed_at":"2026-05-18T00:06:22.338036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:22.338036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xvtI7utSF2TT6f0iINzSHG1TgOKbj/fMdHAn44TzXbb6e5kr4aVQqPuMhb+zAo1nmvvi7Rr14l3mle6C2kOHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:22.338650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09410","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0941837e799d1648d6430413d2a31685809ff71c61cd326626e90279945941e","sha256:84bbf05d07d90c9092492d39472a0388c379621700566602750001c6728f1a0a"],"state_sha256":"7bc3525985fda025cd0299d105190c245eb68fa7f90a2da01eaffa81864217f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKuJMyDTNQY7L+DIvNzMH7pXfqRhTjXbfntY2YQnq5zVrhFYRP84MkzkBx8mxwxePMcSJK528bJSloaEXttNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:33:47.920636Z","bundle_sha256":"13a97fa15e227548f68fc3bb34d373fec4560816e8120b865190c365eccc7de4"}}