{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W4CJV7WNNGCEVBL5CXZF5EDUM3","short_pith_number":"pith:W4CJV7WN","canonical_record":{"source":{"id":"1607.03938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T21:31:56Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"e172e133e1d7ab5d0cc6294e99230ee2843cb0fcc238d8668a2feb3b5ede6e6f","abstract_canon_sha256":"bb73b2ff488dc1737d951903ecfd72e24fcbfd83e913da0cf087fb8f185ec966"},"schema_version":"1.0"},"canonical_sha256":"b7049afecd69844a857d15f25e907466fb1693a9bd70b44ed464f0ac0d360453","source":{"kind":"arxiv","id":"1607.03938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03938","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03938v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03938","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"W4CJV7WNNGCE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W4CJV7WNNGCEVBL5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W4CJV7WN","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W4CJV7WNNGCEVBL5CXZF5EDUM3","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T21:31:56Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"e172e133e1d7ab5d0cc6294e99230ee2843cb0fcc238d8668a2feb3b5ede6e6f","abstract_canon_sha256":"bb73b2ff488dc1737d951903ecfd72e24fcbfd83e913da0cf087fb8f185ec966"},"schema_version":"1.0"},"canonical_sha256":"b7049afecd69844a857d15f25e907466fb1693a9bd70b44ed464f0ac0d360453","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:19.164108Z","signature_b64":"rMh/FRNEQ/1XT7My0nAOU5a6OhKMDTqPlOJGVffgRAeRP6Z9CdxCerycIs1AAB0cg7JEhWwpyx8ngD1ptbTyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7049afecd69844a857d15f25e907466fb1693a9bd70b44ed464f0ac0d360453","last_reissued_at":"2026-05-18T01:00:19.163419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:19.163419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03938","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-05-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIxmH500bh/D2PhO57bZQ7k96EG1URTmpo4r2h2GB+l0jGq7dCvZ4dgr/Ug4pgVx6MZ8j/0uG27BvmZ5/9JmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:11:40.820850Z"},"content_sha256":"fc62be84b27623cd505f216dae63643a0e1fc4c49fb7cba9c5702136d22337cb","schema_version":"1.0","event_id":"sha256:fc62be84b27623cd505f216dae63643a0e1fc4c49fb7cba9c5702136d22337cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W4CJV7WNNGCEVBL5CXZF5EDUM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Amit Levi, Cl\\'ement L. Canonne, Dana Ron, Eric Blais, Talya Eden","submitted_at":"2016-07-13T21:31:56Z","abstract_excerpt":"A function $f\\colon \\{-1,1\\}^n \\to \\{-1,1\\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is $\\epsilon$-close to some $k$-junta and reject any function that is $\\epsilon'$-far from every $k'$-junta for some $\\epsilon'= O(\\epsilon)$ and $k' = O(k)$.\n  Our first result is an algorithm that solves this problem with query complexity polynomial in $k$ and $1/\\epsilon$. This result is obtained via a new polynomial-time approximation algorithm for submodular function m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03938","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":""},"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-18T01:00:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npSTJQmhjyWSNw9ZZCMB/Wj/M1fvp8LzMBgn/5WrJ0j/dgZrZgnicrqKOt19Z3bTHq6clFEdXVU11TI6cFPyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:11:40.821752Z"},"content_sha256":"b7e7b8b8c862c147f03301514612b6ade8bc42120cfdff7ebfe649e0d2df1bba","schema_version":"1.0","event_id":"sha256:b7e7b8b8c862c147f03301514612b6ade8bc42120cfdff7ebfe649e0d2df1bba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/bundle.json","state_url":"https://pith.science/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/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-06-12T02:11:40Z","links":{"resolver":"https://pith.science/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3","bundle":"https://pith.science/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/bundle.json","state":"https://pith.science/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4CJV7WNNGCEVBL5CXZF5EDUM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W4CJV7WNNGCEVBL5CXZF5EDUM3","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":"bb73b2ff488dc1737d951903ecfd72e24fcbfd83e913da0cf087fb8f185ec966","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T21:31:56Z","title_canon_sha256":"e172e133e1d7ab5d0cc6294e99230ee2843cb0fcc238d8668a2feb3b5ede6e6f"},"schema_version":"1.0","source":{"id":"1607.03938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03938","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03938v2","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03938","created_at":"2026-05-18T01:00:19Z"},{"alias_kind":"pith_short_12","alias_value":"W4CJV7WNNGCE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W4CJV7WNNGCEVBL5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W4CJV7WN","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:b7e7b8b8c862c147f03301514612b6ade8bc42120cfdff7ebfe649e0d2df1bba","target":"graph","created_at":"2026-05-18T01:00:19Z","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":"A function $f\\colon \\{-1,1\\}^n \\to \\{-1,1\\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is $\\epsilon$-close to some $k$-junta and reject any function that is $\\epsilon'$-far from every $k'$-junta for some $\\epsilon'= O(\\epsilon)$ and $k' = O(k)$.\n  Our first result is an algorithm that solves this problem with query complexity polynomial in $k$ and $1/\\epsilon$. This result is obtained via a new polynomial-time approximation algorithm for submodular function m","authors_text":"Amit Levi, Cl\\'ement L. Canonne, Dana Ron, Eric Blais, Talya Eden","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T21:31:56Z","title":"Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03938","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:fc62be84b27623cd505f216dae63643a0e1fc4c49fb7cba9c5702136d22337cb","target":"record","created_at":"2026-05-18T01:00:19Z","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":"bb73b2ff488dc1737d951903ecfd72e24fcbfd83e913da0cf087fb8f185ec966","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-13T21:31:56Z","title_canon_sha256":"e172e133e1d7ab5d0cc6294e99230ee2843cb0fcc238d8668a2feb3b5ede6e6f"},"schema_version":"1.0","source":{"id":"1607.03938","kind":"arxiv","version":2}},"canonical_sha256":"b7049afecd69844a857d15f25e907466fb1693a9bd70b44ed464f0ac0d360453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7049afecd69844a857d15f25e907466fb1693a9bd70b44ed464f0ac0d360453","first_computed_at":"2026-05-18T01:00:19.163419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:19.163419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMh/FRNEQ/1XT7My0nAOU5a6OhKMDTqPlOJGVffgRAeRP6Z9CdxCerycIs1AAB0cg7JEhWwpyx8ngD1ptbTyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:19.164108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc62be84b27623cd505f216dae63643a0e1fc4c49fb7cba9c5702136d22337cb","sha256:b7e7b8b8c862c147f03301514612b6ade8bc42120cfdff7ebfe649e0d2df1bba"],"state_sha256":"44999b21d7f4dbda6cb344a15d1aa6d6c0c42d840d65905a722e4b0d94008f44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iGf+l+FAz+STMk798bhzTrRgL73pOHE8l+BNFtRKcz0jQZg+J7FwRk6Ky7P02ew0+/u8LpWAQTxK/PGpsRAxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:11:40.827180Z","bundle_sha256":"f6f3bda1f915456a2dee053734e4834ad9ed2b2c6490dedcc3bdf59c824fe860"}}