{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZNNULJYUNEWHRMPLUEPKY7ZBS4","short_pith_number":"pith:ZNNULJYU","canonical_record":{"source":{"id":"2012.08482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-15T18:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"dd547b199cf97cc6aa1cd3976293064870eadb3d8629c5d7449a130767965942","abstract_canon_sha256":"b9a87ed39debb9251cfb37e8a045be1ee67d094eb18efbd4f3c6e99ce5f1d6f4"},"schema_version":"1.0"},"canonical_sha256":"cb5b45a714692c78b1eba11eac7f21970904a112f0e3270e4267790ef4c6b433","source":{"kind":"arxiv","id":"2012.08482","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.08482","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"2012.08482v2","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08482","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZNNULJYUNEWH","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZNNULJYUNEWHRMPL","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZNNULJYU","created_at":"2026-07-05T02:46:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZNNULJYUNEWHRMPLUEPKY7ZBS4","target":"record","payload":{"canonical_record":{"source":{"id":"2012.08482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-15T18:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"dd547b199cf97cc6aa1cd3976293064870eadb3d8629c5d7449a130767965942","abstract_canon_sha256":"b9a87ed39debb9251cfb37e8a045be1ee67d094eb18efbd4f3c6e99ce5f1d6f4"},"schema_version":"1.0"},"canonical_sha256":"cb5b45a714692c78b1eba11eac7f21970904a112f0e3270e4267790ef4c6b433","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:11.398663Z","signature_b64":"s9wQx5uz2Tz7Ydw0t/KiUK6HOmY127w7O7QbZkOeFAM5p8ojDgVwvLwRRFxHjWekEAw6bk8FXu8aIgiU1azbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb5b45a714692c78b1eba11eac7f21970904a112f0e3270e4267790ef4c6b433","last_reissued_at":"2026-07-05T02:46:11.398183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:11.398183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.08482","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-05T02:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qea/9V2y77QjWGE1rztinkn85yZwr3K8HrFOrhBWHngHSsfHUwDHfsc7R92HV+HPGPwB1KoX+seK+4wT5EpdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:16:40.075980Z"},"content_sha256":"35be3a7a0f7e1f776717cef8d0a3055c305ec576634aba9586d002dfaeb732f9","schema_version":"1.0","event_id":"sha256:35be3a7a0f7e1f776717cef8d0a3055c305ec576634aba9586d002dfaeb732f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZNNULJYUNEWHRMPLUEPKY7ZBS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Aggregation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alessandro Tibo, Andrea Passerini, Giovanni Pellegrini, Manfred Jaeger, Paolo Frasconi","submitted_at":"2020-12-15T18:28:53Z","abstract_excerpt":"Learning on sets is increasingly gaining attention in the machine learning community, due to its widespread applicability. Typically, representations over sets are computed by using fixed aggregation functions such as sum or maximum. However, recent results showed that universal function representation by sum- (or max-) decomposition requires either highly discontinuous (and thus poorly learnable) mappings, or a latent dimension equal to the maximum number of elements in the set. To mitigate this problem, we introduce a learnable aggregation function (LAF) for sets of arbitrary cardinality. LA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08482","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/2012.08482/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-05T02:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKC8j0cYde6o3r9H2gGN6Htkl9Cd52TNBk/5qJdsG3dY/dzOBaJ/zsp7dT5q3Us1it6+QZAsanN4Vxf5DaQsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T06:16:40.076516Z"},"content_sha256":"e40196bbb56fe644f32995a301891ad4a2aae9e9a956742eef0b02ac4727040b","schema_version":"1.0","event_id":"sha256:e40196bbb56fe644f32995a301891ad4a2aae9e9a956742eef0b02ac4727040b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/bundle.json","state_url":"https://pith.science/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/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-07T06:16:40Z","links":{"resolver":"https://pith.science/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4","bundle":"https://pith.science/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/bundle.json","state":"https://pith.science/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNNULJYUNEWHRMPLUEPKY7ZBS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZNNULJYUNEWHRMPLUEPKY7ZBS4","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":"b9a87ed39debb9251cfb37e8a045be1ee67d094eb18efbd4f3c6e99ce5f1d6f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-15T18:28:53Z","title_canon_sha256":"dd547b199cf97cc6aa1cd3976293064870eadb3d8629c5d7449a130767965942"},"schema_version":"1.0","source":{"id":"2012.08482","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.08482","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"2012.08482v2","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08482","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZNNULJYUNEWH","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZNNULJYUNEWHRMPL","created_at":"2026-07-05T02:46:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZNNULJYU","created_at":"2026-07-05T02:46:11Z"}],"graph_snapshots":[{"event_id":"sha256:e40196bbb56fe644f32995a301891ad4a2aae9e9a956742eef0b02ac4727040b","target":"graph","created_at":"2026-07-05T02:46:11Z","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/2012.08482/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning on sets is increasingly gaining attention in the machine learning community, due to its widespread applicability. Typically, representations over sets are computed by using fixed aggregation functions such as sum or maximum. However, recent results showed that universal function representation by sum- (or max-) decomposition requires either highly discontinuous (and thus poorly learnable) mappings, or a latent dimension equal to the maximum number of elements in the set. To mitigate this problem, we introduce a learnable aggregation function (LAF) for sets of arbitrary cardinality. LA","authors_text":"Alessandro Tibo, Andrea Passerini, Giovanni Pellegrini, Manfred Jaeger, Paolo Frasconi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-15T18:28:53Z","title":"Learning Aggregation Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08482","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:35be3a7a0f7e1f776717cef8d0a3055c305ec576634aba9586d002dfaeb732f9","target":"record","created_at":"2026-07-05T02:46:11Z","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":"b9a87ed39debb9251cfb37e8a045be1ee67d094eb18efbd4f3c6e99ce5f1d6f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-15T18:28:53Z","title_canon_sha256":"dd547b199cf97cc6aa1cd3976293064870eadb3d8629c5d7449a130767965942"},"schema_version":"1.0","source":{"id":"2012.08482","kind":"arxiv","version":2}},"canonical_sha256":"cb5b45a714692c78b1eba11eac7f21970904a112f0e3270e4267790ef4c6b433","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb5b45a714692c78b1eba11eac7f21970904a112f0e3270e4267790ef4c6b433","first_computed_at":"2026-07-05T02:46:11.398183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:11.398183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9wQx5uz2Tz7Ydw0t/KiUK6HOmY127w7O7QbZkOeFAM5p8ojDgVwvLwRRFxHjWekEAw6bk8FXu8aIgiU1azbAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:11.398663Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.08482","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35be3a7a0f7e1f776717cef8d0a3055c305ec576634aba9586d002dfaeb732f9","sha256:e40196bbb56fe644f32995a301891ad4a2aae9e9a956742eef0b02ac4727040b"],"state_sha256":"7885a60ee80dd712c668393f6728f81bb0dbabacab2e660f22f0804d14485f33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7qyBqcHXrkySbUyctxgJtnetbvJ0fpeMMeQtfjkvEHUwge6D+SAYd3qQv2LOeu/jEHpN1+Wc150tU//rFhwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T06:16:40.082131Z","bundle_sha256":"ce144ac244820851f296a43aec8c1fd6c1c8e4864acbad17818fea065e9ff3df"}}