{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:D5RWDYOUZK3RFPJCR3GEG4VZI5","short_pith_number":"pith:D5RWDYOU","canonical_record":{"source":{"id":"2505.10548","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T17:56:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bcabc3a70ea93c5e66f0bdd1bcdaedbeed65cb3c91daf2ec6287e81b962603ff","abstract_canon_sha256":"46c342f25d485b89197a368b17be68e7a2024a85a1006f7248d6aea1ef68fb72"},"schema_version":"1.0"},"canonical_sha256":"1f6361e1d4cab712bd228ecc4372b9477a8bbb9e15b0c8ceb219b22f626af1e7","source":{"kind":"arxiv","id":"2505.10548","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10548","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10548v4","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10548","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"D5RWDYOUZK3R","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"D5RWDYOUZK3RFPJC","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"D5RWDYOU","created_at":"2026-06-08T01:03:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:D5RWDYOUZK3RFPJCR3GEG4VZI5","target":"record","payload":{"canonical_record":{"source":{"id":"2505.10548","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T17:56:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bcabc3a70ea93c5e66f0bdd1bcdaedbeed65cb3c91daf2ec6287e81b962603ff","abstract_canon_sha256":"46c342f25d485b89197a368b17be68e7a2024a85a1006f7248d6aea1ef68fb72"},"schema_version":"1.0"},"canonical_sha256":"1f6361e1d4cab712bd228ecc4372b9477a8bbb9e15b0c8ceb219b22f626af1e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:03:44.359522Z","signature_b64":"55NRdBNXk7+rZdXLxLwDI1s0jKV+2FtMLvdnYLRJmR6iOPcyc/SGrui+twt/dV6rcp5IFwqhv0o0DQYsqbOrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6361e1d4cab712bd228ecc4372b9477a8bbb9e15b0c8ceb219b22f626af1e7","last_reissued_at":"2026-06-08T01:03:44.358693Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:03:44.358693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.10548","source_version":4,"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-08T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ug4q51/1wJ5gh9qJPxPYwaYmxowfRRyffhqpVHXCwuf0G5fITml8tEPwq7loyrro3FLKJ+tpH6uYvVastQIDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:54:52.804128Z"},"content_sha256":"f36d132923d367fc8e42b6a53fb859b21acdb14365a0fab50d751721893ab803","schema_version":"1.0","event_id":"sha256:f36d132923d367fc8e42b6a53fb859b21acdb14365a0fab50d751721893ab803"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:D5RWDYOUZK3RFPJCR3GEG4VZI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue.","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Gabriel Coutinho, Henrique Assump\\c{c}\\~ao","submitted_at":"2025-05-15T17:56:11Z","abstract_excerpt":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality cases of a primal-dual inequality involving the Goemans-Williamson semidefinite program, which approximates MAXCUT, to graphs in certain coherent configurations. Moreover, we obtain spectral bounds for MAX 2-SAT when the underlying graphs belong to a symmetric association scheme by means of a certain semidefinite program used to approximate quadratic programs, and we further develop this technique in order to explicitly "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graphs under consideration belong to an association scheme or coherent configuration, which supplies the algebraic structure needed to formulate the SDP and relate it to the smallest eigenvalue.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"606360674bd238719e4f3e8a7ddbe6dd9017a0c7e6eb2f461ddd1f20e8ab8d9d"},"source":{"id":"2505.10548","kind":"arxiv","version":4},"verdict":{"id":"7f088869-a312-489d-a936-fb0fb269c2fb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-22T14:23:11.754873Z","strongest_claim":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue.","one_line_summary":"SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graphs under consideration belong to an association scheme or coherent configuration, which supplies the algebraic structure needed to formulate the SDP and relate it to the smallest eigenvalue.","pith_extraction_headline":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.10548/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":32,"sample":[{"doi":"","year":2007,"title":"P. Austrin. Balanced max 2-sat might not be the hardest. InProceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC ’07, page 189–197, New York, NY, USA, 2007. Association for","work_id":"c4ab773d-b67a-49f2-ac58-4ca463eb4c97","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"N. B. Proença, M. K. de Carli Silva, C. M. Sato, and L. Tunçel. A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem.Mathematical Programming, p","work_id":"4e2951ab-71ed-4fbe-a097-492214c73b12","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"C. Bachoc, D. C. Gijswijt, A. Schrijver, and F. Vallentin. Invariant semidefinite programs. In M. F. Anjos and J. B. Lasserre, editors,Handbook on Semidefinite, Conic and Polynomial Optimization, page","work_id":"6c37bc45-0369-491e-82bb-616b4ab08cb3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Bailey.Association Schemes: Designed Experiments, Algebra, and Combi- natorics","work_id":"2d8c4922-50ce-4766-a0c7-e25f45c270f8","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"E. Bannai. An introduction to association schemes.Methods of Discrete Mathematics (eds. S. Löwe, F. Mazzocca, N. Melone and U. Ott), Quaderni di Mathematica, 5:1–70, 1999","work_id":"645bfb1b-2113-4e6e-aa70-2012d4ede2a0","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":32,"snapshot_sha256":"845df6b5985da8194f4f8bc8ace0b20ecca46751b54de677d8894359ec29b357","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9f73249ac8d2b3029731144d49ef78c9657e45b576cc7b194db33dec39878d03"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"7f088869-a312-489d-a936-fb0fb269c2fb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-08T01:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLjjRXd8v5BgHOzlr0Numz0eMlA+NQv88zsZW4yjkI3ZzBTOCA7VPpj7kSGJUvSiK6GbyXJr1rrgfZAbc4cBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:54:52.804956Z"},"content_sha256":"205e0f9a668bc220f05d46317154558efe36e8e1c32677d994608e9fd4f7ce13","schema_version":"1.0","event_id":"sha256:205e0f9a668bc220f05d46317154558efe36e8e1c32677d994608e9fd4f7ce13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/bundle.json","state_url":"https://pith.science/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/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-07-05T11:54:52Z","links":{"resolver":"https://pith.science/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5","bundle":"https://pith.science/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/bundle.json","state":"https://pith.science/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5RWDYOUZK3RFPJCR3GEG4VZI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D5RWDYOUZK3RFPJCR3GEG4VZI5","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":"46c342f25d485b89197a368b17be68e7a2024a85a1006f7248d6aea1ef68fb72","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T17:56:11Z","title_canon_sha256":"bcabc3a70ea93c5e66f0bdd1bcdaedbeed65cb3c91daf2ec6287e81b962603ff"},"schema_version":"1.0","source":{"id":"2505.10548","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10548","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10548v4","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10548","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"D5RWDYOUZK3R","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_16","alias_value":"D5RWDYOUZK3RFPJC","created_at":"2026-06-08T01:03:44Z"},{"alias_kind":"pith_short_8","alias_value":"D5RWDYOU","created_at":"2026-06-08T01:03:44Z"}],"graph_snapshots":[{"event_id":"sha256:205e0f9a668bc220f05d46317154558efe36e8e1c32677d994608e9fd4f7ce13","target":"graph","created_at":"2026-06-08T01:03:44Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graphs under consideration belong to an association scheme or coherent configuration, which supplies the algebraic structure needed to formulate the SDP and relate it to the smallest eigenvalue."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue."}],"snapshot_sha256":"606360674bd238719e4f3e8a7ddbe6dd9017a0c7e6eb2f461ddd1f20e8ab8d9d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9f73249ac8d2b3029731144d49ef78c9657e45b576cc7b194db33dec39878d03"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.10548/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue. We also extend the equality cases of a primal-dual inequality involving the Goemans-Williamson semidefinite program, which approximates MAXCUT, to graphs in certain coherent configurations. Moreover, we obtain spectral bounds for MAX 2-SAT when the underlying graphs belong to a symmetric association scheme by means of a certain semidefinite program used to approximate quadratic programs, and we further develop this technique in order to explicitly ","authors_text":"Gabriel Coutinho, Henrique Assump\\c{c}\\~ao","cross_cats":["math.CO"],"headline":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T17:56:11Z","title":"Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs"},"references":{"count":32,"internal_anchors":0,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"P. Austrin. Balanced max 2-sat might not be the hardest. InProceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC ’07, page 189–197, New York, NY, USA, 2007. Association for","work_id":"c4ab773d-b67a-49f2-ac58-4ca463eb4c97","year":2007},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"N. B. Proença, M. K. de Carli Silva, C. M. Sato, and L. Tunçel. A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem.Mathematical Programming, p","work_id":"4e2951ab-71ed-4fbe-a097-492214c73b12","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"C. Bachoc, D. C. Gijswijt, A. Schrijver, and F. Vallentin. Invariant semidefinite programs. In M. F. Anjos and J. B. Lasserre, editors,Handbook on Semidefinite, Conic and Polynomial Optimization, page","work_id":"6c37bc45-0369-491e-82bb-616b4ab08cb3","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Bailey.Association Schemes: Designed Experiments, Algebra, and Combi- natorics","work_id":"2d8c4922-50ce-4766-a0c7-e25f45c270f8","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"E. Bannai. An introduction to association schemes.Methods of Discrete Mathematics (eds. S. Löwe, F. Mazzocca, N. Melone and U. Ott), Quaderni di Mathematica, 5:1–70, 1999","work_id":"645bfb1b-2113-4e6e-aa70-2012d4ede2a0","year":1999}],"snapshot_sha256":"845df6b5985da8194f4f8bc8ace0b20ecca46751b54de677d8894359ec29b357"},"source":{"id":"2505.10548","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-22T14:23:11.754873Z","id":"7f088869-a312-489d-a936-fb0fb269c2fb","model_set":{"reader":"grok-4.3"},"one_line_summary":"SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Semidefinite programming bounds the fractional cut-cover of graphs in association schemes by their smallest eigenvalue.","strongest_claim":"We use semidefinite programming to bound the fractional cut-cover parameter of graphs in association schemes in terms of their smallest eigenvalue.","weakest_assumption":"The graphs under consideration belong to an association scheme or coherent configuration, which supplies the algebraic structure needed to formulate the SDP and relate it to the smallest eigenvalue."}},"verdict_id":"7f088869-a312-489d-a936-fb0fb269c2fb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f36d132923d367fc8e42b6a53fb859b21acdb14365a0fab50d751721893ab803","target":"record","created_at":"2026-06-08T01:03:44Z","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":"46c342f25d485b89197a368b17be68e7a2024a85a1006f7248d6aea1ef68fb72","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-15T17:56:11Z","title_canon_sha256":"bcabc3a70ea93c5e66f0bdd1bcdaedbeed65cb3c91daf2ec6287e81b962603ff"},"schema_version":"1.0","source":{"id":"2505.10548","kind":"arxiv","version":4}},"canonical_sha256":"1f6361e1d4cab712bd228ecc4372b9477a8bbb9e15b0c8ceb219b22f626af1e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6361e1d4cab712bd228ecc4372b9477a8bbb9e15b0c8ceb219b22f626af1e7","first_computed_at":"2026-06-08T01:03:44.358693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-08T01:03:44.358693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"55NRdBNXk7+rZdXLxLwDI1s0jKV+2FtMLvdnYLRJmR6iOPcyc/SGrui+twt/dV6rcp5IFwqhv0o0DQYsqbOrAQ==","signature_status":"signed_v1","signed_at":"2026-06-08T01:03:44.359522Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.10548","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f36d132923d367fc8e42b6a53fb859b21acdb14365a0fab50d751721893ab803","sha256:205e0f9a668bc220f05d46317154558efe36e8e1c32677d994608e9fd4f7ce13"],"state_sha256":"e70788865133ca532d5865d1e0468f0b423df4961f59cece3cec4663428ff78d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbcdL8Zpydr+ICwkCvvrunI4/HoW7jMHIgO3+fnhKoEQKJ6ItJ5Apvz6bQ3JPtfv+TOJP1pH3Hjaa2jrK6F0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:54:52.811134Z","bundle_sha256":"2ea81988c5fa8c8706bd3706cbf171113d2d1ca82aff5966b3c795a83d999831"}}