{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WCXX5X4VNEXDVLQ2U2MAE6FQS5","short_pith_number":"pith:WCXX5X4V","canonical_record":{"source":{"id":"1010.3484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-18T05:46:46Z","cross_cats_sorted":[],"title_canon_sha256":"d8302bd3f35ffdb4864aa76894fe90778eaae5badb657a679276db5536e5274b","abstract_canon_sha256":"7b5488b27a50052896cd4cf8d2ae7f356e84ef0a87915e81b39f9306f24ec26e"},"schema_version":"1.0"},"canonical_sha256":"b0af7edf95692e3aae1aa6980278b0977c9663542f52f5e450d76bc1355eed7e","source":{"kind":"arxiv","id":"1010.3484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3484","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3484v1","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3484","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"WCXX5X4VNEXD","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WCXX5X4VNEXDVLQ2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WCXX5X4V","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WCXX5X4VNEXDVLQ2U2MAE6FQS5","target":"record","payload":{"canonical_record":{"source":{"id":"1010.3484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-18T05:46:46Z","cross_cats_sorted":[],"title_canon_sha256":"d8302bd3f35ffdb4864aa76894fe90778eaae5badb657a679276db5536e5274b","abstract_canon_sha256":"7b5488b27a50052896cd4cf8d2ae7f356e84ef0a87915e81b39f9306f24ec26e"},"schema_version":"1.0"},"canonical_sha256":"b0af7edf95692e3aae1aa6980278b0977c9663542f52f5e450d76bc1355eed7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:09.015653Z","signature_b64":"HlJq2vrUkjfr9lfDE6HuD0oE3lmt+sfojQOwnB10NC9qnVT5X8EYmEu3znlwXypSESn9I9GTPEpF29VP0bWhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0af7edf95692e3aae1aa6980278b0977c9663542f52f5e450d76bc1355eed7e","last_reissued_at":"2026-05-18T04:39:09.014958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:09.014958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.3484","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-18T04:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtmH1tSpP32GmaXMAJmMsCleW+z6ChGtu7yuyZSfY2pOMcxZoAdV5ALCkIak2pDsumMnSvQgqxjD9VLOhHTlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:03:07.474524Z"},"content_sha256":"1900085431a657ed6b734ee11772d0c3585ae74f2d4c66c45af9ed1eec56a3d4","schema_version":"1.0","event_id":"sha256:1900085431a657ed6b734ee11772d0c3585ae74f2d4c66c45af9ed1eec56a3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WCXX5X4VNEXDVLQ2U2MAE6FQS5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Ryan O'Donnell, Yi Wu","submitted_at":"2010-10-18T05:46:46Z","abstract_excerpt":"Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardness results for the problem of finding a low degree polynomial threshold function (PTF) which has the maximum possible agreement with a given set of labeled examples in $\\R^n \\times \\{-1,1\\}.$ We prove that for any constants $d\\geq 1, \\eps > 0$,\n  {itemize}\n  Assuming the Unique Games Conjecture, no polynomial-time algorithm can find a degree-$d$ PTF that is consistent with a $(\\half + \\eps)$ fraction of a given set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3484","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-18T04:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dfg6RUZnAFp4c6nY9iMRrKiKj1Rx4xJ7c16iVP6x2fDhFAj34qZ+E7k1RH2hrQU/va0ECmfvffMQPV1wTtdNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:03:07.475089Z"},"content_sha256":"454b8e990fdbf861c53ad2f7012b19e48e9b06c0d57d8a307537d84dfdc15579","schema_version":"1.0","event_id":"sha256:454b8e990fdbf861c53ad2f7012b19e48e9b06c0d57d8a307537d84dfdc15579"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/bundle.json","state_url":"https://pith.science/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/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-05T20:03:07Z","links":{"resolver":"https://pith.science/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5","bundle":"https://pith.science/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/bundle.json","state":"https://pith.science/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCXX5X4VNEXDVLQ2U2MAE6FQS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WCXX5X4VNEXDVLQ2U2MAE6FQS5","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":"7b5488b27a50052896cd4cf8d2ae7f356e84ef0a87915e81b39f9306f24ec26e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-18T05:46:46Z","title_canon_sha256":"d8302bd3f35ffdb4864aa76894fe90778eaae5badb657a679276db5536e5274b"},"schema_version":"1.0","source":{"id":"1010.3484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.3484","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1010.3484v1","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.3484","created_at":"2026-05-18T04:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"WCXX5X4VNEXD","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WCXX5X4VNEXDVLQ2","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WCXX5X4V","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:454b8e990fdbf861c53ad2f7012b19e48e9b06c0d57d8a307537d84dfdc15579","target":"graph","created_at":"2026-05-18T04:39:09Z","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":"Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardness results for the problem of finding a low degree polynomial threshold function (PTF) which has the maximum possible agreement with a given set of labeled examples in $\\R^n \\times \\{-1,1\\}.$ We prove that for any constants $d\\geq 1, \\eps > 0$,\n  {itemize}\n  Assuming the Unique Games Conjecture, no polynomial-time algorithm can find a degree-$d$ PTF that is consistent with a $(\\half + \\eps)$ fraction of a given set of ","authors_text":"Ilias Diakonikolas, Rocco A. Servedio, Ryan O'Donnell, Yi Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-18T05:46:46Z","title":"Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.3484","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:1900085431a657ed6b734ee11772d0c3585ae74f2d4c66c45af9ed1eec56a3d4","target":"record","created_at":"2026-05-18T04:39:09Z","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":"7b5488b27a50052896cd4cf8d2ae7f356e84ef0a87915e81b39f9306f24ec26e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-18T05:46:46Z","title_canon_sha256":"d8302bd3f35ffdb4864aa76894fe90778eaae5badb657a679276db5536e5274b"},"schema_version":"1.0","source":{"id":"1010.3484","kind":"arxiv","version":1}},"canonical_sha256":"b0af7edf95692e3aae1aa6980278b0977c9663542f52f5e450d76bc1355eed7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0af7edf95692e3aae1aa6980278b0977c9663542f52f5e450d76bc1355eed7e","first_computed_at":"2026-05-18T04:39:09.014958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:09.014958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HlJq2vrUkjfr9lfDE6HuD0oE3lmt+sfojQOwnB10NC9qnVT5X8EYmEu3znlwXypSESn9I9GTPEpF29VP0bWhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:09.015653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.3484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1900085431a657ed6b734ee11772d0c3585ae74f2d4c66c45af9ed1eec56a3d4","sha256:454b8e990fdbf861c53ad2f7012b19e48e9b06c0d57d8a307537d84dfdc15579"],"state_sha256":"13ad7b033d57a74410fe420503ab4366e548bc261ed16744ad2f2a4a29f6badb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxPIeLr2J/3aKDQUKtInHmBZa8XU7ty5p8vM3G7v02zdcoXCK4Ev8Dgx7zCboPtcLVDaDw8HH2qIxYmNy/GIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:03:07.478868Z","bundle_sha256":"210a78f9e364683e4bfff073832ee1e149f16515d4200e31ca346369db20f367"}}