{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PHZRGB5G3VCT7VDTPLNMTENPYD","short_pith_number":"pith:PHZRGB5G","canonical_record":{"source":{"id":"1812.09902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T11:52:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34cc0187d3b677afc0d9c38f75ea8589bf77a9cbfe91b100efe597ac4389c1cb","abstract_canon_sha256":"8d388cca157b8ccd3867b96fb66abda2bc9d2db132b67948863f2e466b3bb6ed"},"schema_version":"1.0"},"canonical_sha256":"79f31307a6dd453fd4737adac991afc0ced276e5051a950522fc80c59d696fc2","source":{"kind":"arxiv","id":"1812.09902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09902","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09902v2","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09902","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"PHZRGB5G3VCT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHZRGB5G3VCT7VDT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHZRGB5G","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PHZRGB5G3VCT7VDTPLNMTENPYD","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T11:52:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"34cc0187d3b677afc0d9c38f75ea8589bf77a9cbfe91b100efe597ac4389c1cb","abstract_canon_sha256":"8d388cca157b8ccd3867b96fb66abda2bc9d2db132b67948863f2e466b3bb6ed"},"schema_version":"1.0"},"canonical_sha256":"79f31307a6dd453fd4737adac991afc0ced276e5051a950522fc80c59d696fc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:26.874929Z","signature_b64":"2DsYiH5V+m/NBund0dBXtLStEP78U1jECsKtjKG2TX1SONx5zztGFNbMftmdfhYM3KFC5LavVVJHBB0n7XOWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f31307a6dd453fd4737adac991afc0ced276e5051a950522fc80c59d696fc2","last_reissued_at":"2026-05-17T23:47:26.873911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:26.873911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09902","source_version":2,"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-17T23:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqx7Qb0iEwZR8xxpKDoGhIqNKgedNqrbm2s/MANNF1Sk0DWZ3BOnLIzvv6G7yhz/kK6j9K2ikcmaeRt0CWJCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:00.174623Z"},"content_sha256":"84bf8eae2dd08a04d5457f64323aec574a96698b99757e92e4e04688f5528494","schema_version":"1.0","event_id":"sha256:84bf8eae2dd08a04d5457f64323aec574a96698b99757e92e4e04688f5528494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PHZRGB5G3VCT7VDTPLNMTENPYD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invariant and Equivariant Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Haggai Maron, Heli Ben-Hamu, Nadav Shamir, Yaron Lipman","submitted_at":"2018-12-24T11:52:27Z","abstract_excerpt":"Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers. Although this question is answered for the first three examples (for popular transformations, at-least), a full characterization of invariant and equivariant linear layers for graphs is not known.\n  In this paper we provide a characterization of all permutation invariant and equivariant linear layers for (hyper-)graph data, and show that their dimension, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09902","kind":"arxiv","version":2},"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-17T23:47:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1u8fI5U8QTCVdgiYfQLG/oulneAA+32C1a952em9hnyGz/9aoFPpYRC+XBHbcg/6esdWH2t4Tox4U0S+W/3VCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:50:00.175008Z"},"content_sha256":"b7ac72ed7bd389df9b116b82a8ecd70f147ab5b50356d2449d0d7586b7cc93ec","schema_version":"1.0","event_id":"sha256:b7ac72ed7bd389df9b116b82a8ecd70f147ab5b50356d2449d0d7586b7cc93ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/bundle.json","state_url":"https://pith.science/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/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-30T00:50:00Z","links":{"resolver":"https://pith.science/pith/PHZRGB5G3VCT7VDTPLNMTENPYD","bundle":"https://pith.science/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/bundle.json","state":"https://pith.science/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHZRGB5G3VCT7VDTPLNMTENPYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PHZRGB5G3VCT7VDTPLNMTENPYD","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":"8d388cca157b8ccd3867b96fb66abda2bc9d2db132b67948863f2e466b3bb6ed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T11:52:27Z","title_canon_sha256":"34cc0187d3b677afc0d9c38f75ea8589bf77a9cbfe91b100efe597ac4389c1cb"},"schema_version":"1.0","source":{"id":"1812.09902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09902","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09902v2","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09902","created_at":"2026-05-17T23:47:26Z"},{"alias_kind":"pith_short_12","alias_value":"PHZRGB5G3VCT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PHZRGB5G3VCT7VDT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PHZRGB5G","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:b7ac72ed7bd389df9b116b82a8ecd70f147ab5b50356d2449d0d7586b7cc93ec","target":"graph","created_at":"2026-05-17T23:47:26Z","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":"Invariant and equivariant networks have been successfully used for learning images, sets, point clouds, and graphs. A basic challenge in developing such networks is finding the maximal collection of invariant and equivariant linear layers. Although this question is answered for the first three examples (for popular transformations, at-least), a full characterization of invariant and equivariant linear layers for graphs is not known.\n  In this paper we provide a characterization of all permutation invariant and equivariant linear layers for (hyper-)graph data, and show that their dimension, in ","authors_text":"Haggai Maron, Heli Ben-Hamu, Nadav Shamir, Yaron Lipman","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T11:52:27Z","title":"Invariant and Equivariant Graph Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09902","kind":"arxiv","version":2},"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:84bf8eae2dd08a04d5457f64323aec574a96698b99757e92e4e04688f5528494","target":"record","created_at":"2026-05-17T23:47:26Z","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":"8d388cca157b8ccd3867b96fb66abda2bc9d2db132b67948863f2e466b3bb6ed","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T11:52:27Z","title_canon_sha256":"34cc0187d3b677afc0d9c38f75ea8589bf77a9cbfe91b100efe597ac4389c1cb"},"schema_version":"1.0","source":{"id":"1812.09902","kind":"arxiv","version":2}},"canonical_sha256":"79f31307a6dd453fd4737adac991afc0ced276e5051a950522fc80c59d696fc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79f31307a6dd453fd4737adac991afc0ced276e5051a950522fc80c59d696fc2","first_computed_at":"2026-05-17T23:47:26.873911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:26.873911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2DsYiH5V+m/NBund0dBXtLStEP78U1jECsKtjKG2TX1SONx5zztGFNbMftmdfhYM3KFC5LavVVJHBB0n7XOWCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:26.874929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84bf8eae2dd08a04d5457f64323aec574a96698b99757e92e4e04688f5528494","sha256:b7ac72ed7bd389df9b116b82a8ecd70f147ab5b50356d2449d0d7586b7cc93ec"],"state_sha256":"aaa45fef162166762f250bbc9ae814d99269f9d18c0af76600cd46864b79ed16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3bMo6nMt1TxbkHndEABNqnZBN5eG1wzNtzlR49DCHf98tSnXkw7vbdcLBNNbFdQgqSJkqz8z+4bre9w3uUTBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:50:00.177779Z","bundle_sha256":"ca45898dfb6c4383d2316725407ddef60133eabc11fbdef567dfd9ae26e5adf6"}}