{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5VRBQ7PTPFWE4IVKHHLVWFMHJQ","short_pith_number":"pith:5VRBQ7PT","schema_version":"1.0","canonical_sha256":"ed62187df3796c4e22aa39d75b15874c38dc28e849f4ba385db387d0dd3f6f98","source":{"kind":"arxiv","id":"2501.16517","version":2},"attestation_state":"computed","paper":{"title":"Symmetric Perceptrons, Number Partitioning and Lattices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Neekon Vafa, Vinod Vaikuntanathan","submitted_at":"2025-01-27T21:31:01Z","abstract_excerpt":"The symmetric binary perceptron ($\\mathrm{SBP}_{\\kappa}$) problem with parameter $\\kappa : \\mathbb{R}_{\\geq1} \\to [0,1]$ is an average-case search problem defined as follows: given a random Gaussian matrix $\\mathbf{A} \\sim \\mathcal{N}(0,1)^{n \\times m}$ as input where $m \\geq n$, output a vector $\\mathbf{x} \\in \\{-1,1\\}^m$ such that $$|| \\mathbf{A} \\mathbf{x} ||_{\\infty} \\leq \\kappa(m/n) \\cdot \\sqrt{m}~.$$ The number partitioning problem ($\\mathrm{NPP}_{\\kappa}$) corresponds to the special case of setting $n=1$. There is considerable evidence that both problems exhibit large computational-stat"},"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":"2501.16517","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-01-27T21:31:01Z","cross_cats_sorted":["cs.CC","math-ph","math.MP","math.PR","stat.TH"],"title_canon_sha256":"d476e88ddf5fec202e0072a3a66f8e6508e2f77aeac14db41870ca220dfd4a48","abstract_canon_sha256":"fc00df621568c978782e42defc283465759ab0175c6b10a610d23b001d075543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:00.575930Z","signature_b64":"muOeEbuabo6zQnPxL661a/HztmWK+Y9ugB/ZOz4YLw8f1xMd9lJE2IY0qBj0vtMb2i4vR+Zuxjl+PZ57RqKECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed62187df3796c4e22aa39d75b15874c38dc28e849f4ba385db387d0dd3f6f98","last_reissued_at":"2026-07-05T11:44:00.575374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:00.575374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Perceptrons, Number Partitioning and Lattices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math-ph","math.MP","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Neekon Vafa, Vinod Vaikuntanathan","submitted_at":"2025-01-27T21:31:01Z","abstract_excerpt":"The symmetric binary perceptron ($\\mathrm{SBP}_{\\kappa}$) problem with parameter $\\kappa : \\mathbb{R}_{\\geq1} \\to [0,1]$ is an average-case search problem defined as follows: given a random Gaussian matrix $\\mathbf{A} \\sim \\mathcal{N}(0,1)^{n \\times m}$ as input where $m \\geq n$, output a vector $\\mathbf{x} \\in \\{-1,1\\}^m$ such that $$|| \\mathbf{A} \\mathbf{x} ||_{\\infty} \\leq \\kappa(m/n) \\cdot \\sqrt{m}~.$$ The number partitioning problem ($\\mathrm{NPP}_{\\kappa}$) corresponds to the special case of setting $n=1$. There is considerable evidence that both problems exhibit large computational-stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16517","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.16517/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.16517","created_at":"2026-07-05T11:44:00.575440+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.16517v2","created_at":"2026-07-05T11:44:00.575440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16517","created_at":"2026-07-05T11:44:00.575440+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VRBQ7PTPFWE","created_at":"2026-07-05T11:44:00.575440+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VRBQ7PTPFWE4IVK","created_at":"2026-07-05T11:44:00.575440+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VRBQ7PT","created_at":"2026-07-05T11:44:00.575440+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05618","citing_title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","ref_index":105,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ","json":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ.json","graph_json":"https://pith.science/api/pith-number/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/graph.json","events_json":"https://pith.science/api/pith-number/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/events.json","paper":"https://pith.science/paper/5VRBQ7PT"},"agent_actions":{"view_html":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ","download_json":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ.json","view_paper":"https://pith.science/paper/5VRBQ7PT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.16517&json=true","fetch_graph":"https://pith.science/api/pith-number/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/action/storage_attestation","attest_author":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/action/author_attestation","sign_citation":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/action/citation_signature","submit_replication":"https://pith.science/pith/5VRBQ7PTPFWE4IVKHHLVWFMHJQ/action/replication_record"}},"created_at":"2026-07-05T11:44:00.575440+00:00","updated_at":"2026-07-05T11:44:00.575440+00:00"}