{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BKBUWXNCPENJCMUGVIQ5IRDQB6","short_pith_number":"pith:BKBUWXNC","canonical_record":{"source":{"id":"2312.05611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T16:46:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa03536859f0a601f27a7b64c695875d6803c660e9218c247de21370be39a7f2","abstract_canon_sha256":"0d530b5e1d7e214801acfe056d73d4c89829f2cfdcaa37f6b92b3115ca391b65"},"schema_version":"1.0"},"canonical_sha256":"0a834b5da2791a913286aa21d444700f9dd51c198b91e46636e31556426ee53d","source":{"kind":"arxiv","id":"2312.05611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.05611","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"2312.05611v1","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05611","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"BKBUWXNCPENJ","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_16","alias_value":"BKBUWXNCPENJCMUG","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_8","alias_value":"BKBUWXNC","created_at":"2026-07-05T07:22:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BKBUWXNCPENJCMUGVIQ5IRDQB6","target":"record","payload":{"canonical_record":{"source":{"id":"2312.05611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T16:46:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"aa03536859f0a601f27a7b64c695875d6803c660e9218c247de21370be39a7f2","abstract_canon_sha256":"0d530b5e1d7e214801acfe056d73d4c89829f2cfdcaa37f6b92b3115ca391b65"},"schema_version":"1.0"},"canonical_sha256":"0a834b5da2791a913286aa21d444700f9dd51c198b91e46636e31556426ee53d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:29.689781Z","signature_b64":"t/21/2o9LnmhDpqDCo4cA6Y96SHJpc4DNxYT/XCBJmyt7PiMM4VAWu+n1UZ8e4YxT9L+B628GocAsRgrwRozBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a834b5da2791a913286aa21d444700f9dd51c198b91e46636e31556426ee53d","last_reissued_at":"2026-07-05T07:22:29.689308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:29.689308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.05611","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-05T07:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ake8gfvDWxlOH44kWppcp97B6dZmk2yZCW9VI1Kon1bWYir7dIyLWGu6PQH2AK6wtgrPo+VrjX16faVf3V1TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:23:32.174657Z"},"content_sha256":"3b05be086b754aa3a29549d68f5ea5b2ae8b307e56893393e18822c810894a0f","schema_version":"1.0","event_id":"sha256:3b05be086b754aa3a29549d68f5ea5b2ae8b307e56893393e18822c810894a0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BKBUWXNCPENJCMUGVIQ5IRDQB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Triplet Edge Attention for Algorithmic Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Sungsoo Ahn, Yeonjoon Jung","submitted_at":"2023-12-09T16:46:28Z","abstract_excerpt":"This work investigates neural algorithmic reasoning to develop neural networks capable of learning from classical algorithms. The main challenge is to develop graph neural networks that are expressive enough to predict the given algorithm outputs while generalizing well to out-of-distribution data. In this work, we introduce a new graph neural network layer called Triplet Edge Attention (TEA), an edge-aware graph attention layer. Our algorithm works by precisely computing edge latent, aggregating multiple triplet messages using edge-based attention. We empirically validate our TEA layer in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05611","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/2312.05611/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-05T07:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xf/5FuLjQ8+KdRU5RpdhZsNEqovOBFm8a8dBoJ6UTgpr+AIrh2D7qLyq85gkQ+dlslh9UbWK3LiU5TJXzw7iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T14:23:32.175158Z"},"content_sha256":"b7ef0cf033cae6208ef1ab337858e983ad82965fc7d6e96c2c340a76b03b4c70","schema_version":"1.0","event_id":"sha256:b7ef0cf033cae6208ef1ab337858e983ad82965fc7d6e96c2c340a76b03b4c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/bundle.json","state_url":"https://pith.science/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/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-10T14:23:32Z","links":{"resolver":"https://pith.science/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6","bundle":"https://pith.science/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/bundle.json","state":"https://pith.science/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKBUWXNCPENJCMUGVIQ5IRDQB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BKBUWXNCPENJCMUGVIQ5IRDQB6","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":"0d530b5e1d7e214801acfe056d73d4c89829f2cfdcaa37f6b92b3115ca391b65","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T16:46:28Z","title_canon_sha256":"aa03536859f0a601f27a7b64c695875d6803c660e9218c247de21370be39a7f2"},"schema_version":"1.0","source":{"id":"2312.05611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.05611","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"2312.05611v1","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05611","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"BKBUWXNCPENJ","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_16","alias_value":"BKBUWXNCPENJCMUG","created_at":"2026-07-05T07:22:29Z"},{"alias_kind":"pith_short_8","alias_value":"BKBUWXNC","created_at":"2026-07-05T07:22:29Z"}],"graph_snapshots":[{"event_id":"sha256:b7ef0cf033cae6208ef1ab337858e983ad82965fc7d6e96c2c340a76b03b4c70","target":"graph","created_at":"2026-07-05T07:22:29Z","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/2312.05611/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work investigates neural algorithmic reasoning to develop neural networks capable of learning from classical algorithms. The main challenge is to develop graph neural networks that are expressive enough to predict the given algorithm outputs while generalizing well to out-of-distribution data. In this work, we introduce a new graph neural network layer called Triplet Edge Attention (TEA), an edge-aware graph attention layer. Our algorithm works by precisely computing edge latent, aggregating multiple triplet messages using edge-based attention. We empirically validate our TEA layer in the","authors_text":"Sungsoo Ahn, Yeonjoon Jung","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T16:46:28Z","title":"Triplet Edge Attention for Algorithmic Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05611","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:3b05be086b754aa3a29549d68f5ea5b2ae8b307e56893393e18822c810894a0f","target":"record","created_at":"2026-07-05T07:22:29Z","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":"0d530b5e1d7e214801acfe056d73d4c89829f2cfdcaa37f6b92b3115ca391b65","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T16:46:28Z","title_canon_sha256":"aa03536859f0a601f27a7b64c695875d6803c660e9218c247de21370be39a7f2"},"schema_version":"1.0","source":{"id":"2312.05611","kind":"arxiv","version":1}},"canonical_sha256":"0a834b5da2791a913286aa21d444700f9dd51c198b91e46636e31556426ee53d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a834b5da2791a913286aa21d444700f9dd51c198b91e46636e31556426ee53d","first_computed_at":"2026-07-05T07:22:29.689308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:22:29.689308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/21/2o9LnmhDpqDCo4cA6Y96SHJpc4DNxYT/XCBJmyt7PiMM4VAWu+n1UZ8e4YxT9L+B628GocAsRgrwRozBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:22:29.689781Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.05611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b05be086b754aa3a29549d68f5ea5b2ae8b307e56893393e18822c810894a0f","sha256:b7ef0cf033cae6208ef1ab337858e983ad82965fc7d6e96c2c340a76b03b4c70"],"state_sha256":"dd79c831f9989c5644f4dc8bd72cc5f2af59474ed116a6e91d333ca80bafc62b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s7ZiZQE3JA+E9PwrdFjaTMB9pKJJt8noud2HDv5hHiaMNt3tq3wU6O3bYLrzbJSqQz8xWLreGrm/RiF1t6F0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T14:23:32.179248Z","bundle_sha256":"c11d93dbd13f8498d9ce2bcc91dc74a25933db5edd5bc9f23daddfbb16658748"}}