{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RBRMNXYQRQQAL4VYNRNFITF3HD","short_pith_number":"pith:RBRMNXYQ","schema_version":"1.0","canonical_sha256":"8862c6df108c2005f2b86c5a544cbb38f51319631e4d058073a59ea838a1d026","source":{"kind":"arxiv","id":"2102.07077","version":1},"attestation_state":"computed","paper":{"title":"Model-Agnostic Graph Regularization for Few-Shot Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ethan Shen, Jiaqi Zhai, Jure Leskovec, Manzil Zaheer, Maria Brbic, Nicholas Monath","submitted_at":"2021-02-14T05:28:13Z","abstract_excerpt":"In many domains, relationships between categories are encoded in the knowledge graph. Recently, promising results have been achieved by incorporating knowledge graph as side information in hard classification tasks with severely limited data. However, prior models consist of highly complex architectures with many sub-components that all seem to impact performance. In this paper, we present a comprehensive empirical study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.07077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-14T05:28:13Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"440b9980363f7a40cc08eabfc09c0141f2d6ac1c68f470effd48b7ed15764936","abstract_canon_sha256":"dc2af8b614b69bf61d743372df101a7f1eba436f9eb43f1d5c31868ca161016f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:01.121099Z","signature_b64":"TtdVqp5TGwqfC9ftRM0fJ0g8iMcDNP5ONJ2kYiN00FY7+9UuwqCFGw/k8YYirrqtA/cVV6s57kLVPHe8/UECCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8862c6df108c2005f2b86c5a544cbb38f51319631e4d058073a59ea838a1d026","last_reissued_at":"2026-07-05T02:15:01.120698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:01.120698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Agnostic Graph Regularization for Few-Shot Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Ethan Shen, Jiaqi Zhai, Jure Leskovec, Manzil Zaheer, Maria Brbic, Nicholas Monath","submitted_at":"2021-02-14T05:28:13Z","abstract_excerpt":"In many domains, relationships between categories are encoded in the knowledge graph. Recently, promising results have been achieved by incorporating knowledge graph as side information in hard classification tasks with severely limited data. However, prior models consist of highly complex architectures with many sub-components that all seem to impact performance. In this paper, we present a comprehensive empirical study on graph embedded few-shot learning. We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07077","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.07077/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.07077","created_at":"2026-07-05T02:15:01.120760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07077v1","created_at":"2026-07-05T02:15:01.120760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07077","created_at":"2026-07-05T02:15:01.120760+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBRMNXYQRQQA","created_at":"2026-07-05T02:15:01.120760+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBRMNXYQRQQAL4VY","created_at":"2026-07-05T02:15:01.120760+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBRMNXYQ","created_at":"2026-07-05T02:15:01.120760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD","json":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD.json","graph_json":"https://pith.science/api/pith-number/RBRMNXYQRQQAL4VYNRNFITF3HD/graph.json","events_json":"https://pith.science/api/pith-number/RBRMNXYQRQQAL4VYNRNFITF3HD/events.json","paper":"https://pith.science/paper/RBRMNXYQ"},"agent_actions":{"view_html":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD","download_json":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD.json","view_paper":"https://pith.science/paper/RBRMNXYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07077&json=true","fetch_graph":"https://pith.science/api/pith-number/RBRMNXYQRQQAL4VYNRNFITF3HD/graph.json","fetch_events":"https://pith.science/api/pith-number/RBRMNXYQRQQAL4VYNRNFITF3HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD/action/storage_attestation","attest_author":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD/action/author_attestation","sign_citation":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD/action/citation_signature","submit_replication":"https://pith.science/pith/RBRMNXYQRQQAL4VYNRNFITF3HD/action/replication_record"}},"created_at":"2026-07-05T02:15:01.120760+00:00","updated_at":"2026-07-05T02:15:01.120760+00:00"}