{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:S7V72FYL5IL7XOX3XL4IANB4XK","short_pith_number":"pith:S7V72FYL","canonical_record":{"source":{"id":"2112.11927","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-22T14:47:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"de4c7cae269cbdfefbc3a971530018594e02fab653515d307956890aedcd2e22","abstract_canon_sha256":"1b51c7e09d69530e0c3430a289ee05c2b6002c5ae5ccb7e3b14f4feacb4f62e7"},"schema_version":"1.0"},"canonical_sha256":"97ebfd170bea17fbbafbbaf880343cba941d765ab3f78e2545cefe63ebf04ee7","source":{"kind":"arxiv","id":"2112.11927","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.11927","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"2112.11927v2","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11927","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"S7V72FYL5IL7","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_16","alias_value":"S7V72FYL5IL7XOX3","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_8","alias_value":"S7V72FYL","created_at":"2026-07-05T05:47:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:S7V72FYL5IL7XOX3XL4IANB4XK","target":"record","payload":{"canonical_record":{"source":{"id":"2112.11927","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-22T14:47:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"de4c7cae269cbdfefbc3a971530018594e02fab653515d307956890aedcd2e22","abstract_canon_sha256":"1b51c7e09d69530e0c3430a289ee05c2b6002c5ae5ccb7e3b14f4feacb4f62e7"},"schema_version":"1.0"},"canonical_sha256":"97ebfd170bea17fbbafbbaf880343cba941d765ab3f78e2545cefe63ebf04ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:56.902132Z","signature_b64":"c6CEUS1QHl3DoYJK9564/+ur18VUQkrQ0X2MSHc1fJcs9WTv2+7jX/nqMyPiyxVNNTx4ilX0pNW3ZQ3wrTUqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97ebfd170bea17fbbafbbaf880343cba941d765ab3f78e2545cefe63ebf04ee7","last_reissued_at":"2026-07-05T05:47:56.901590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:56.901590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.11927","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-05T05:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VDo9t9EVZ6XN0JdjJNB44ffHb4vZomQjjfD3hqHT242y5aU016UA0Pi1FM04fluOqk5MM4Uf8uD7cM8WnjgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:34:55.182169Z"},"content_sha256":"94aeaef7abb139ae0fec8005e6104c6f726a5070ecdda5e1fdfef2ac2ad8dc1d","schema_version":"1.0","event_id":"sha256:94aeaef7abb139ae0fec8005e6104c6f726a5070ecdda5e1fdfef2ac2ad8dc1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:S7V72FYL5IL7XOX3XL4IANB4XK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Guido Sch\\\"afer, Willem Feijen","submitted_at":"2021-12-22T14:47:32Z","abstract_excerpt":"We study the use of machine learning techniques to solve a fundamental shortest path problem, known as the single-source many-targets shortest path problem (SSMTSP). Given a directed graph with non-negative edge weights, our goal is to compute a shortest path from a given source node to any of several target nodes. Basically, our idea is to equip an adapted version of Dijkstras algorithm with machine learning predictions to solve this problem: Based on the trace of the algorithm, we design a neural network that predicts the shortest path distance after a few iterations. The prediction is then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11927","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/2112.11927/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-05T05:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giT2eUYv5ey5agrpECmmc8x36oVncCZxIkbaHM68RSAPnKWlTczvTtaTZAiBuXhNNDpcUqtJrnw5+0PTlu/GAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:34:55.182718Z"},"content_sha256":"b87700764142b4c45edf6a4a4106e13beed9860062fddd5b57bd945b8ea4c060","schema_version":"1.0","event_id":"sha256:b87700764142b4c45edf6a4a4106e13beed9860062fddd5b57bd945b8ea4c060"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7V72FYL5IL7XOX3XL4IANB4XK/bundle.json","state_url":"https://pith.science/pith/S7V72FYL5IL7XOX3XL4IANB4XK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7V72FYL5IL7XOX3XL4IANB4XK/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:34:55Z","links":{"resolver":"https://pith.science/pith/S7V72FYL5IL7XOX3XL4IANB4XK","bundle":"https://pith.science/pith/S7V72FYL5IL7XOX3XL4IANB4XK/bundle.json","state":"https://pith.science/pith/S7V72FYL5IL7XOX3XL4IANB4XK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7V72FYL5IL7XOX3XL4IANB4XK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:S7V72FYL5IL7XOX3XL4IANB4XK","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":"1b51c7e09d69530e0c3430a289ee05c2b6002c5ae5ccb7e3b14f4feacb4f62e7","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-22T14:47:32Z","title_canon_sha256":"de4c7cae269cbdfefbc3a971530018594e02fab653515d307956890aedcd2e22"},"schema_version":"1.0","source":{"id":"2112.11927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.11927","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"2112.11927v2","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.11927","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"S7V72FYL5IL7","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_16","alias_value":"S7V72FYL5IL7XOX3","created_at":"2026-07-05T05:47:56Z"},{"alias_kind":"pith_short_8","alias_value":"S7V72FYL","created_at":"2026-07-05T05:47:56Z"}],"graph_snapshots":[{"event_id":"sha256:b87700764142b4c45edf6a4a4106e13beed9860062fddd5b57bd945b8ea4c060","target":"graph","created_at":"2026-07-05T05:47:56Z","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/2112.11927/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the use of machine learning techniques to solve a fundamental shortest path problem, known as the single-source many-targets shortest path problem (SSMTSP). Given a directed graph with non-negative edge weights, our goal is to compute a shortest path from a given source node to any of several target nodes. Basically, our idea is to equip an adapted version of Dijkstras algorithm with machine learning predictions to solve this problem: Based on the trace of the algorithm, we design a neural network that predicts the shortest path distance after a few iterations. The prediction is then ","authors_text":"Guido Sch\\\"afer, Willem Feijen","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-22T14:47:32Z","title":"Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.11927","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:94aeaef7abb139ae0fec8005e6104c6f726a5070ecdda5e1fdfef2ac2ad8dc1d","target":"record","created_at":"2026-07-05T05:47:56Z","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":"1b51c7e09d69530e0c3430a289ee05c2b6002c5ae5ccb7e3b14f4feacb4f62e7","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-12-22T14:47:32Z","title_canon_sha256":"de4c7cae269cbdfefbc3a971530018594e02fab653515d307956890aedcd2e22"},"schema_version":"1.0","source":{"id":"2112.11927","kind":"arxiv","version":2}},"canonical_sha256":"97ebfd170bea17fbbafbbaf880343cba941d765ab3f78e2545cefe63ebf04ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97ebfd170bea17fbbafbbaf880343cba941d765ab3f78e2545cefe63ebf04ee7","first_computed_at":"2026-07-05T05:47:56.901590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:56.901590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6CEUS1QHl3DoYJK9564/+ur18VUQkrQ0X2MSHc1fJcs9WTv2+7jX/nqMyPiyxVNNTx4ilX0pNW3ZQ3wrTUqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:56.902132Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.11927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94aeaef7abb139ae0fec8005e6104c6f726a5070ecdda5e1fdfef2ac2ad8dc1d","sha256:b87700764142b4c45edf6a4a4106e13beed9860062fddd5b57bd945b8ea4c060"],"state_sha256":"96293b4135f65b65c8d9c2815afd2322364e4a8352c6ffa258dd5874be1b51a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgDfyzmo5WzThwHmYQVKs2fD3CeKRcoTPy/EvLuq11TkjGqzuMaTZz8tUQvoYJNXRw7s3bDmirhfjVeg2Ir7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:34:55.187606Z","bundle_sha256":"6c6a90fd784270b205a8128daa3d1e8c1971f26b8d59e198ff3cf38c395f97c7"}}