{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P7WAVQYJKHUJ6IMTBLTWZHX6H3","short_pith_number":"pith:P7WAVQYJ","canonical_record":{"source":{"id":"1410.3905","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CV","submitted_at":"2014-10-15T02:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"28002c82a4f58fb98e100423cbed877203089c460d40d8cf6f59bc6bd1518177","abstract_canon_sha256":"6854d123490f66be7d348323351789be97f702443ee8e0897a71d84c8fd7d803"},"schema_version":"1.0"},"canonical_sha256":"7fec0ac30951e89f21930ae76c9efe3ee208ab9b02827800c384c7cc99ae6291","source":{"kind":"arxiv","id":"1410.3905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3905","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3905v1","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3905","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"P7WAVQYJKHUJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7WAVQYJKHUJ6IMT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7WAVQYJ","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P7WAVQYJKHUJ6IMTBLTWZHX6H3","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3905","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CV","submitted_at":"2014-10-15T02:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"28002c82a4f58fb98e100423cbed877203089c460d40d8cf6f59bc6bd1518177","abstract_canon_sha256":"6854d123490f66be7d348323351789be97f702443ee8e0897a71d84c8fd7d803"},"schema_version":"1.0"},"canonical_sha256":"7fec0ac30951e89f21930ae76c9efe3ee208ab9b02827800c384c7cc99ae6291","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:03.653924Z","signature_b64":"OA+E+pyzZ9nQu6sjCux3mrRK/cK/+tPZI8p6rEABdvxqMhUB1zjvnsgbQss/PlYZ3Itre+B0qsxtbpTQ2zr7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fec0ac30951e89f21930ae76c9efe3ee208ab9b02827800c384c7cc99ae6291","last_reissued_at":"2026-05-18T02:40:03.653440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:03.653440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3905","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-18T02:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40dxrhLSO++rHcaDxurc/USa7JSNhdsEdJ48eICWsqfPpIi9BTWa8tVuyrTNO/lcX+RuFWVS3Mep1in2zBsvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:38:37.232281Z"},"content_sha256":"4358068c09de24c3ff453db4a5c746b5f286b27493cad37f002859a1a36e7063","schema_version":"1.0","event_id":"sha256:4358068c09de24c3ff453db4a5c746b5f286b27493cad37f002859a1a36e7063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P7WAVQYJKHUJ6IMTBLTWZHX6H3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Image Categorization with Sparse Fisher Vector","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Haiting Zhang, Hongya Tuo, Tao Xu, Xiankai Lu, Zheng Fang","submitted_at":"2014-10-15T02:00:29Z","abstract_excerpt":"In object recognition, Fisher vector (FV) representation is one of the state-of-art image representations ways at the expense of dense, high dimensional features and increased computation time. A simplification of FV is attractive, so we propose Sparse Fisher vector (SFV). By incorporating locality strategy, we can accelerate the Fisher coding step in image categorization which is implemented from a collective of local descriptors. Combining with pooling step, we explore the relationship between coding step and pooling step to give a theoretical explanation about SFV. Experiments on benchmark "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3905","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-18T02:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ctWAXOQzQvOtlwa6r1Z6y8zEVMwlO39Pur4YGnkl8tZOT4Owz2FAYBXA/rcDc1QZLPLqej10pOY+7Hbz36ItBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:38:37.232642Z"},"content_sha256":"657419c103982b5b1293ad83f4ffc3785dc802019f1379ab4feb81dfa05ab88c","schema_version":"1.0","event_id":"sha256:657419c103982b5b1293ad83f4ffc3785dc802019f1379ab4feb81dfa05ab88c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/bundle.json","state_url":"https://pith.science/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/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:38:37Z","links":{"resolver":"https://pith.science/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3","bundle":"https://pith.science/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/bundle.json","state":"https://pith.science/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7WAVQYJKHUJ6IMTBLTWZHX6H3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P7WAVQYJKHUJ6IMTBLTWZHX6H3","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":"6854d123490f66be7d348323351789be97f702443ee8e0897a71d84c8fd7d803","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CV","submitted_at":"2014-10-15T02:00:29Z","title_canon_sha256":"28002c82a4f58fb98e100423cbed877203089c460d40d8cf6f59bc6bd1518177"},"schema_version":"1.0","source":{"id":"1410.3905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3905","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3905v1","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3905","created_at":"2026-05-18T02:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"P7WAVQYJKHUJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7WAVQYJKHUJ6IMT","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7WAVQYJ","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:657419c103982b5b1293ad83f4ffc3785dc802019f1379ab4feb81dfa05ab88c","target":"graph","created_at":"2026-05-18T02:40:03Z","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":"In object recognition, Fisher vector (FV) representation is one of the state-of-art image representations ways at the expense of dense, high dimensional features and increased computation time. A simplification of FV is attractive, so we propose Sparse Fisher vector (SFV). By incorporating locality strategy, we can accelerate the Fisher coding step in image categorization which is implemented from a collective of local descriptors. Combining with pooling step, we explore the relationship between coding step and pooling step to give a theoretical explanation about SFV. Experiments on benchmark ","authors_text":"Haiting Zhang, Hongya Tuo, Tao Xu, Xiankai Lu, Zheng Fang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CV","submitted_at":"2014-10-15T02:00:29Z","title":"Efficient Image Categorization with Sparse Fisher Vector"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3905","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:4358068c09de24c3ff453db4a5c746b5f286b27493cad37f002859a1a36e7063","target":"record","created_at":"2026-05-18T02:40:03Z","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":"6854d123490f66be7d348323351789be97f702443ee8e0897a71d84c8fd7d803","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CV","submitted_at":"2014-10-15T02:00:29Z","title_canon_sha256":"28002c82a4f58fb98e100423cbed877203089c460d40d8cf6f59bc6bd1518177"},"schema_version":"1.0","source":{"id":"1410.3905","kind":"arxiv","version":1}},"canonical_sha256":"7fec0ac30951e89f21930ae76c9efe3ee208ab9b02827800c384c7cc99ae6291","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fec0ac30951e89f21930ae76c9efe3ee208ab9b02827800c384c7cc99ae6291","first_computed_at":"2026-05-18T02:40:03.653440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:03.653440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OA+E+pyzZ9nQu6sjCux3mrRK/cK/+tPZI8p6rEABdvxqMhUB1zjvnsgbQss/PlYZ3Itre+B0qsxtbpTQ2zr7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:03.653924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4358068c09de24c3ff453db4a5c746b5f286b27493cad37f002859a1a36e7063","sha256:657419c103982b5b1293ad83f4ffc3785dc802019f1379ab4feb81dfa05ab88c"],"state_sha256":"f4c89b42a9ec58518a5628e8b205c068f1dd0d61b60c26bd6893dc8837032351"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNFZ963FJ4hrgdD67k5A511kL0tYkTaN69iclRDOAOQ72XVEu0N1aZGhBVgjj4cr+XEJiLGqPKfhwzOdB6LHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:38:37.234591Z","bundle_sha256":"a064ded32eb4e881b9b0b3e0d0356c5e5679a87e6f1c4b5ce2229a07af5a0b00"}}