{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HBBG65NPJEHPAJ5JY4SR2UBQG3","short_pith_number":"pith:HBBG65NP","canonical_record":{"source":{"id":"2505.20607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-27T01:01:36Z","cross_cats_sorted":["cs.CC","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"0b04941ec1c732d6ee404c1987e7562bea584431ad631efc356266e3189d053b","abstract_canon_sha256":"bd62b280b0551db113e5e37e463dc9f70a5a333ad03e9ce46eebf80bc7bdca09"},"schema_version":"1.0"},"canonical_sha256":"38426f75af490ef027a9c7251d503036d16d39501f2f44cd4ed1fc75a7995656","source":{"kind":"arxiv","id":"2505.20607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.20607","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"2505.20607v1","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20607","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"HBBG65NPJEHP","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_16","alias_value":"HBBG65NPJEHPAJ5J","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_8","alias_value":"HBBG65NP","created_at":"2026-07-05T11:10:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HBBG65NPJEHPAJ5JY4SR2UBQG3","target":"record","payload":{"canonical_record":{"source":{"id":"2505.20607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-27T01:01:36Z","cross_cats_sorted":["cs.CC","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"0b04941ec1c732d6ee404c1987e7562bea584431ad631efc356266e3189d053b","abstract_canon_sha256":"bd62b280b0551db113e5e37e463dc9f70a5a333ad03e9ce46eebf80bc7bdca09"},"schema_version":"1.0"},"canonical_sha256":"38426f75af490ef027a9c7251d503036d16d39501f2f44cd4ed1fc75a7995656","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:15.355773Z","signature_b64":"QudLH5zolqsAGEfRYx157gzY/PRc1cniYLsz7lKp7F1X2i4ERb4AGuAlF8KVWWgig4j6gDA+wwxuhrHWdBiBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38426f75af490ef027a9c7251d503036d16d39501f2f44cd4ed1fc75a7995656","last_reissued_at":"2026-07-05T11:10:15.355075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:15.355075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.20607","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-07-05T11:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uby5svfW9pT5YhxUXLbpwNF/bRaQ+0W8nkPoYo8Gj/UBmfGuW2ZU5xHXPCOb/F7nbta5KjHc2D5behXDVAmCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:26:39.979177Z"},"content_sha256":"94b154f722e5fb3f9e1c584d8e9fd8288b99a56daf0be7151c2be89be9fd8789","schema_version":"1.0","event_id":"sha256:94b154f722e5fb3f9e1c584d8e9fd8288b99a56daf0be7151c2be89be9fd8789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HBBG65NPJEHPAJ5JY4SR2UBQG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strong Low Degree Hardness for the Number Partitioning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Mark Sellke, Rushil Mallarapu","submitted_at":"2025-05-27T01:01:36Z","abstract_excerpt":"In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a statistical-to-computational gap: when the $N$ numbers to be partitioned are i.i.d. standard gaussian, the optimal discrepancy is $2^{-\\Theta(N)}$ with high probability, but the best known polynomial-time algorithms only find solutions with a discrepancy of $2^{-\\Theta(\\log^2 N)}$. This gap is a common feature in optimization problems over random combinatorial structures, and i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20607","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.20607/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"},"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-07-05T11:10:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoxpRG9icbQn1kkzGiVtRyWc8xUTYzj8KS2jue+hCO2oIaLpU4Ejq+CQnuZGdII/XNKO2ZB3Ah3XbbJady22Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:26:39.980073Z"},"content_sha256":"6e37aceef3cb4b7d6fc99d3ee11dd11be6990037e2d5ad952a11711ce1bf5378","schema_version":"1.0","event_id":"sha256:6e37aceef3cb4b7d6fc99d3ee11dd11be6990037e2d5ad952a11711ce1bf5378"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/bundle.json","state_url":"https://pith.science/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/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-08-17T03:26:39Z","links":{"resolver":"https://pith.science/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3","bundle":"https://pith.science/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/bundle.json","state":"https://pith.science/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HBBG65NPJEHPAJ5JY4SR2UBQG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HBBG65NPJEHPAJ5JY4SR2UBQG3","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":"bd62b280b0551db113e5e37e463dc9f70a5a333ad03e9ce46eebf80bc7bdca09","cross_cats_sorted":["cs.CC","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-27T01:01:36Z","title_canon_sha256":"0b04941ec1c732d6ee404c1987e7562bea584431ad631efc356266e3189d053b"},"schema_version":"1.0","source":{"id":"2505.20607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.20607","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"arxiv_version","alias_value":"2505.20607v1","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20607","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_12","alias_value":"HBBG65NPJEHP","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_16","alias_value":"HBBG65NPJEHPAJ5J","created_at":"2026-07-05T11:10:15Z"},{"alias_kind":"pith_short_8","alias_value":"HBBG65NP","created_at":"2026-07-05T11:10:15Z"}],"graph_snapshots":[{"event_id":"sha256:6e37aceef3cb4b7d6fc99d3ee11dd11be6990037e2d5ad952a11711ce1bf5378","target":"graph","created_at":"2026-07-05T11:10:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.20607/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a statistical-to-computational gap: when the $N$ numbers to be partitioned are i.i.d. standard gaussian, the optimal discrepancy is $2^{-\\Theta(N)}$ with high probability, but the best known polynomial-time algorithms only find solutions with a discrepancy of $2^{-\\Theta(\\log^2 N)}$. This gap is a common feature in optimization problems over random combinatorial structures, and i","authors_text":"Mark Sellke, Rushil Mallarapu","cross_cats":["cs.CC","cs.DS","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20607","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:94b154f722e5fb3f9e1c584d8e9fd8288b99a56daf0be7151c2be89be9fd8789","target":"record","created_at":"2026-07-05T11:10:15Z","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":"bd62b280b0551db113e5e37e463dc9f70a5a333ad03e9ce46eebf80bc7bdca09","cross_cats_sorted":["cs.CC","cs.DS","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-05-27T01:01:36Z","title_canon_sha256":"0b04941ec1c732d6ee404c1987e7562bea584431ad631efc356266e3189d053b"},"schema_version":"1.0","source":{"id":"2505.20607","kind":"arxiv","version":1}},"canonical_sha256":"38426f75af490ef027a9c7251d503036d16d39501f2f44cd4ed1fc75a7995656","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38426f75af490ef027a9c7251d503036d16d39501f2f44cd4ed1fc75a7995656","first_computed_at":"2026-07-05T11:10:15.355075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:15.355075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QudLH5zolqsAGEfRYx157gzY/PRc1cniYLsz7lKp7F1X2i4ERb4AGuAlF8KVWWgig4j6gDA+wwxuhrHWdBiBCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:15.355773Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.20607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94b154f722e5fb3f9e1c584d8e9fd8288b99a56daf0be7151c2be89be9fd8789","sha256:6e37aceef3cb4b7d6fc99d3ee11dd11be6990037e2d5ad952a11711ce1bf5378"],"state_sha256":"43cec8b06beef3bdf36ad7fc1a74b580138dbe8862e190e114944a43bd78e1c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKuo5SzrPnvybmBQqfK0Y3Lkbj9TWCu1uDb/7C4tAvr/oFZ2I2Vzk1MYxktp5C8X3iFJzDfs0vkpYMHA8HaJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:26:39.984831Z","bundle_sha256":"49949ec5d2f77e5ab0ffb8027966e4ea16b9eb69ab317b9e4b69a693813c5df9"}}