{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6JIPJ2IACD44WPAHUE5MYIAKSX","short_pith_number":"pith:6JIPJ2IA","canonical_record":{"source":{"id":"1707.01795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T13:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"377d41a4915addd853bf631ba16b7295beb45578770de7b06450cda91063c991","abstract_canon_sha256":"ba5897e8a5303d2dd6a947f1f73bcb097fbfa48cd83758611c94f111badbfd99"},"schema_version":"1.0"},"canonical_sha256":"f250f4e90010f9cb3c07a13acc200a95f97ca37a05afb17d3b61aa6531570602","source":{"kind":"arxiv","id":"1707.01795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01795","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01795v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01795","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"6JIPJ2IACD44","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JIPJ2IACD44WPAH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JIPJ2IA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6JIPJ2IACD44WPAHUE5MYIAKSX","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T13:56:35Z","cross_cats_sorted":[],"title_canon_sha256":"377d41a4915addd853bf631ba16b7295beb45578770de7b06450cda91063c991","abstract_canon_sha256":"ba5897e8a5303d2dd6a947f1f73bcb097fbfa48cd83758611c94f111badbfd99"},"schema_version":"1.0"},"canonical_sha256":"f250f4e90010f9cb3c07a13acc200a95f97ca37a05afb17d3b61aa6531570602","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.421153Z","signature_b64":"+khJfOYs1w59mXRidQ06BgwK2bOK96QxWi05hmMN5OqZJA5D9cpJ4PdSNLE2TkWcoe2hv0BSkGHoBoMJjDAxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f250f4e90010f9cb3c07a13acc200a95f97ca37a05afb17d3b61aa6531570602","last_reissued_at":"2026-05-18T00:40:47.420549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.420549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01795","source_version":1,"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-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMBiOmQIn732kOOxgVsWIahDMAghmPdLku9ITvswRW6V6vAz7Jf39SsbfQ0JH/f4NAZnYdO83LGWtIG5KI3XBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:48.093538Z"},"content_sha256":"47de02a56f44da3022ab76dd83030bd6d02420c287c742a0cb0cbd750a4c08d3","schema_version":"1.0","event_id":"sha256:47de02a56f44da3022ab76dd83030bd6d02420c287c742a0cb0cbd750a4c08d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6JIPJ2IACD44WPAHUE5MYIAKSX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of learning noisy halfspaces using polynomial thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arnab Bhattacharyya, Rishi Saket, Suprovat Ghoshal","submitted_at":"2017-07-06T13:56:35Z","abstract_excerpt":"We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \\in \\mathbb{Z}^+$ and $\\varepsilon > 0$, it is NP-hard to decide: given a set of $\\{-1,1\\}$-labeled points in $\\mathbb{R}^n$ whether (YES Case) there exists a halfspace that classifies $(1-\\varepsilon)$-fraction of the points correctly, or (NO Case) any degree-$d$ PTF classifies at most $(1/2 + \\varepsilon)$-fraction of the points correctly. This strengthens to all constant degrees the previous NP-hardness of lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01795","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":""},"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-18T00:40:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNUrSF2UQXgfsxWgiAom6CPULgDa7r0UiUZ5eWNW95TPDeLj7pZRydPNnJXB2CyVozaVXOun5qIX+KdSQVLjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:48.094012Z"},"content_sha256":"5c145ace6fca7149863ea886a75e1c6ddeae55eeacc52762fddce24961e20e7c","schema_version":"1.0","event_id":"sha256:5c145ace6fca7149863ea886a75e1c6ddeae55eeacc52762fddce24961e20e7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/bundle.json","state_url":"https://pith.science/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/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-26T14:37:48Z","links":{"resolver":"https://pith.science/pith/6JIPJ2IACD44WPAHUE5MYIAKSX","bundle":"https://pith.science/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/bundle.json","state":"https://pith.science/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JIPJ2IACD44WPAHUE5MYIAKSX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6JIPJ2IACD44WPAHUE5MYIAKSX","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":"ba5897e8a5303d2dd6a947f1f73bcb097fbfa48cd83758611c94f111badbfd99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T13:56:35Z","title_canon_sha256":"377d41a4915addd853bf631ba16b7295beb45578770de7b06450cda91063c991"},"schema_version":"1.0","source":{"id":"1707.01795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01795","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01795v1","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01795","created_at":"2026-05-18T00:40:47Z"},{"alias_kind":"pith_short_12","alias_value":"6JIPJ2IACD44","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JIPJ2IACD44WPAH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JIPJ2IA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:5c145ace6fca7149863ea886a75e1c6ddeae55eeacc52762fddce24961e20e7c","target":"graph","created_at":"2026-05-18T00:40:47Z","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":"We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \\in \\mathbb{Z}^+$ and $\\varepsilon > 0$, it is NP-hard to decide: given a set of $\\{-1,1\\}$-labeled points in $\\mathbb{R}^n$ whether (YES Case) there exists a halfspace that classifies $(1-\\varepsilon)$-fraction of the points correctly, or (NO Case) any degree-$d$ PTF classifies at most $(1/2 + \\varepsilon)$-fraction of the points correctly. This strengthens to all constant degrees the previous NP-hardness of lea","authors_text":"Arnab Bhattacharyya, Rishi Saket, Suprovat Ghoshal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T13:56:35Z","title":"Hardness of learning noisy halfspaces using polynomial thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01795","kind":"arxiv","version":1},"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:47de02a56f44da3022ab76dd83030bd6d02420c287c742a0cb0cbd750a4c08d3","target":"record","created_at":"2026-05-18T00:40:47Z","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":"ba5897e8a5303d2dd6a947f1f73bcb097fbfa48cd83758611c94f111badbfd99","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-06T13:56:35Z","title_canon_sha256":"377d41a4915addd853bf631ba16b7295beb45578770de7b06450cda91063c991"},"schema_version":"1.0","source":{"id":"1707.01795","kind":"arxiv","version":1}},"canonical_sha256":"f250f4e90010f9cb3c07a13acc200a95f97ca37a05afb17d3b61aa6531570602","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f250f4e90010f9cb3c07a13acc200a95f97ca37a05afb17d3b61aa6531570602","first_computed_at":"2026-05-18T00:40:47.420549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:47.420549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+khJfOYs1w59mXRidQ06BgwK2bOK96QxWi05hmMN5OqZJA5D9cpJ4PdSNLE2TkWcoe2hv0BSkGHoBoMJjDAxAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:47.421153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47de02a56f44da3022ab76dd83030bd6d02420c287c742a0cb0cbd750a4c08d3","sha256:5c145ace6fca7149863ea886a75e1c6ddeae55eeacc52762fddce24961e20e7c"],"state_sha256":"6293103efbf2097b53e62328a58e75d62e46c88be8f66df4b7a1fd1d9644ef8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vxquRE6CXkp50xLigIbvuWqnKQ2e1ZBCgwl2pe01HaWJeMdBpM/vhRUY3tGban183/rUsgv4IxAab9Ba4zGsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:48.096639Z","bundle_sha256":"025aa38aaf0f62e6bab4d3f7067d10042f6da818c29bd0cd6ecf3d2461cc247b"}}