{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R2UZQSVZ6FWHVUWWHNEZBPRKAM","short_pith_number":"pith:R2UZQSVZ","schema_version":"1.0","canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","source":{"kind":"arxiv","id":"1402.3902","version":4},"attestation_state":"computed","paper":{"title":"Sparse Polynomial Learning and Graph Sketching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Alexandros G. Dimakis, Karthikeyan Shanmugam, Murat Kocaoglu","submitted_at":"2014-02-17T06:00:16Z","abstract_excerpt":"Let $f:\\{-1,1\\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\\{-1,1\\}^n$ that runs in time polynomial in $n$ and $2s$ and succeeds if the function satisfies the unique sign property: there is one output value which corresponds to a unique set of values of the participating parities. This sufficient condition is satisfied when every coefficient of f is perturbed by a small random noise, or satisfied with high probability when s parity functions are chosen randomly or when"},"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":"1402.3902","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-17T06:00:16Z","cross_cats_sorted":[],"title_canon_sha256":"f37606878ece5382fe7a4f0e83fe36b195c3715d1f4e5aefacde36e71166d029","abstract_canon_sha256":"743b2cbe439d6e55e4c43b02cee1c79876b8108ab15106f0d1fc2158aa95a025"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:26.479482Z","signature_b64":"7cfzwRn5tp65IZxdfiO02jD6+2c2ecRJkFGJuL/2ImdjJR87iDEi8d5HIMLtH5Dr5QEmjr/cn8jeZm8qoI3+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","last_reissued_at":"2026-05-18T02:38:26.478853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:26.478853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Polynomial Learning and Graph Sketching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Klivans, Alexandros G. Dimakis, Karthikeyan Shanmugam, Murat Kocaoglu","submitted_at":"2014-02-17T06:00:16Z","abstract_excerpt":"Let $f:\\{-1,1\\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\\{-1,1\\}^n$ that runs in time polynomial in $n$ and $2s$ and succeeds if the function satisfies the unique sign property: there is one output value which corresponds to a unique set of values of the participating parities. This sufficient condition is satisfied when every coefficient of f is perturbed by a small random noise, or satisfied with high probability when s parity functions are chosen randomly or when"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3902","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.3902","created_at":"2026-05-18T02:38:26.478944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3902v4","created_at":"2026-05-18T02:38:26.478944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3902","created_at":"2026-05-18T02:38:26.478944+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2UZQSVZ6FWH","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2UZQSVZ6FWHVUWW","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2UZQSVZ","created_at":"2026-05-18T12:28:46.137349+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/R2UZQSVZ6FWHVUWWHNEZBPRKAM","json":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM.json","graph_json":"https://pith.science/api/pith-number/R2UZQSVZ6FWHVUWWHNEZBPRKAM/graph.json","events_json":"https://pith.science/api/pith-number/R2UZQSVZ6FWHVUWWHNEZBPRKAM/events.json","paper":"https://pith.science/paper/R2UZQSVZ"},"agent_actions":{"view_html":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM","download_json":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM.json","view_paper":"https://pith.science/paper/R2UZQSVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3902&json=true","fetch_graph":"https://pith.science/api/pith-number/R2UZQSVZ6FWHVUWWHNEZBPRKAM/graph.json","fetch_events":"https://pith.science/api/pith-number/R2UZQSVZ6FWHVUWWHNEZBPRKAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/action/storage_attestation","attest_author":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/action/author_attestation","sign_citation":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/action/citation_signature","submit_replication":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/action/replication_record"}},"created_at":"2026-05-18T02:38:26.478944+00:00","updated_at":"2026-05-18T02:38:26.478944+00:00"}