{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HUHZ6FE44CER2WJEZFI5QHUIWA","short_pith_number":"pith:HUHZ6FE4","canonical_record":{"source":{"id":"2310.03812","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T18:01:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e4043729334353596968b426e1888f71be8a6fab756877d8b249310dddbd04f","abstract_canon_sha256":"4d93a1a05f27efe5463cf9977346ec9416259bcda35f3efdce9e187263087b5d"},"schema_version":"1.0"},"canonical_sha256":"3d0f9f149ce0891d5924c951d81e88b0147bd503c615fd66f191178ffd71d10e","source":{"kind":"arxiv","id":"2310.03812","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03812","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03812v2","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03812","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUHZ6FE44CER","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_16","alias_value":"HUHZ6FE44CER2WJE","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_8","alias_value":"HUHZ6FE4","created_at":"2026-07-05T08:37:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HUHZ6FE44CER2WJEZFI5QHUIWA","target":"record","payload":{"canonical_record":{"source":{"id":"2310.03812","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T18:01:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e4043729334353596968b426e1888f71be8a6fab756877d8b249310dddbd04f","abstract_canon_sha256":"4d93a1a05f27efe5463cf9977346ec9416259bcda35f3efdce9e187263087b5d"},"schema_version":"1.0"},"canonical_sha256":"3d0f9f149ce0891d5924c951d81e88b0147bd503c615fd66f191178ffd71d10e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:49.996186Z","signature_b64":"U8cuCijN82+WA3tQq8r0Kv7XjRzGZLVadzLpTN8Q6jUpePSZEVmN0x6P+G1UFhV+Q0VRIkhl8SSeHL3KXt7FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d0f9f149ce0891d5924c951d81e88b0147bd503c615fd66f191178ffd71d10e","last_reissued_at":"2026-07-05T08:37:49.995757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:49.995757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.03812","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-07-05T08:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tg/rBK5AdqWSkonWA4V8KA8jmOwpHek+tvHObSXeRfVnEkz06ZSZIX3k0BHpNjA6Bvxanazzc3HcdW6tDMkZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:12.181626Z"},"content_sha256":"da5ce5bc644c37a123bc2ff74e869df3dd0655e49e06a42fbe8a517dcdcb4043","schema_version":"1.0","event_id":"sha256:da5ce5bc644c37a123bc2ff74e869df3dd0655e49e06a42fbe8a517dcdcb4043"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HUHZ6FE44CER2WJEZFI5QHUIWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fishnets: Information-Optimal, Scalable Aggregation for Sets and Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin D. Wandelt, Justin Alsing, T. Lucas Makinen","submitted_at":"2023-10-05T18:01:04Z","abstract_excerpt":"Set-based learning is an essential component of modern deep learning and network science. Graph Neural Networks (GNNs) and their edge-free counterparts Deepsets have proven remarkably useful on ragged and topologically challenging datasets. The key to learning informative embeddings for set members is a specified aggregation function, usually a sum, max, or mean. We propose Fishnets, an aggregation strategy for learning information-optimal embeddings for sets of data for both Bayesian inference and graph aggregation. We demonstrate that i) Fishnets neural summaries can be scaled optimally to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03812","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.03812/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-05T08:37:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4xzuxvGcXnzD6GtQvAV2D4NI1nYSnIpyh3FtV/9+4/oUT1Q5KjFd4rIeqNEtrNG7FgJ2UQ5iJ4Vn198g4FTyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T03:31:12.181919Z"},"content_sha256":"e412d1c31dfcdb190cf4dc863af09e2b7c4f8539b0accb8faeb8795fc88ac103","schema_version":"1.0","event_id":"sha256:e412d1c31dfcdb190cf4dc863af09e2b7c4f8539b0accb8faeb8795fc88ac103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/bundle.json","state_url":"https://pith.science/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/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-06T03:31:12Z","links":{"resolver":"https://pith.science/pith/HUHZ6FE44CER2WJEZFI5QHUIWA","bundle":"https://pith.science/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/bundle.json","state":"https://pith.science/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUHZ6FE44CER2WJEZFI5QHUIWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HUHZ6FE44CER2WJEZFI5QHUIWA","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":"4d93a1a05f27efe5463cf9977346ec9416259bcda35f3efdce9e187263087b5d","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T18:01:04Z","title_canon_sha256":"5e4043729334353596968b426e1888f71be8a6fab756877d8b249310dddbd04f"},"schema_version":"1.0","source":{"id":"2310.03812","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03812","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03812v2","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03812","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_12","alias_value":"HUHZ6FE44CER","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_16","alias_value":"HUHZ6FE44CER2WJE","created_at":"2026-07-05T08:37:49Z"},{"alias_kind":"pith_short_8","alias_value":"HUHZ6FE4","created_at":"2026-07-05T08:37:49Z"}],"graph_snapshots":[{"event_id":"sha256:e412d1c31dfcdb190cf4dc863af09e2b7c4f8539b0accb8faeb8795fc88ac103","target":"graph","created_at":"2026-07-05T08:37:49Z","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/2310.03812/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Set-based learning is an essential component of modern deep learning and network science. Graph Neural Networks (GNNs) and their edge-free counterparts Deepsets have proven remarkably useful on ragged and topologically challenging datasets. The key to learning informative embeddings for set members is a specified aggregation function, usually a sum, max, or mean. We propose Fishnets, an aggregation strategy for learning information-optimal embeddings for sets of data for both Bayesian inference and graph aggregation. We demonstrate that i) Fishnets neural summaries can be scaled optimally to a","authors_text":"Benjamin D. Wandelt, Justin Alsing, T. Lucas Makinen","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T18:01:04Z","title":"Fishnets: Information-Optimal, Scalable Aggregation for Sets and Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03812","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:da5ce5bc644c37a123bc2ff74e869df3dd0655e49e06a42fbe8a517dcdcb4043","target":"record","created_at":"2026-07-05T08:37:49Z","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":"4d93a1a05f27efe5463cf9977346ec9416259bcda35f3efdce9e187263087b5d","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T18:01:04Z","title_canon_sha256":"5e4043729334353596968b426e1888f71be8a6fab756877d8b249310dddbd04f"},"schema_version":"1.0","source":{"id":"2310.03812","kind":"arxiv","version":2}},"canonical_sha256":"3d0f9f149ce0891d5924c951d81e88b0147bd503c615fd66f191178ffd71d10e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d0f9f149ce0891d5924c951d81e88b0147bd503c615fd66f191178ffd71d10e","first_computed_at":"2026-07-05T08:37:49.995757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:37:49.995757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8cuCijN82+WA3tQq8r0Kv7XjRzGZLVadzLpTN8Q6jUpePSZEVmN0x6P+G1UFhV+Q0VRIkhl8SSeHL3KXt7FCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:37:49.996186Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.03812","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da5ce5bc644c37a123bc2ff74e869df3dd0655e49e06a42fbe8a517dcdcb4043","sha256:e412d1c31dfcdb190cf4dc863af09e2b7c4f8539b0accb8faeb8795fc88ac103"],"state_sha256":"0b322bc4a6db7b8cac535a606de9caba8417806b5dcfafa9109d8fe99c2662c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omv3krM/dgnfTqVZXQlx+XYun2BixGUxkTc8tytlkGLZzzLusVYPg1eSQEzRAUmdN/XO/c+zgmke3E+bx8vZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T03:31:12.185548Z","bundle_sha256":"6fd77d4af7dd46f562d32cb574915c3cd05286a1ffa2deab33bc51412db131cb"}}