{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5","short_pith_number":"pith:S6YQVOIW","canonical_record":{"source":{"id":"2605.16948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-16T11:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"c6b86b45251d6fc791c66eabab844f701ad420f70bcadfe51b4005cf06a7c5fd","abstract_canon_sha256":"0a6b69d562e69acffe1097650c590b322198e51e54181093ed9395c0f3efd80b"},"schema_version":"1.0"},"canonical_sha256":"97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6","source":{"kind":"arxiv","id":"2605.16948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16948","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16948v1","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16948","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"S6YQVOIWFW3Q","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"S6YQVOIWFW3Q6O7V","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"S6YQVOIW","created_at":"2026-05-20T00:03:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-16T11:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"c6b86b45251d6fc791c66eabab844f701ad420f70bcadfe51b4005cf06a7c5fd","abstract_canon_sha256":"0a6b69d562e69acffe1097650c590b322198e51e54181093ed9395c0f3efd80b"},"schema_version":"1.0"},"canonical_sha256":"97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:32.385635Z","signature_b64":"/DP/P9p3BGdHwhpuLX5O73aCd9b8U6n679TqYIPCzMSDk3rSZaqLZaN7mYBvsX2PgYBKpB98qmhbODvhyiL1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6","last_reissued_at":"2026-05-20T00:03:32.384877Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:32.384877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16948","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-20T00:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkrWx4igENdBB665U2X9wv52RdXOR61h1Tipd4xiVV3Ey6Ai4wOyWpofkz8gMTxYDcvNhZzplCOeuAqNQJhsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:40:30.595862Z"},"content_sha256":"aefed155a44a579c95929a0ba226f7fa1ec144e8f629a1947098874f0f185c58","schema_version":"1.0","event_id":"sha256:aefed155a44a579c95929a0ba226f7fa1ec144e8f629a1947098874f0f185c58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early.","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kaiqiang Yu, Kewu Yang, Shengxin Liu, Zhaoquan Gu","submitted_at":"2026-05-16T11:58:39Z","abstract_excerpt":"The $k$-defective clique model relaxes the strict completeness constraint of the traditional clique by allowing up to $k$ missing edges, providing a robust formulation for detecting cohesive structures in noisy graphs. Consequently, the maximum $k$-defective clique problem has attracted significant attention. State-of-the-art exact algorithms predominantly adopt the branch-and-bound framework, which recursively partitions the current problem instance (or branch) into two sub-problems via a branching procedure, until each sub-problem becomes trivially solvable. However, this strategy often lead"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"BBRes achieves an improved theoretical worst-case time complexity and at least 2X speedup over state-of-the-art methods on a substantial fraction of the datasets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The claim that a non-trivial fraction of intermediate sub-problems generated during branching are both non-trivial and solvable in polynomial time by the specialized solver, allowing the early-termination rule to prune the search tree without missing optimal solutions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3b331225fa05b7b6a5c85cd841a318a2cc550b56d655843f0d238a4a993a8539"},"source":{"id":"2605.16948","kind":"arxiv","version":1},"verdict":{"id":"1badd9dc-24d7-40ef-9f28-578790ce9c36","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:04:06.536867Z","strongest_claim":"BBRes achieves an improved theoretical worst-case time complexity and at least 2X speedup over state-of-the-art methods on a substantial fraction of the datasets.","one_line_summary":"BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The claim that a non-trivial fraction of intermediate sub-problems generated during branching are both non-trivial and solvable in polynomial time by the specialized solver, allowing the early-termination rule to prune the search tree without missing optimal solutions.","pith_extraction_headline":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16948/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T20:21:56.552627Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.922941Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:10:41.618919Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.240766Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.323943Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"c1ee06bd1dc80ee50818029d66d133be153875878fb0200806c508d364a734b2"},"references":{"count":62,"sample":[{"doi":"","year":null,"title":"https://github.com/Thaumaturge2020/ BBRes/","work_id":"75519b28-383c-47e5-85d7-c0a1b902898a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Mohiuddin Ahmed, Abdun Naser Mahmood, and Md Rafiqul Islam. 2016. A survey of anomaly detection techniques in financial domain.Future Generation Computer Systems55 (2016), 278–288","work_id":"1e6e1486-3fbe-413f-a0bf-2e6d7de6df91","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993.Network Flows: Theory, Algorithms, and Applications. Prentice Hall","work_id":"acbde12c-ab27-4fc4-939b-921e4e1738d5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1995,"title":"Ravindra K Ahuja and James B Orlin. 1995. A capacity scaling algorithm for the constrained maximum flow problem.Networks25, 2 (1995), 89–98","work_id":"8d2ba6cf-7740-481d-b4c7-313621cf9d93","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Ravindra K Ahujia, Thomas L Magnanti, and James B Orlin. 1993. Network flows: Theory, algorithms and applications.New Jersey: Rentice-Hall3 (1993)","work_id":"15dbcd86-f05f-4c3c-ad49-bc5a34df806e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":62,"snapshot_sha256":"d3dca8fbcb6a83d0f1a8ae70c74a249c153b31f6bc517d0684ca5b2c4c6486ce","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c0f7bdec2ce11070f2d92e21b93afb4a7b28ba15062f206ce6343061ef7d45c6"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"1badd9dc-24d7-40ef-9f28-578790ce9c36"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyvqqPi5AKJUY3vSx/MEQZTSzE7xliD8DjlZ2i9r6BoYWcFFMpSmC5Asi/M+zagjh8BcRwTiBkzHqHeM0N0NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:40:30.596613Z"},"content_sha256":"3246acf2b0f1f6ce241fdab7dfdd31f3cf51d72cf35ccbe932a0622f93440da8","schema_version":"1.0","event_id":"sha256:3246acf2b0f1f6ce241fdab7dfdd31f3cf51d72cf35ccbe932a0622f93440da8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/bundle.json","state_url":"https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/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-03T05:40:30Z","links":{"resolver":"https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5","bundle":"https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/bundle.json","state":"https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5","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":"0a6b69d562e69acffe1097650c590b322198e51e54181093ed9395c0f3efd80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-16T11:58:39Z","title_canon_sha256":"c6b86b45251d6fc791c66eabab844f701ad420f70bcadfe51b4005cf06a7c5fd"},"schema_version":"1.0","source":{"id":"2605.16948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16948","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16948v1","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16948","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"S6YQVOIWFW3Q","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"S6YQVOIWFW3Q6O7V","created_at":"2026-05-20T00:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"S6YQVOIW","created_at":"2026-05-20T00:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:3246acf2b0f1f6ce241fdab7dfdd31f3cf51d72cf35ccbe932a0622f93440da8","target":"graph","created_at":"2026-05-20T00:03:32Z","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":"BBRes achieves an improved theoretical worst-case time complexity and at least 2X speedup over state-of-the-art methods on a substantial fraction of the datasets."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The claim that a non-trivial fraction of intermediate sub-problems generated during branching are both non-trivial and solvable in polynomial time by the specialized solver, allowing the early-termination rule to prune the search tree without missing optimal solutions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early."}],"snapshot_sha256":"3b331225fa05b7b6a5c85cd841a318a2cc550b56d655843f0d238a4a993a8539"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c0f7bdec2ce11070f2d92e21b93afb4a7b28ba15062f206ce6343061ef7d45c6"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T20:21:56.552627Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.922941Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:10:41.618919Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.240766Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.323943Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16948/integrity.json","findings":[],"snapshot_sha256":"c1ee06bd1dc80ee50818029d66d133be153875878fb0200806c508d364a734b2","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $k$-defective clique model relaxes the strict completeness constraint of the traditional clique by allowing up to $k$ missing edges, providing a robust formulation for detecting cohesive structures in noisy graphs. Consequently, the maximum $k$-defective clique problem has attracted significant attention. State-of-the-art exact algorithms predominantly adopt the branch-and-bound framework, which recursively partitions the current problem instance (or branch) into two sub-problems via a branching procedure, until each sub-problem becomes trivially solvable. However, this strategy often lead","authors_text":"Kaiqiang Yu, Kewu Yang, Shengxin Liu, Zhaoquan Gu","cross_cats":[],"headline":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-16T11:58:39Z","title":"Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound"},"references":{"count":62,"internal_anchors":0,"resolved_work":62,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"https://github.com/Thaumaturge2020/ BBRes/","work_id":"75519b28-383c-47e5-85d7-c0a1b902898a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Mohiuddin Ahmed, Abdun Naser Mahmood, and Md Rafiqul Islam. 2016. A survey of anomaly detection techniques in financial domain.Future Generation Computer Systems55 (2016), 278–288","work_id":"1e6e1486-3fbe-413f-a0bf-2e6d7de6df91","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993.Network Flows: Theory, Algorithms, and Applications. Prentice Hall","work_id":"acbde12c-ab27-4fc4-939b-921e4e1738d5","year":1993},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Ravindra K Ahuja and James B Orlin. 1995. A capacity scaling algorithm for the constrained maximum flow problem.Networks25, 2 (1995), 89–98","work_id":"8d2ba6cf-7740-481d-b4c7-313621cf9d93","year":1995},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Ravindra K Ahujia, Thomas L Magnanti, and James B Orlin. 1993. Network flows: Theory, algorithms and applications.New Jersey: Rentice-Hall3 (1993)","work_id":"15dbcd86-f05f-4c3c-ad49-bc5a34df806e","year":1993}],"snapshot_sha256":"d3dca8fbcb6a83d0f1a8ae70c74a249c153b31f6bc517d0684ca5b2c4c6486ce"},"source":{"id":"2605.16948","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:04:06.536867Z","id":"1badd9dc-24d7-40ef-9f28-578790ce9c36","model_set":{"reader":"grok-4.3"},"one_line_summary":"BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early.","strongest_claim":"BBRes achieves an improved theoretical worst-case time complexity and at least 2X speedup over state-of-the-art methods on a substantial fraction of the datasets.","weakest_assumption":"The claim that a non-trivial fraction of intermediate sub-problems generated during branching are both non-trivial and solvable in polynomial time by the specialized solver, allowing the early-termination rule to prune the search tree without missing optimal solutions."}},"verdict_id":"1badd9dc-24d7-40ef-9f28-578790ce9c36"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aefed155a44a579c95929a0ba226f7fa1ec144e8f629a1947098874f0f185c58","target":"record","created_at":"2026-05-20T00:03:32Z","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":"0a6b69d562e69acffe1097650c590b322198e51e54181093ed9395c0f3efd80b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-05-16T11:58:39Z","title_canon_sha256":"c6b86b45251d6fc791c66eabab844f701ad420f70bcadfe51b4005cf06a7c5fd"},"schema_version":"1.0","source":{"id":"2605.16948","kind":"arxiv","version":1}},"canonical_sha256":"97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6","first_computed_at":"2026-05-20T00:03:32.384877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:32.384877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/DP/P9p3BGdHwhpuLX5O73aCd9b8U6n679TqYIPCzMSDk3rSZaqLZaN7mYBvsX2PgYBKpB98qmhbODvhyiL1Dw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:32.385635Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aefed155a44a579c95929a0ba226f7fa1ec144e8f629a1947098874f0f185c58","sha256:3246acf2b0f1f6ce241fdab7dfdd31f3cf51d72cf35ccbe932a0622f93440da8"],"state_sha256":"8469d5c054395cf844d2f73ff691cde9479385bca2d1668774287630566b2458"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5lF6N95Lv/9sdVk9nKieoQgznEjilK9LD1XOAMtEU6IVAtmEu9nGSYHpF6nS7gzmZJrbQLHucO17fjXRrZpoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:40:30.599687Z","bundle_sha256":"b80a7dc076ee4e647a0837ea684abfb56e772c5970d5f494595001cdc9f742b2"}}