{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TC7DQRHE6YLTW2D6CIMRRAKPSK","short_pith_number":"pith:TC7DQRHE","canonical_record":{"source":{"id":"1710.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-20T07:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"ed42c28b480c813774b7f87b06a4f78e3942c7420b391937fc399c9a4018c354","abstract_canon_sha256":"7a1a6deeeb1f05e05c99eb9fc232d62657ac10520b3a12c3273687385944d9e5"},"schema_version":"1.0"},"canonical_sha256":"98be3844e4f6173b687e121918814f92ba1bd5072279e0acd053cad41cc8a12d","source":{"kind":"arxiv","id":"1710.07435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07435","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07435v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07435","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"TC7DQRHE6YLT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TC7DQRHE6YLTW2D6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TC7DQRHE","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TC7DQRHE6YLTW2D6CIMRRAKPSK","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-20T07:19:32Z","cross_cats_sorted":[],"title_canon_sha256":"ed42c28b480c813774b7f87b06a4f78e3942c7420b391937fc399c9a4018c354","abstract_canon_sha256":"7a1a6deeeb1f05e05c99eb9fc232d62657ac10520b3a12c3273687385944d9e5"},"schema_version":"1.0"},"canonical_sha256":"98be3844e4f6173b687e121918814f92ba1bd5072279e0acd053cad41cc8a12d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:24.803342Z","signature_b64":"XxFaU/B5B0Ik46dxrXM/cX4FN8IWDVgNq/mW1tHqWAqWlc85xMvDmD1QHXhibp5jljbdKVuaRNQFgDN/OuzaDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98be3844e4f6173b687e121918814f92ba1bd5072279e0acd053cad41cc8a12d","last_reissued_at":"2026-05-18T00:32:24.802722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:24.802722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07435","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:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hdlCMgaopYPncnKgpX3bognEY20qvj2y5mb2twyHg9y92Xge48Rq29m7mcTNmvslcESSCV2vl3fShS3/9gPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:36.111842Z"},"content_sha256":"d9bdffa7f43aa9e4e99d4f5bbcac204a2cbc2c08ad174300df45d4abcf96edb4","schema_version":"1.0","event_id":"sha256:d9bdffa7f43aa9e4e99d4f5bbcac204a2cbc2c08ad174300df45d4abcf96edb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TC7DQRHE6YLTW2D6CIMRRAKPSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multipartite Pooling for Deep Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arash Shahriari, Fatih Porikli","submitted_at":"2017-10-20T07:19:32Z","abstract_excerpt":"We propose a novel pooling strategy that learns how to adaptively rank deep convolutional features for selecting more informative representations. To this end, we exploit discriminative analysis to project the features onto a space spanned by the number of classes in the dataset under study. This maps the notion of labels in the feature space into instances in the projected space. We employ these projected distances as a measure to rank the existing features with respect to their specific discriminant power for each individual class. We then apply multipartite ranking to score the separability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07435","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:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNTSrJBpR8B1waEll802SJ8Obdl1gcDJUvKeCl6uwJE4wLLNizMwY+nuMHu5ZPQr5LdZh1EVDCNo4dZr0B/nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:36.112186Z"},"content_sha256":"3f7bb092104fd80b419360b5b4b74efce9c266202b635f60014ff77ed61e610d","schema_version":"1.0","event_id":"sha256:3f7bb092104fd80b419360b5b4b74efce9c266202b635f60014ff77ed61e610d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/bundle.json","state_url":"https://pith.science/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/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-04T00:29:36Z","links":{"resolver":"https://pith.science/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK","bundle":"https://pith.science/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/bundle.json","state":"https://pith.science/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TC7DQRHE6YLTW2D6CIMRRAKPSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TC7DQRHE6YLTW2D6CIMRRAKPSK","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":"7a1a6deeeb1f05e05c99eb9fc232d62657ac10520b3a12c3273687385944d9e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-20T07:19:32Z","title_canon_sha256":"ed42c28b480c813774b7f87b06a4f78e3942c7420b391937fc399c9a4018c354"},"schema_version":"1.0","source":{"id":"1710.07435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07435","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07435v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07435","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"TC7DQRHE6YLT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TC7DQRHE6YLTW2D6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TC7DQRHE","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:3f7bb092104fd80b419360b5b4b74efce9c266202b635f60014ff77ed61e610d","target":"graph","created_at":"2026-05-18T00:32:24Z","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":"We propose a novel pooling strategy that learns how to adaptively rank deep convolutional features for selecting more informative representations. To this end, we exploit discriminative analysis to project the features onto a space spanned by the number of classes in the dataset under study. This maps the notion of labels in the feature space into instances in the projected space. We employ these projected distances as a measure to rank the existing features with respect to their specific discriminant power for each individual class. We then apply multipartite ranking to score the separability","authors_text":"Arash Shahriari, Fatih Porikli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-20T07:19:32Z","title":"Multipartite Pooling for Deep Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07435","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:d9bdffa7f43aa9e4e99d4f5bbcac204a2cbc2c08ad174300df45d4abcf96edb4","target":"record","created_at":"2026-05-18T00:32:24Z","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":"7a1a6deeeb1f05e05c99eb9fc232d62657ac10520b3a12c3273687385944d9e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-20T07:19:32Z","title_canon_sha256":"ed42c28b480c813774b7f87b06a4f78e3942c7420b391937fc399c9a4018c354"},"schema_version":"1.0","source":{"id":"1710.07435","kind":"arxiv","version":1}},"canonical_sha256":"98be3844e4f6173b687e121918814f92ba1bd5072279e0acd053cad41cc8a12d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98be3844e4f6173b687e121918814f92ba1bd5072279e0acd053cad41cc8a12d","first_computed_at":"2026-05-18T00:32:24.802722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:24.802722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XxFaU/B5B0Ik46dxrXM/cX4FN8IWDVgNq/mW1tHqWAqWlc85xMvDmD1QHXhibp5jljbdKVuaRNQFgDN/OuzaDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:24.803342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9bdffa7f43aa9e4e99d4f5bbcac204a2cbc2c08ad174300df45d4abcf96edb4","sha256:3f7bb092104fd80b419360b5b4b74efce9c266202b635f60014ff77ed61e610d"],"state_sha256":"a73b605d1c828cd85cce768fba7e194dbf611fbcc1d5e4c6753767cc32c10889"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZ/yGAdE1n7o7gyl3TqkwMAdYNl0FHwBWfCsUXYlLBrU3k+fZYgfmN5n9qI4VV8UaUJUenXrvzKKOy4KT1t3Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:29:36.114164Z","bundle_sha256":"12d5cf3264c1e36d2b5475fe5fb20aea3e5465e0f7e6fe962ba284a488f3bb8e"}}