{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FJXCTMDL4BV5ZFVT24FRI5I6XU","short_pith_number":"pith:FJXCTMDL","canonical_record":{"source":{"id":"2008.02465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-06T05:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"e822a9d39903bfa37decc8341b68dc2e5d071573327c4ae671a6caf1b6ba6770","abstract_canon_sha256":"124c4295ca60b5f7e92447dcad2188ecda9fee40029e73507be6a0c465bb1239"},"schema_version":"1.0"},"canonical_sha256":"2a6e29b06be06bdc96b3d70b14751ebd04a4de63f414e33de2c672a5003f54f9","source":{"kind":"arxiv","id":"2008.02465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02465","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02465v2","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02465","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"FJXCTMDL4BV5","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_16","alias_value":"FJXCTMDL4BV5ZFVT","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_8","alias_value":"FJXCTMDL","created_at":"2026-07-05T01:53:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FJXCTMDL4BV5ZFVT24FRI5I6XU","target":"record","payload":{"canonical_record":{"source":{"id":"2008.02465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-06T05:52:59Z","cross_cats_sorted":[],"title_canon_sha256":"e822a9d39903bfa37decc8341b68dc2e5d071573327c4ae671a6caf1b6ba6770","abstract_canon_sha256":"124c4295ca60b5f7e92447dcad2188ecda9fee40029e73507be6a0c465bb1239"},"schema_version":"1.0"},"canonical_sha256":"2a6e29b06be06bdc96b3d70b14751ebd04a4de63f414e33de2c672a5003f54f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:53:21.553806Z","signature_b64":"yCm6n0nwj51uq84sHU7dvFuaxUqUNh3QtHTsae64d1wRTpssP/AfbRQoOxqyEYZivoj+XtYjX09Sfu4zLbvlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6e29b06be06bdc96b3d70b14751ebd04a4de63f414e33de2c672a5003f54f9","last_reissued_at":"2026-07-05T01:53:21.553304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:53:21.553304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.02465","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-05T01:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9GhIu/WI2LfAy/HSWL6izWsIpOH4Fp0ZjSMzbHw+Ks+cSydVeK7r94gS9rBFf3lGQConPx57skk60uFqp2RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:22:24.280380Z"},"content_sha256":"db227ca4873fec2e9672ce5cb1817da5e1a0c307fa6a637728a4695e902af825","schema_version":"1.0","event_id":"sha256:db227ca4873fec2e9672ce5cb1817da5e1a0c307fa6a637728a4695e902af825"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FJXCTMDL4BV5ZFVT24FRI5I6XU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Few-shot Classification via Adaptive Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bingyi Kang, Jiashi Feng, Kuangqi Zhou, Zihang Jiang","submitted_at":"2020-08-06T05:52:59Z","abstract_excerpt":"Training a neural network model that can quickly adapt to a new task is highly desirable yet challenging for few-shot learning problems. Recent few-shot learning methods mostly concentrate on developing various meta-learning strategies from two aspects, namely optimizing an initial model or learning a distance metric. In this work, we propose a novel few-shot learning method via optimizing and fast adapting the query sample representation based on very few reference samples. To be specific, we devise a simple and efficient meta-reweighting strategy to adapt the sample representations and gener"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02465","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/2008.02465/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-05T01:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQKbhj0mrtIDlu/RQleELAbPnwsFYhQZnM1rKZ2SWJlcp2z0vqQ9C4YYgG8Jvk7C5hVdxUFeeXveqkjmI6AHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:22:24.280746Z"},"content_sha256":"ad27437b8fc49e4e5692ce672b4bf90efd517c0b3fac9dc80723e140116c3803","schema_version":"1.0","event_id":"sha256:ad27437b8fc49e4e5692ce672b4bf90efd517c0b3fac9dc80723e140116c3803"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/bundle.json","state_url":"https://pith.science/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/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-07-06T19:22:24Z","links":{"resolver":"https://pith.science/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU","bundle":"https://pith.science/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/bundle.json","state":"https://pith.science/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJXCTMDL4BV5ZFVT24FRI5I6XU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FJXCTMDL4BV5ZFVT24FRI5I6XU","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":"124c4295ca60b5f7e92447dcad2188ecda9fee40029e73507be6a0c465bb1239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-06T05:52:59Z","title_canon_sha256":"e822a9d39903bfa37decc8341b68dc2e5d071573327c4ae671a6caf1b6ba6770"},"schema_version":"1.0","source":{"id":"2008.02465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02465","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02465v2","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02465","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"FJXCTMDL4BV5","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_16","alias_value":"FJXCTMDL4BV5ZFVT","created_at":"2026-07-05T01:53:21Z"},{"alias_kind":"pith_short_8","alias_value":"FJXCTMDL","created_at":"2026-07-05T01:53:21Z"}],"graph_snapshots":[{"event_id":"sha256:ad27437b8fc49e4e5692ce672b4bf90efd517c0b3fac9dc80723e140116c3803","target":"graph","created_at":"2026-07-05T01:53:21Z","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/2008.02465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Training a neural network model that can quickly adapt to a new task is highly desirable yet challenging for few-shot learning problems. Recent few-shot learning methods mostly concentrate on developing various meta-learning strategies from two aspects, namely optimizing an initial model or learning a distance metric. In this work, we propose a novel few-shot learning method via optimizing and fast adapting the query sample representation based on very few reference samples. To be specific, we devise a simple and efficient meta-reweighting strategy to adapt the sample representations and gener","authors_text":"Bingyi Kang, Jiashi Feng, Kuangqi Zhou, Zihang Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-06T05:52:59Z","title":"Few-shot Classification via Adaptive Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02465","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:db227ca4873fec2e9672ce5cb1817da5e1a0c307fa6a637728a4695e902af825","target":"record","created_at":"2026-07-05T01:53:21Z","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":"124c4295ca60b5f7e92447dcad2188ecda9fee40029e73507be6a0c465bb1239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-08-06T05:52:59Z","title_canon_sha256":"e822a9d39903bfa37decc8341b68dc2e5d071573327c4ae671a6caf1b6ba6770"},"schema_version":"1.0","source":{"id":"2008.02465","kind":"arxiv","version":2}},"canonical_sha256":"2a6e29b06be06bdc96b3d70b14751ebd04a4de63f414e33de2c672a5003f54f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a6e29b06be06bdc96b3d70b14751ebd04a4de63f414e33de2c672a5003f54f9","first_computed_at":"2026-07-05T01:53:21.553304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:53:21.553304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yCm6n0nwj51uq84sHU7dvFuaxUqUNh3QtHTsae64d1wRTpssP/AfbRQoOxqyEYZivoj+XtYjX09Sfu4zLbvlDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:53:21.553806Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02465","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db227ca4873fec2e9672ce5cb1817da5e1a0c307fa6a637728a4695e902af825","sha256:ad27437b8fc49e4e5692ce672b4bf90efd517c0b3fac9dc80723e140116c3803"],"state_sha256":"a19de5b8278d81511b66dc55a2f166cd5abe028f4b8175cfe2e477efc94d0d09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9vLFQt6+IPW0B69BwGa0HZyiMgt2a7zkWp8+k0Y4iY22OfjSO3NwvRQxbmokq8Me6YfbSvgo0jHcIx+uI3jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:22:24.282662Z","bundle_sha256":"eae4750c81859a4655acb882147875abfec6840fd84b99f86bbce78b2e772509"}}