{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2IOGKKUNMJY2IGBOUEK7MS4BWF","short_pith_number":"pith:2IOGKKUN","canonical_record":{"source":{"id":"2204.08938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-11T10:13:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"73fbbb704248d20dcc8f5da0dbb70fa7b88d42d0963e8ad4c78782a129ad9fa2","abstract_canon_sha256":"112259f6d106e355d9f4b06930f46b190ceff2a1acd3e18402b30f6a3118d9f3"},"schema_version":"1.0"},"canonical_sha256":"d21c652a8d6271a4182ea115f64b81b1778bbb21800a166afca154d6f9a07968","source":{"kind":"arxiv","id":"2204.08938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.08938","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"2204.08938v1","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08938","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"2IOGKKUNMJY2","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_16","alias_value":"2IOGKKUNMJY2IGBO","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_8","alias_value":"2IOGKKUN","created_at":"2026-07-05T04:16:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2IOGKKUNMJY2IGBOUEK7MS4BWF","target":"record","payload":{"canonical_record":{"source":{"id":"2204.08938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-11T10:13:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"73fbbb704248d20dcc8f5da0dbb70fa7b88d42d0963e8ad4c78782a129ad9fa2","abstract_canon_sha256":"112259f6d106e355d9f4b06930f46b190ceff2a1acd3e18402b30f6a3118d9f3"},"schema_version":"1.0"},"canonical_sha256":"d21c652a8d6271a4182ea115f64b81b1778bbb21800a166afca154d6f9a07968","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:09.072878Z","signature_b64":"GRTyWSa3ShL4iMz/hzArrryTI2nHKeVMgZiV1VM/Aa2iIH/vhZ0+y3fVuiP6o8aJZXoIpKkYi2/sR7El9Yc6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d21c652a8d6271a4182ea115f64b81b1778bbb21800a166afca154d6f9a07968","last_reissued_at":"2026-07-05T04:16:09.072156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:09.072156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.08938","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-07-05T04:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HhmcaOHyGSn02EupKDL6fPZJgrkLpSuFruv1PGoLwVWTJ9IDNYkITDnFZfKV6HFbmwd170CjttMDJwFcAGk7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:26:53.011423Z"},"content_sha256":"1a917a5cfa9a51802fe05ffa0b1fc688d2e42f063e1d1c5ff7f8ebeef9d7a194","schema_version":"1.0","event_id":"sha256:1a917a5cfa9a51802fe05ffa0b1fc688d2e42f063e1d1c5ff7f8ebeef9d7a194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2IOGKKUNMJY2IGBOUEK7MS4BWF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning heuristics for A*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Danilo Numeroso, Davide Bacciu, Petar Veli\\v{c}kovi\\'c","submitted_at":"2022-04-11T10:13:53Z","abstract_excerpt":"Path finding in graphs is one of the most studied classes of problems in computer science. In this context, search algorithms are often extended with heuristics for a more efficient search of target nodes. In this work we combine recent advancements in Neural Algorithmic Reasoning to learn efficient heuristic functions for path finding problems on graphs. At training time, we exploit multi-task learning to learn jointly the Dijkstra's algorithm and a consistent heuristic function for the A* search algorithm. At inference time, we plug our learnt heuristics into the A* algorithm. Results show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08938","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/2204.08938/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-05T04:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xp9vXWrS20ONWd8rtU1GD3fGiSk2OTnbR6dpGoVcXlUeqoeheo287oEK5wTRxyze6ne+2O4B3ktYpHLwzMWrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:26:53.011802Z"},"content_sha256":"b981ba040239dafac067e6b96f0c6874ff50247ae111e1a01d061070285b81c3","schema_version":"1.0","event_id":"sha256:b981ba040239dafac067e6b96f0c6874ff50247ae111e1a01d061070285b81c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/bundle.json","state_url":"https://pith.science/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/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-07-07T02:26:53Z","links":{"resolver":"https://pith.science/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF","bundle":"https://pith.science/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/bundle.json","state":"https://pith.science/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IOGKKUNMJY2IGBOUEK7MS4BWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2IOGKKUNMJY2IGBOUEK7MS4BWF","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":"112259f6d106e355d9f4b06930f46b190ceff2a1acd3e18402b30f6a3118d9f3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-11T10:13:53Z","title_canon_sha256":"73fbbb704248d20dcc8f5da0dbb70fa7b88d42d0963e8ad4c78782a129ad9fa2"},"schema_version":"1.0","source":{"id":"2204.08938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.08938","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"2204.08938v1","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.08938","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"2IOGKKUNMJY2","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_16","alias_value":"2IOGKKUNMJY2IGBO","created_at":"2026-07-05T04:16:09Z"},{"alias_kind":"pith_short_8","alias_value":"2IOGKKUN","created_at":"2026-07-05T04:16:09Z"}],"graph_snapshots":[{"event_id":"sha256:b981ba040239dafac067e6b96f0c6874ff50247ae111e1a01d061070285b81c3","target":"graph","created_at":"2026-07-05T04:16:09Z","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/2204.08938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Path finding in graphs is one of the most studied classes of problems in computer science. In this context, search algorithms are often extended with heuristics for a more efficient search of target nodes. In this work we combine recent advancements in Neural Algorithmic Reasoning to learn efficient heuristic functions for path finding problems on graphs. At training time, we exploit multi-task learning to learn jointly the Dijkstra's algorithm and a consistent heuristic function for the A* search algorithm. At inference time, we plug our learnt heuristics into the A* algorithm. Results show t","authors_text":"Danilo Numeroso, Davide Bacciu, Petar Veli\\v{c}kovi\\'c","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-11T10:13:53Z","title":"Learning heuristics for A*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.08938","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:1a917a5cfa9a51802fe05ffa0b1fc688d2e42f063e1d1c5ff7f8ebeef9d7a194","target":"record","created_at":"2026-07-05T04:16:09Z","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":"112259f6d106e355d9f4b06930f46b190ceff2a1acd3e18402b30f6a3118d9f3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2022-04-11T10:13:53Z","title_canon_sha256":"73fbbb704248d20dcc8f5da0dbb70fa7b88d42d0963e8ad4c78782a129ad9fa2"},"schema_version":"1.0","source":{"id":"2204.08938","kind":"arxiv","version":1}},"canonical_sha256":"d21c652a8d6271a4182ea115f64b81b1778bbb21800a166afca154d6f9a07968","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d21c652a8d6271a4182ea115f64b81b1778bbb21800a166afca154d6f9a07968","first_computed_at":"2026-07-05T04:16:09.072156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:16:09.072156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRTyWSa3ShL4iMz/hzArrryTI2nHKeVMgZiV1VM/Aa2iIH/vhZ0+y3fVuiP6o8aJZXoIpKkYi2/sR7El9Yc6Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:16:09.072878Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.08938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a917a5cfa9a51802fe05ffa0b1fc688d2e42f063e1d1c5ff7f8ebeef9d7a194","sha256:b981ba040239dafac067e6b96f0c6874ff50247ae111e1a01d061070285b81c3"],"state_sha256":"d0d0c3dfd020ff0b9c31c42551d9d47f81acce8900b1e6c7e121010fdb700f95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rg6Cr7Q9wv8Ue4z3jvL4setOrp/tvf1Nrs4zNWxggyEEf0ctbJBmvHMMXOMC7ZT93ownnlzl5rtc/NQ5RTZ0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:26:53.014671Z","bundle_sha256":"8e2beafece714d0b1d91e2ee4ba91717708e6258276c3513f504909829ea5c87"}}