{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R2UZQSVZ6FWHVUWWHNEZBPRKAM","short_pith_number":"pith:R2UZQSVZ","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"},"canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","source":{"kind":"arxiv","id":"1402.3902","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3902","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3902v4","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3902","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"R2UZQSVZ6FWH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R2UZQSVZ6FWHVUWW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R2UZQSVZ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R2UZQSVZ6FWHVUWWHNEZBPRKAM","target":"record","payload":{"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"},"canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","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"},"source_kind":"arxiv","source_id":"1402.3902","source_version":4,"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:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lZWpl25jmHIhdLkaj3UNAp0QsjzjZAZ9+KTC/Qv0bWGYdjxkDZ9qEUcDUlywakOOKSknKjs4fjV+56F6I6ssBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:36:08.463904Z"},"content_sha256":"c0fe482b6ab121bebb4116421cce675056818e4da46790168c1af5b70e507138","schema_version":"1.0","event_id":"sha256:c0fe482b6ab121bebb4116421cce675056818e4da46790168c1af5b70e507138"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R2UZQSVZ6FWHVUWWHNEZBPRKAM","target":"graph","payload":{"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"},"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:38:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWqFfUj0hM+695iRhzJxABmtmwxrPqx0GSRsPzIRML7fTQA9oaYnVli1L7NHUpVQYC2qp4uuw9/urS3UevyRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:36:08.464606Z"},"content_sha256":"e51724eb7c3857b33b52b72a15621fc72561984266f74a849fa884c9fc642ba6","schema_version":"1.0","event_id":"sha256:e51724eb7c3857b33b52b72a15621fc72561984266f74a849fa884c9fc642ba6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/bundle.json","state_url":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/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-20T23:36:08Z","links":{"resolver":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM","bundle":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/bundle.json","state":"https://pith.science/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2UZQSVZ6FWHVUWWHNEZBPRKAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R2UZQSVZ6FWHVUWWHNEZBPRKAM","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":"743b2cbe439d6e55e4c43b02cee1c79876b8108ab15106f0d1fc2158aa95a025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-17T06:00:16Z","title_canon_sha256":"f37606878ece5382fe7a4f0e83fe36b195c3715d1f4e5aefacde36e71166d029"},"schema_version":"1.0","source":{"id":"1402.3902","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3902","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3902v4","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3902","created_at":"2026-05-18T02:38:26Z"},{"alias_kind":"pith_short_12","alias_value":"R2UZQSVZ6FWH","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R2UZQSVZ6FWHVUWW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R2UZQSVZ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:e51724eb7c3857b33b52b72a15621fc72561984266f74a849fa884c9fc642ba6","target":"graph","created_at":"2026-05-18T02:38:26Z","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":"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","authors_text":"Adam Klivans, Alexandros G. Dimakis, Karthikeyan Shanmugam, Murat Kocaoglu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-17T06:00:16Z","title":"Sparse Polynomial Learning and Graph Sketching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3902","kind":"arxiv","version":4},"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:c0fe482b6ab121bebb4116421cce675056818e4da46790168c1af5b70e507138","target":"record","created_at":"2026-05-18T02:38:26Z","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":"743b2cbe439d6e55e4c43b02cee1c79876b8108ab15106f0d1fc2158aa95a025","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-17T06:00:16Z","title_canon_sha256":"f37606878ece5382fe7a4f0e83fe36b195c3715d1f4e5aefacde36e71166d029"},"schema_version":"1.0","source":{"id":"1402.3902","kind":"arxiv","version":4}},"canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea9984ab9f16c7ad2d63b4990be2a0313298a97de0d859278ddb57297f382f0","first_computed_at":"2026-05-18T02:38:26.478853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:26.478853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7cfzwRn5tp65IZxdfiO02jD6+2c2ecRJkFGJuL/2ImdjJR87iDEi8d5HIMLtH5Dr5QEmjr/cn8jeZm8qoI3+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:26.479482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3902","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0fe482b6ab121bebb4116421cce675056818e4da46790168c1af5b70e507138","sha256:e51724eb7c3857b33b52b72a15621fc72561984266f74a849fa884c9fc642ba6"],"state_sha256":"5ec02864ee6aec06e8e79675615401087c8627cdd9a302d9ce6babbe70803bd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h+DpnJh02hfixqtlTdFZT/WHyats2rZxmPxA1uOzwIDvktJfbNLIB7eGINda+0Z6UnhtgqAYbGFQ6ytT36cTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T23:36:08.469204Z","bundle_sha256":"b622f1821865fc52886140b0f48c7ad2c67e04121d98b65f0bb4a9fd2bf525aa"}}