{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6OFOQRKCXEPI3HJYCPTVKRZ7VO","short_pith_number":"pith:6OFOQRKC","canonical_record":{"source":{"id":"1810.12153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T14:35:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dbdf189212c559c0c723931e1e1c6cf2da90360e370bedb045630ee841bfda52","abstract_canon_sha256":"5012dcdedbdde930ebe5b537de8098eba566326020561b62ccf891d675ce63e4"},"schema_version":"1.0"},"canonical_sha256":"f38ae84542b91e8d9d3813e755473fab9e0528fd3268f9f3b30cccf5d9f78ee1","source":{"kind":"arxiv","id":"1810.12153","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12153","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12153v1","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12153","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"6OFOQRKCXEPI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6OFOQRKCXEPI3HJY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6OFOQRKC","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6OFOQRKCXEPI3HJYCPTVKRZ7VO","target":"record","payload":{"canonical_record":{"source":{"id":"1810.12153","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T14:35:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dbdf189212c559c0c723931e1e1c6cf2da90360e370bedb045630ee841bfda52","abstract_canon_sha256":"5012dcdedbdde930ebe5b537de8098eba566326020561b62ccf891d675ce63e4"},"schema_version":"1.0"},"canonical_sha256":"f38ae84542b91e8d9d3813e755473fab9e0528fd3268f9f3b30cccf5d9f78ee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:04.129412Z","signature_b64":"sxVxtnmfDgyj6K9qkPB6yPv3+fuoxbCI+oMddSapp/trL3G8WihFT75IMs/ZxDlNj6U3NadYYlthSLrbja3jAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f38ae84542b91e8d9d3813e755473fab9e0528fd3268f9f3b30cccf5d9f78ee1","last_reissued_at":"2026-05-18T00:02:04.128799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:04.128799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.12153","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-18T00:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qt08e7JrDN9L4NGR8Qgg3sY90VdoKxNc6Kuhmm41K4PHjd8EFhQ+n33OAw2p6dTacovUiRUTMmVJRg5bFBC0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:05:52.784189Z"},"content_sha256":"58a25b0241a8fa59a0ae8d64efd18ba63394583847dab5b4a7d7de21b507bd08","schema_version":"1.0","event_id":"sha256:58a25b0241a8fa59a0ae8d64efd18ba63394583847dab5b4a7d7de21b507bd08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6OFOQRKCXEPI3HJYCPTVKRZ7VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep learning long-range information in undirected graphs with wave networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arghya Datta, Kevin Jiang, Matthew K. Matlock, Na Le Dang, S. Joshua Swamidass","submitted_at":"2018-10-29T14:35:40Z","abstract_excerpt":"Graph algorithms are key tools in many fields of science and technology. Some of these algorithms depend on propagating information between distant nodes in a graph. Recently, there have been a number of deep learning architectures proposed to learn on undirected graphs. However, most of these architectures aggregate information in the local neighborhood of a node, and therefore they may not be capable of efficiently propagating long-range information. To solve this problem we examine a recently proposed architecture, wave, which propagates information back and forth across an undirected graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12153","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":""},"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-18T00:02:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPL72IddxeAFCRse8ZNMWIvehD8FkZjZ65QXzeJVesQ+DAD3axSBOo3VL49NV4z3wzaMvTmG3mQFJ1mGzEWIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:05:52.784567Z"},"content_sha256":"6e007a207ea6a03134450590a335ec4ceb91d39021b6ccbc4d7028c7cf2c2ad1","schema_version":"1.0","event_id":"sha256:6e007a207ea6a03134450590a335ec4ceb91d39021b6ccbc4d7028c7cf2c2ad1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/bundle.json","state_url":"https://pith.science/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/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-06-01T07:05:52Z","links":{"resolver":"https://pith.science/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO","bundle":"https://pith.science/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/bundle.json","state":"https://pith.science/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OFOQRKCXEPI3HJYCPTVKRZ7VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6OFOQRKCXEPI3HJYCPTVKRZ7VO","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":"5012dcdedbdde930ebe5b537de8098eba566326020561b62ccf891d675ce63e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T14:35:40Z","title_canon_sha256":"dbdf189212c559c0c723931e1e1c6cf2da90360e370bedb045630ee841bfda52"},"schema_version":"1.0","source":{"id":"1810.12153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.12153","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"arxiv_version","alias_value":"1810.12153v1","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12153","created_at":"2026-05-18T00:02:04Z"},{"alias_kind":"pith_short_12","alias_value":"6OFOQRKCXEPI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6OFOQRKCXEPI3HJY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6OFOQRKC","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:6e007a207ea6a03134450590a335ec4ceb91d39021b6ccbc4d7028c7cf2c2ad1","target":"graph","created_at":"2026-05-18T00:02:04Z","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"},"paper":{"abstract_excerpt":"Graph algorithms are key tools in many fields of science and technology. Some of these algorithms depend on propagating information between distant nodes in a graph. Recently, there have been a number of deep learning architectures proposed to learn on undirected graphs. However, most of these architectures aggregate information in the local neighborhood of a node, and therefore they may not be capable of efficiently propagating long-range information. To solve this problem we examine a recently proposed architecture, wave, which propagates information back and forth across an undirected graph","authors_text":"Arghya Datta, Kevin Jiang, Matthew K. Matlock, Na Le Dang, S. Joshua Swamidass","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T14:35:40Z","title":"Deep learning long-range information in undirected graphs with wave networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12153","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:58a25b0241a8fa59a0ae8d64efd18ba63394583847dab5b4a7d7de21b507bd08","target":"record","created_at":"2026-05-18T00:02:04Z","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":"5012dcdedbdde930ebe5b537de8098eba566326020561b62ccf891d675ce63e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-29T14:35:40Z","title_canon_sha256":"dbdf189212c559c0c723931e1e1c6cf2da90360e370bedb045630ee841bfda52"},"schema_version":"1.0","source":{"id":"1810.12153","kind":"arxiv","version":1}},"canonical_sha256":"f38ae84542b91e8d9d3813e755473fab9e0528fd3268f9f3b30cccf5d9f78ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f38ae84542b91e8d9d3813e755473fab9e0528fd3268f9f3b30cccf5d9f78ee1","first_computed_at":"2026-05-18T00:02:04.128799Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:04.128799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sxVxtnmfDgyj6K9qkPB6yPv3+fuoxbCI+oMddSapp/trL3G8WihFT75IMs/ZxDlNj6U3NadYYlthSLrbja3jAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:04.129412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.12153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a25b0241a8fa59a0ae8d64efd18ba63394583847dab5b4a7d7de21b507bd08","sha256:6e007a207ea6a03134450590a335ec4ceb91d39021b6ccbc4d7028c7cf2c2ad1"],"state_sha256":"63d518766cdb0812df2b44ba1ce9a5a0574aae233263855a96d0607d67ce8bfd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xaT+1Fxnv0gic32TzF5yv1IInFYD8YbMRXWomgUnIZ/SGTm/ldeUIhuEYAfrA8bjHSBFIhxtnk9s7En6uBVGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:05:52.786561Z","bundle_sha256":"d18bb277444e1c31894894cfb2ba3b21cbe3d2d36a419a1a9acea83fbe6aeb3c"}}