{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YBKCK6BQ6QJNMGNBCX4UBFOQZ5","short_pith_number":"pith:YBKCK6BQ","canonical_record":{"source":{"id":"2302.04496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T08:46:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96e26b1bc33c83ece3be47dfeef40e4e1b44d5775bd29b96c655f7ce6420b7f2","abstract_canon_sha256":"de200378062d48f7779852ad0a493e9fd4a3787c37ad88c9509a4f4a067cbb3b"},"schema_version":"1.0"},"canonical_sha256":"c054257830f412d619a115f94095d0cf6c61ced14074331c0b22fac1a924d83f","source":{"kind":"arxiv","id":"2302.04496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04496","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04496v1","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04496","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"YBKCK6BQ6QJN","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_16","alias_value":"YBKCK6BQ6QJNMGNB","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_8","alias_value":"YBKCK6BQ","created_at":"2026-07-05T05:40:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YBKCK6BQ6QJNMGNBCX4UBFOQZ5","target":"record","payload":{"canonical_record":{"source":{"id":"2302.04496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T08:46:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"96e26b1bc33c83ece3be47dfeef40e4e1b44d5775bd29b96c655f7ce6420b7f2","abstract_canon_sha256":"de200378062d48f7779852ad0a493e9fd4a3787c37ad88c9509a4f4a067cbb3b"},"schema_version":"1.0"},"canonical_sha256":"c054257830f412d619a115f94095d0cf6c61ced14074331c0b22fac1a924d83f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:14.330883Z","signature_b64":"jbA7XIDq2bcgBrr6q7M/Y94or0aZ2uwkfoqHENBfqJKFlAYfbXoOF9YnhBJzHwDzKZTC4XNjRGj1ZE4HnbQSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c054257830f412d619a115f94095d0cf6c61ced14074331c0b22fac1a924d83f","last_reissued_at":"2026-07-05T05:40:14.330402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:14.330402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.04496","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-05T05:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhUqifdIyzv22dI+Lp+NK/f0m57twQWzVLFqfGZncQINI6Isl2ULSU5CFPhWJ8sKs3qWq7Mrl5++VSB8G5j9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:22:49.881299Z"},"content_sha256":"4c5cfbb267124377908b4e0c7278c24b3af1ad0fca29178ae4badda56bce69be","schema_version":"1.0","event_id":"sha256:4c5cfbb267124377908b4e0c7278c24b3af1ad0fca29178ae4badda56bce69be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YBKCK6BQ6QJNMGNBCX4UBFOQZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Algorithmic Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Danilo Numeroso, Davide Bacciu, Petar Veli\\v{c}kovi\\'c","submitted_at":"2023-02-09T08:46:23Z","abstract_excerpt":"Neural Algorithmic Reasoning is an emerging area of machine learning which seeks to infuse algorithmic computation in neural networks, typically by training neural models to approximate steps of classical algorithms. In this context, much of the current work has focused on learning reachability and shortest path graph algorithms, showing that joint learning on similar algorithms is beneficial for generalisation. However, when targeting more complex problems, such similar algorithms become more difficult to find. Here, we propose to learn algorithms by exploiting duality of the underlying algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04496","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/2302.04496/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:40:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0HJMZbwK7/AYpquVPMUDguFpmjxH0T5f/dSf1hYYZ89Tn4v7jXLF0Jvv6f1SP1G9gkDQp7Gg+2ICIjV1JaSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:22:49.882198Z"},"content_sha256":"4e58dff795ca6ae3b6f4777a672a2d1e669a512b8eb9ed7600ed1671be57de72","schema_version":"1.0","event_id":"sha256:4e58dff795ca6ae3b6f4777a672a2d1e669a512b8eb9ed7600ed1671be57de72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/bundle.json","state_url":"https://pith.science/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/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-04T09:22:49Z","links":{"resolver":"https://pith.science/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5","bundle":"https://pith.science/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/bundle.json","state":"https://pith.science/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBKCK6BQ6QJNMGNBCX4UBFOQZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YBKCK6BQ6QJNMGNBCX4UBFOQZ5","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":"de200378062d48f7779852ad0a493e9fd4a3787c37ad88c9509a4f4a067cbb3b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T08:46:23Z","title_canon_sha256":"96e26b1bc33c83ece3be47dfeef40e4e1b44d5775bd29b96c655f7ce6420b7f2"},"schema_version":"1.0","source":{"id":"2302.04496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04496","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04496v1","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04496","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_12","alias_value":"YBKCK6BQ6QJN","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_16","alias_value":"YBKCK6BQ6QJNMGNB","created_at":"2026-07-05T05:40:14Z"},{"alias_kind":"pith_short_8","alias_value":"YBKCK6BQ","created_at":"2026-07-05T05:40:14Z"}],"graph_snapshots":[{"event_id":"sha256:4e58dff795ca6ae3b6f4777a672a2d1e669a512b8eb9ed7600ed1671be57de72","target":"graph","created_at":"2026-07-05T05:40:14Z","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/2302.04496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural Algorithmic Reasoning is an emerging area of machine learning which seeks to infuse algorithmic computation in neural networks, typically by training neural models to approximate steps of classical algorithms. In this context, much of the current work has focused on learning reachability and shortest path graph algorithms, showing that joint learning on similar algorithms is beneficial for generalisation. However, when targeting more complex problems, such similar algorithms become more difficult to find. Here, we propose to learn algorithms by exploiting duality of the underlying algor","authors_text":"Danilo Numeroso, Davide Bacciu, Petar Veli\\v{c}kovi\\'c","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T08:46:23Z","title":"Dual Algorithmic Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04496","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:4c5cfbb267124377908b4e0c7278c24b3af1ad0fca29178ae4badda56bce69be","target":"record","created_at":"2026-07-05T05:40:14Z","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":"de200378062d48f7779852ad0a493e9fd4a3787c37ad88c9509a4f4a067cbb3b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T08:46:23Z","title_canon_sha256":"96e26b1bc33c83ece3be47dfeef40e4e1b44d5775bd29b96c655f7ce6420b7f2"},"schema_version":"1.0","source":{"id":"2302.04496","kind":"arxiv","version":1}},"canonical_sha256":"c054257830f412d619a115f94095d0cf6c61ced14074331c0b22fac1a924d83f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c054257830f412d619a115f94095d0cf6c61ced14074331c0b22fac1a924d83f","first_computed_at":"2026-07-05T05:40:14.330402Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:40:14.330402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jbA7XIDq2bcgBrr6q7M/Y94or0aZ2uwkfoqHENBfqJKFlAYfbXoOF9YnhBJzHwDzKZTC4XNjRGj1ZE4HnbQSBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:40:14.330883Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.04496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c5cfbb267124377908b4e0c7278c24b3af1ad0fca29178ae4badda56bce69be","sha256:4e58dff795ca6ae3b6f4777a672a2d1e669a512b8eb9ed7600ed1671be57de72"],"state_sha256":"2b811212e7bff78a3010c0a6a43f222193e5489bfa85373699505468205790d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mIjEfygTaj96FfZOldrg44PkJVgiOjZ4BoLgrexQFV1rQwf2hNiE/hPe/qn9xoziMbOErqlPypPOHrxkKhBdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:22:49.888241Z","bundle_sha256":"27a05e3ceeafcdbf51f16ef21d3f97218f2ff14480803efa2ebee73c3c763c60"}}