{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UCLPZKEOIZ6DJMC4F7GTOU3ZIP","short_pith_number":"pith:UCLPZKEO","canonical_record":{"source":{"id":"2606.13570","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-11T16:59:12Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"9a639bfde01870b2fc745c521c5654c76ff9d7cf8358d777f8915c448aaed495","abstract_canon_sha256":"2940770a4f4b722b73718f7dda12aab80dd082523e0fd582eb61649e05504980"},"schema_version":"1.0"},"canonical_sha256":"a096fca88e467c34b05c2fcd37537943f46e705b7de411e9dc08fa7f3472708e","source":{"kind":"arxiv","id":"2606.13570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13570","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13570v1","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13570","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"UCLPZKEOIZ6D","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_16","alias_value":"UCLPZKEOIZ6DJMC4","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_8","alias_value":"UCLPZKEO","created_at":"2026-06-12T01:10:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UCLPZKEOIZ6DJMC4F7GTOU3ZIP","target":"record","payload":{"canonical_record":{"source":{"id":"2606.13570","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-11T16:59:12Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"9a639bfde01870b2fc745c521c5654c76ff9d7cf8358d777f8915c448aaed495","abstract_canon_sha256":"2940770a4f4b722b73718f7dda12aab80dd082523e0fd582eb61649e05504980"},"schema_version":"1.0"},"canonical_sha256":"a096fca88e467c34b05c2fcd37537943f46e705b7de411e9dc08fa7f3472708e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:10.669972Z","signature_b64":"E1YBTc2o/eataQMiQ/AiwcOyzVEz6oTBE/fQiNbWSwxKxrcg76CuLhvmQBvL2pgNck16pCUu2uceJI7t095kAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a096fca88e467c34b05c2fcd37537943f46e705b7de411e9dc08fa7f3472708e","last_reissued_at":"2026-06-12T01:10:10.669123Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:10.669123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.13570","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-06-12T01:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmmFAmJAQd6eQ+6eHlotSRJdXB9mmJBGrsjuWJzGgs3rdOLA/IJo7mQIP63rnD1b4rBrv1uu2Rbt/4MKuLivAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:07:14.682573Z"},"content_sha256":"84551ef95db146c059f5fd7abd5b2f1dd7ef92a578de5659a7d1a39af2eec03f","schema_version":"1.0","event_id":"sha256:84551ef95db146c059f5fd7abd5b2f1dd7ef92a578de5659a7d1a39af2eec03f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UCLPZKEOIZ6DJMC4F7GTOU3ZIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Carsten Schubert, Jens Eisert, Maximilian J. Kramer","submitted_at":"2026-06-11T16:59:12Z","abstract_excerpt":"For general max-k-XORSAT with $k \\geq 3$, no polynomial-time algorithm can do substantially better than random guessing on worst-case instances unless $\\mathsf{P} = \\mathsf{NP}$: approximating beyond the random-assignment value of $1/2$ is $\\mathsf{NP}$-hard. The picture changes when each variable appears in at most $D$ constraints. In that bounded-degree setting, polynomial-time algorithms can provably beat the random baseline by an additive amount of order $1/\\sqrt{D}$. For Boolean instances, this scaling is known to be optimal: the matching hardness result is due to Trevisan, while the corr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13570","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/2606.13570/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-06-12T01:10:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMz4HVzdYBt1KQM8Aals4kBapFrT4AYYVJddLVxyc9UEfTuOr6aHMYg/1ku6FBLBNq8oRUFfa0H/zAKNqSHqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:07:14.682946Z"},"content_sha256":"096704d3961a29296820e8ecf71401fa9ae332fd51472fb30f9f04ff49a1983f","schema_version":"1.0","event_id":"sha256:096704d3961a29296820e8ecf71401fa9ae332fd51472fb30f9f04ff49a1983f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/bundle.json","state_url":"https://pith.science/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/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-29T13:07:14Z","links":{"resolver":"https://pith.science/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP","bundle":"https://pith.science/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/bundle.json","state":"https://pith.science/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCLPZKEOIZ6DJMC4F7GTOU3ZIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UCLPZKEOIZ6DJMC4F7GTOU3ZIP","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":"2940770a4f4b722b73718f7dda12aab80dd082523e0fd582eb61649e05504980","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-11T16:59:12Z","title_canon_sha256":"9a639bfde01870b2fc745c521c5654c76ff9d7cf8358d777f8915c448aaed495"},"schema_version":"1.0","source":{"id":"2606.13570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13570","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13570v1","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13570","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_12","alias_value":"UCLPZKEOIZ6D","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_16","alias_value":"UCLPZKEOIZ6DJMC4","created_at":"2026-06-12T01:10:10Z"},{"alias_kind":"pith_short_8","alias_value":"UCLPZKEO","created_at":"2026-06-12T01:10:10Z"}],"graph_snapshots":[{"event_id":"sha256:096704d3961a29296820e8ecf71401fa9ae332fd51472fb30f9f04ff49a1983f","target":"graph","created_at":"2026-06-12T01:10:10Z","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/2606.13570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For general max-k-XORSAT with $k \\geq 3$, no polynomial-time algorithm can do substantially better than random guessing on worst-case instances unless $\\mathsf{P} = \\mathsf{NP}$: approximating beyond the random-assignment value of $1/2$ is $\\mathsf{NP}$-hard. The picture changes when each variable appears in at most $D$ constraints. In that bounded-degree setting, polynomial-time algorithms can provably beat the random baseline by an additive amount of order $1/\\sqrt{D}$. For Boolean instances, this scaling is known to be optimal: the matching hardness result is due to Trevisan, while the corr","authors_text":"Carsten Schubert, Jens Eisert, Maximilian J. Kramer","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-11T16:59:12Z","title":"Approximability limits for bounded-degree max-LINSAT and implications for decoded quantum interferometry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13570","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:84551ef95db146c059f5fd7abd5b2f1dd7ef92a578de5659a7d1a39af2eec03f","target":"record","created_at":"2026-06-12T01:10:10Z","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":"2940770a4f4b722b73718f7dda12aab80dd082523e0fd582eb61649e05504980","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-11T16:59:12Z","title_canon_sha256":"9a639bfde01870b2fc745c521c5654c76ff9d7cf8358d777f8915c448aaed495"},"schema_version":"1.0","source":{"id":"2606.13570","kind":"arxiv","version":1}},"canonical_sha256":"a096fca88e467c34b05c2fcd37537943f46e705b7de411e9dc08fa7f3472708e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a096fca88e467c34b05c2fcd37537943f46e705b7de411e9dc08fa7f3472708e","first_computed_at":"2026-06-12T01:10:10.669123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:10:10.669123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E1YBTc2o/eataQMiQ/AiwcOyzVEz6oTBE/fQiNbWSwxKxrcg76CuLhvmQBvL2pgNck16pCUu2uceJI7t095kAA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:10:10.669972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84551ef95db146c059f5fd7abd5b2f1dd7ef92a578de5659a7d1a39af2eec03f","sha256:096704d3961a29296820e8ecf71401fa9ae332fd51472fb30f9f04ff49a1983f"],"state_sha256":"952c0f6d83212d3740d1a969395ef8527525456dd3fc46924379b687b0f08b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dm7KPUGRE4nnQrfBYd+OSNiO6JGJcIUdiDe3icjLkXCaRPPwdxySCp5tM+uvBS+VlsqLhvn8HWURAX/xwCGDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:07:14.684874Z","bundle_sha256":"3598a6b68b0d84bb16112457f5aff282d2d453aa42456b4726e9a62802c6406e"}}