{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KXAR22MBSKFB7KKTTVL6TAFSEL","short_pith_number":"pith:KXAR22MB","canonical_record":{"source":{"id":"1709.03019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T00:03:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"57f21d900add955489e01898fb2c0f17f0a5f21eaacf333474421bfe8a4a6976","abstract_canon_sha256":"9436c782616dc8fa57f6e97fc19cff0f5bba4240e1ef173ba3d595689ebc99e2"},"schema_version":"1.0"},"canonical_sha256":"55c11d6981928a1fa9539d57e980b222c1829e19d012d09914fda4bf68ffaec1","source":{"kind":"arxiv","id":"1709.03019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03019","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03019v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03019","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"KXAR22MBSKFB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KXAR22MBSKFB7KKT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KXAR22MB","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KXAR22MBSKFB7KKTTVL6TAFSEL","target":"record","payload":{"canonical_record":{"source":{"id":"1709.03019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T00:03:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"57f21d900add955489e01898fb2c0f17f0a5f21eaacf333474421bfe8a4a6976","abstract_canon_sha256":"9436c782616dc8fa57f6e97fc19cff0f5bba4240e1ef173ba3d595689ebc99e2"},"schema_version":"1.0"},"canonical_sha256":"55c11d6981928a1fa9539d57e980b222c1829e19d012d09914fda4bf68ffaec1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.671552Z","signature_b64":"VHgRVbX8PDoU/0s+aWIAMBYefnN4HW2esT0Hx95JmPO+I1RnNsFx6n/i2FC+HIdf0GxuDhvZrBVgSUetSvdvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c11d6981928a1fa9539d57e980b222c1829e19d012d09914fda4bf68ffaec1","last_reissued_at":"2026-05-18T00:35:39.670846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.670846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.03019","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"km5g1Fk256Xutd0x5wgQFqQOCn30I1aUUOfjM3xdP5EftOhBWbEoAJshmmCi/nv9O9q8QgRhzUgSh8u0FkfrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:26:50.296478Z"},"content_sha256":"adcc921ff011a71370c1e5f26d3921db3354ffffa78f5f79b4da4f4393398560","schema_version":"1.0","event_id":"sha256:adcc921ff011a71370c1e5f26d3921db3354ffffa78f5f79b4da4f4393398560"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KXAR22MBSKFB7KKTTVL6TAFSEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classifying Unordered Feature Sets with Convolutional Deep Averaging Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Gardner, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic","submitted_at":"2017-09-10T00:03:37Z","abstract_excerpt":"Unordered feature sets are a nonstandard data structure that traditional neural networks are incapable of addressing in a principled manner. Providing a concatenation of features in an arbitrary order may lead to the learning of spurious patterns or biases that do not actually exist. Another complication is introduced if the number of features varies between each set. We propose convolutional deep averaging networks (CDANs) for classifying and learning representations of datasets whose instances comprise variable-size, unordered feature sets. CDANs are efficient, permutation-invariant, and cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03019","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:35:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCHGcdH55FSlALPskr0270d/kqUdiwlONML2353fQ2O+bCWX5/ZSgJoDD2rbzQGAb3UJ8L9csztcFI5M1+zfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:26:50.296873Z"},"content_sha256":"58d746d1104527a21c67bd49c5df12588f02c76251be63b4424291b00869a135","schema_version":"1.0","event_id":"sha256:58d746d1104527a21c67bd49c5df12588f02c76251be63b4424291b00869a135"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/bundle.json","state_url":"https://pith.science/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/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-28T07:26:50Z","links":{"resolver":"https://pith.science/pith/KXAR22MBSKFB7KKTTVL6TAFSEL","bundle":"https://pith.science/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/bundle.json","state":"https://pith.science/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXAR22MBSKFB7KKTTVL6TAFSEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KXAR22MBSKFB7KKTTVL6TAFSEL","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":"9436c782616dc8fa57f6e97fc19cff0f5bba4240e1ef173ba3d595689ebc99e2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T00:03:37Z","title_canon_sha256":"57f21d900add955489e01898fb2c0f17f0a5f21eaacf333474421bfe8a4a6976"},"schema_version":"1.0","source":{"id":"1709.03019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.03019","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"arxiv_version","alias_value":"1709.03019v1","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03019","created_at":"2026-05-18T00:35:39Z"},{"alias_kind":"pith_short_12","alias_value":"KXAR22MBSKFB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KXAR22MBSKFB7KKT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KXAR22MB","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:58d746d1104527a21c67bd49c5df12588f02c76251be63b4424291b00869a135","target":"graph","created_at":"2026-05-18T00:35:39Z","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":"Unordered feature sets are a nonstandard data structure that traditional neural networks are incapable of addressing in a principled manner. Providing a concatenation of features in an arbitrary order may lead to the learning of spurious patterns or biases that do not actually exist. Another complication is introduced if the number of features varies between each set. We propose convolutional deep averaging networks (CDANs) for classifying and learning representations of datasets whose instances comprise variable-size, unordered feature sets. CDANs are efficient, permutation-invariant, and cap","authors_text":"Andrew Gardner, Christian A. Duncan, Jinko Kanno, Rastko R. Selmic","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T00:03:37Z","title":"Classifying Unordered Feature Sets with Convolutional Deep Averaging Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03019","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:adcc921ff011a71370c1e5f26d3921db3354ffffa78f5f79b4da4f4393398560","target":"record","created_at":"2026-05-18T00:35:39Z","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":"9436c782616dc8fa57f6e97fc19cff0f5bba4240e1ef173ba3d595689ebc99e2","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T00:03:37Z","title_canon_sha256":"57f21d900add955489e01898fb2c0f17f0a5f21eaacf333474421bfe8a4a6976"},"schema_version":"1.0","source":{"id":"1709.03019","kind":"arxiv","version":1}},"canonical_sha256":"55c11d6981928a1fa9539d57e980b222c1829e19d012d09914fda4bf68ffaec1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c11d6981928a1fa9539d57e980b222c1829e19d012d09914fda4bf68ffaec1","first_computed_at":"2026-05-18T00:35:39.670846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:39.670846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VHgRVbX8PDoU/0s+aWIAMBYefnN4HW2esT0Hx95JmPO+I1RnNsFx6n/i2FC+HIdf0GxuDhvZrBVgSUetSvdvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:39.671552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.03019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adcc921ff011a71370c1e5f26d3921db3354ffffa78f5f79b4da4f4393398560","sha256:58d746d1104527a21c67bd49c5df12588f02c76251be63b4424291b00869a135"],"state_sha256":"9bccc41af5ecf52da8ed0d959320a6d12e8dde6a8096a4df14010058b7bdc36d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lVnVOoTBR3MkaY1472XF0jISwmiTh0Mvbssnad9AF/hSpokVcqdFMKpMBJXnTLAUjHoITfygoCZrt2HKWTkKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:26:50.298920Z","bundle_sha256":"34745bfaa1be6b16c76e530c683d404d4c4a2b893f603e142054319049a0fee7"}}