{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LQUSCWMDFA2RKPZAUMYPYTSOCR","short_pith_number":"pith:LQUSCWMD","canonical_record":{"source":{"id":"2605.22149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T08:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"98aa5eedf9772fbe9006ff09fb169aa638302f315acf7ec4c6c2e1f29aa44d7e","abstract_canon_sha256":"033004b68afde0040e579d2676ba84d5257f088d5747aa136610cecc36ef6112"},"schema_version":"1.0"},"canonical_sha256":"5c292159832835153f20a330fc4e4e1467b74a604b2e1590f7761b61c702da14","source":{"kind":"arxiv","id":"2605.22149","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22149","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22149v1","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22149","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"LQUSCWMDFA2R","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"LQUSCWMDFA2RKPZA","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"LQUSCWMD","created_at":"2026-05-22T01:04:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LQUSCWMDFA2RKPZAUMYPYTSOCR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22149","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T08:20:49Z","cross_cats_sorted":[],"title_canon_sha256":"98aa5eedf9772fbe9006ff09fb169aa638302f315acf7ec4c6c2e1f29aa44d7e","abstract_canon_sha256":"033004b68afde0040e579d2676ba84d5257f088d5747aa136610cecc36ef6112"},"schema_version":"1.0"},"canonical_sha256":"5c292159832835153f20a330fc4e4e1467b74a604b2e1590f7761b61c702da14","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:28.644608Z","signature_b64":"OC+ukaeEaEi5YlFaShk6cjSH4uIXjmQ5TIM0h8UYq3aRAgk8J2kImXFC8F8+pFdr3ca1qCcSxIxPfha++lnoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c292159832835153f20a330fc4e4e1467b74a604b2e1590f7761b61c702da14","last_reissued_at":"2026-05-22T01:04:28.643868Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:28.643868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22149","source_version":1,"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-22T01:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pu39Qc3qRJJX1Dwn9RY6C1jyX2SK+WgEYIhwktB+4oh+yeWV6eWFs/qYU7A5UY+aE2mDCHq5iO51ZYKtPsTaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:28:53.400280Z"},"content_sha256":"66a1704d810c6b9eeb30f8864f757a20df29f6e581f81dacc2c871f203622721","schema_version":"1.0","event_id":"sha256:66a1704d810c6b9eeb30f8864f757a20df29f6e581f81dacc2c871f203622721"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LQUSCWMDFA2RKPZAUMYPYTSOCR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coalgebraic Dijkstra Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ichiro Hasuo, Kittiphon Phalakarn, Takahiro Sanada, Yo\\`av Montacute","submitted_at":"2026-05-21T08:20:49Z","abstract_excerpt":"The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms for the widest path problem and for two-player games. In this paper, we introduce the coalgebraic shortest path problem (CSPP), a unifying framework for a broad class of optimization problems on state-transition systems. This framework encompasses not only the aforementioned problems but also new ones such as the shortest binary tree problem. We further present a coalgebraic Dijkstra algorithm for solving the CSPP ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22149","kind":"arxiv","version":1},"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/2605.22149/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-05-22T01:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ygkPkpKaqoyOJkvyN++Vj9HshLt4AKtDFY3GZ19g0h/s1oCEhsSQE668AqiYrGvesGDDoDtsXaLLQSwrihxWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:28:53.401030Z"},"content_sha256":"029bb76fbeba3e2f7fa7712acfef5688164cf746cba354550e13093c9d0776be","schema_version":"1.0","event_id":"sha256:029bb76fbeba3e2f7fa7712acfef5688164cf746cba354550e13093c9d0776be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/bundle.json","state_url":"https://pith.science/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/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-05-31T07:28:53Z","links":{"resolver":"https://pith.science/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR","bundle":"https://pith.science/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/bundle.json","state":"https://pith.science/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQUSCWMDFA2RKPZAUMYPYTSOCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQUSCWMDFA2RKPZAUMYPYTSOCR","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":"033004b68afde0040e579d2676ba84d5257f088d5747aa136610cecc36ef6112","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T08:20:49Z","title_canon_sha256":"98aa5eedf9772fbe9006ff09fb169aa638302f315acf7ec4c6c2e1f29aa44d7e"},"schema_version":"1.0","source":{"id":"2605.22149","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22149","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22149v1","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22149","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"LQUSCWMDFA2R","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"LQUSCWMDFA2RKPZA","created_at":"2026-05-22T01:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"LQUSCWMD","created_at":"2026-05-22T01:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:029bb76fbeba3e2f7fa7712acfef5688164cf746cba354550e13093c9d0776be","target":"graph","created_at":"2026-05-22T01:04:28Z","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/2605.22149/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms for the widest path problem and for two-player games. In this paper, we introduce the coalgebraic shortest path problem (CSPP), a unifying framework for a broad class of optimization problems on state-transition systems. This framework encompasses not only the aforementioned problems but also new ones such as the shortest binary tree problem. We further present a coalgebraic Dijkstra algorithm for solving the CSPP ef","authors_text":"Ichiro Hasuo, Kittiphon Phalakarn, Takahiro Sanada, Yo\\`av Montacute","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T08:20:49Z","title":"A Coalgebraic Dijkstra Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22149","kind":"arxiv","version":1},"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:66a1704d810c6b9eeb30f8864f757a20df29f6e581f81dacc2c871f203622721","target":"record","created_at":"2026-05-22T01:04:28Z","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":"033004b68afde0040e579d2676ba84d5257f088d5747aa136610cecc36ef6112","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-21T08:20:49Z","title_canon_sha256":"98aa5eedf9772fbe9006ff09fb169aa638302f315acf7ec4c6c2e1f29aa44d7e"},"schema_version":"1.0","source":{"id":"2605.22149","kind":"arxiv","version":1}},"canonical_sha256":"5c292159832835153f20a330fc4e4e1467b74a604b2e1590f7761b61c702da14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c292159832835153f20a330fc4e4e1467b74a604b2e1590f7761b61c702da14","first_computed_at":"2026-05-22T01:04:28.643868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-22T01:04:28.643868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OC+ukaeEaEi5YlFaShk6cjSH4uIXjmQ5TIM0h8UYq3aRAgk8J2kImXFC8F8+pFdr3ca1qCcSxIxPfha++lnoBQ==","signature_status":"signed_v1","signed_at":"2026-05-22T01:04:28.644608Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22149","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66a1704d810c6b9eeb30f8864f757a20df29f6e581f81dacc2c871f203622721","sha256:029bb76fbeba3e2f7fa7712acfef5688164cf746cba354550e13093c9d0776be"],"state_sha256":"b21604711fe45fa2863f4d5601a016df70216d6c0783044e8f6613bac91551e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kE14DZQFNW14aZbHFhEMsphlSoNC0RBcTrRruTj6967Wv5HoJC6WfkRQXNkMUUJVUoroJHeDPGsmHy3dY/PuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:28:53.405005Z","bundle_sha256":"13ad130d13ba9c3de9a6b6ee911162333b70d01e8596412da78db771d1dcd517"}}