{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AGXPOBNDUDUUSPPMHXFK5RBYWX","short_pith_number":"pith:AGXPOBND","schema_version":"1.0","canonical_sha256":"01aef705a3a0e9493dec3dcaaec438b5ea86f318ea216f558d16aa1882750362","source":{"kind":"arxiv","id":"2202.03349","version":16},"attestation_state":"computed","paper":{"title":"Conditional Gradients for the Approximate Vanishing Ideal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elias Wirth, Sebastian Pokutta","submitted_at":"2022-02-07T16:48:49Z","abstract_excerpt":"The vanishing ideal of a set of points $X\\subseteq \\mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\\mathbf{x} \\in X$ and admits an efficient representation by a finite set of polynomials called generators. To accommodate the noise in the data set, we introduce the pairwise conditional gradients approximate vanishing ideal algorithm (PCGAVI) that constructs a set of generators of the approximate vanishing ideal. The constructed generators capture polynomial structures in data and give rise to a feature map that can, for example, be used in combination with a linear"},"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":"2202.03349","kind":"arxiv","version":16},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-07T16:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"8ba3c77842c31971f85497e28aae34ad559c0e2b2ecfa780a3e236dbcea7d99a","abstract_canon_sha256":"486db6db9ffe1060bec55070c6ea2a217b9327dc4236953aa5a852003421b271"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:50.877404Z","signature_b64":"PfsTesZYYXIPxUZ+6scTep69WnUYRRmgfyxr/sZN3Jm3TrmmgTU3zqKIO0hHezfH5nuq2BpMCXts7xusnSSzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01aef705a3a0e9493dec3dcaaec438b5ea86f318ea216f558d16aa1882750362","last_reissued_at":"2026-07-05T07:44:50.877021Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:50.877021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Gradients for the Approximate Vanishing Ideal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elias Wirth, Sebastian Pokutta","submitted_at":"2022-02-07T16:48:49Z","abstract_excerpt":"The vanishing ideal of a set of points $X\\subseteq \\mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\\mathbf{x} \\in X$ and admits an efficient representation by a finite set of polynomials called generators. To accommodate the noise in the data set, we introduce the pairwise conditional gradients approximate vanishing ideal algorithm (PCGAVI) that constructs a set of generators of the approximate vanishing ideal. The constructed generators capture polynomial structures in data and give rise to a feature map that can, for example, be used in combination with a linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03349","kind":"arxiv","version":16},"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/2202.03349/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":"2202.03349","created_at":"2026-07-05T07:44:50.877078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.03349v16","created_at":"2026-07-05T07:44:50.877078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03349","created_at":"2026-07-05T07:44:50.877078+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGXPOBNDUDUU","created_at":"2026-07-05T07:44:50.877078+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGXPOBNDUDUUSPPM","created_at":"2026-07-05T07:44:50.877078+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGXPOBND","created_at":"2026-07-05T07:44:50.877078+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/AGXPOBNDUDUUSPPMHXFK5RBYWX","json":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX.json","graph_json":"https://pith.science/api/pith-number/AGXPOBNDUDUUSPPMHXFK5RBYWX/graph.json","events_json":"https://pith.science/api/pith-number/AGXPOBNDUDUUSPPMHXFK5RBYWX/events.json","paper":"https://pith.science/paper/AGXPOBND"},"agent_actions":{"view_html":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX","download_json":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX.json","view_paper":"https://pith.science/paper/AGXPOBND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.03349&json=true","fetch_graph":"https://pith.science/api/pith-number/AGXPOBNDUDUUSPPMHXFK5RBYWX/graph.json","fetch_events":"https://pith.science/api/pith-number/AGXPOBNDUDUUSPPMHXFK5RBYWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX/action/storage_attestation","attest_author":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX/action/author_attestation","sign_citation":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX/action/citation_signature","submit_replication":"https://pith.science/pith/AGXPOBNDUDUUSPPMHXFK5RBYWX/action/replication_record"}},"created_at":"2026-07-05T07:44:50.877078+00:00","updated_at":"2026-07-05T07:44:50.877078+00:00"}