{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","short_pith_number":"pith:W7MEQOPX","canonical_record":{"source":{"id":"2605.23550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"title_canon_sha256":"5c0899b5ce1af5297be0dd1b6f0074a628dd2f60c74bd9c083ef556cd7af4aec","abstract_canon_sha256":"559fe5ddde32785d95fc75ff00cc4a197001190f5043401204b53601ccc5de2a"},"schema_version":"1.0"},"canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","source":{"kind":"arxiv","id":"2605.23550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23550","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23550v1","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23550","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_12","alias_value":"W7MEQOPXMRQB","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_16","alias_value":"W7MEQOPXMRQBRAAP","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_8","alias_value":"W7MEQOPX","created_at":"2026-05-25T02:02:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"title_canon_sha256":"5c0899b5ce1af5297be0dd1b6f0074a628dd2f60c74bd9c083ef556cd7af4aec","abstract_canon_sha256":"559fe5ddde32785d95fc75ff00cc4a197001190f5043401204b53601ccc5de2a"},"schema_version":"1.0"},"canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:00.467990Z","signature_b64":"vDOmYfr6ReXP8YRwzDYs6cWBgG27ScWscywGIwSJH4k4qowvPRgloCAB99ID9hU/FR1InXtRc8Vggut15IoICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","last_reissued_at":"2026-05-25T02:02:00.467051Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:00.467051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23550","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-25T02:02:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uQQRGOCKVf8q/yNT9RFci7scSnVdN0hkkUw9tO8mXjBbQOvgg62IGVY2msb9Ykrw/LIB/VVIaI0jLjnVvLlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:44.150070Z"},"content_sha256":"a7ffb273375a1f30c4d843e0e39d27713d052094c6b9b8139df91462ab5ba6af","schema_version":"1.0","event_id":"sha256:a7ffb273375a1f30c4d843e0e39d27713d052094c6b9b8139df91462ab5ba6af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Yi-Shuai Niu","submitted_at":"2026-05-22T12:16:58Z","abstract_excerpt":"We study nonsmooth difference-of-convex programs whose subtracted convex term is a finite maximum of smooth convex functions. In this setting, standard DCA iterations may converge to critical points that are not directionally stationary, whereas exact active-vertex screening can be expensive when active sets are large or combinatorial. We propose RA-DCA, a vertex-first randomized active-set DCA that projects active gradients onto sampled directions, checks a sampled vertex residual, and uses a small linear program only as a low-residual convex-combination fallback. The method preserves the des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23550","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/2605.23550/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-05-25T02:02:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z4GP+Gd0NxVoo6Lt0kYqAf/PEA6yALIwCBgrTsf65YmoNqwxTmt/QEsalaUUCPQJnwrFDf0G+9jhpRTzwoaFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:44.150838Z"},"content_sha256":"074a1b25accd6f3578b59b723a2d239da4a066c89bb5a657abd870538d4d5ef5","schema_version":"1.0","event_id":"sha256:074a1b25accd6f3578b59b723a2d239da4a066c89bb5a657abd870538d4d5ef5"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","target":"integrity","payload":{"note":"DOI '10.1287/moor' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Mathematics of Operations Research42(1), 95–118 (2017). DOI 10.1287/moor. 2016.0795","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":29,"raw_excerpt":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Mathematics of Operations Research42(1), 95–118 (2017). DOI 10.1287/moor. 2016.0795","verdict_class":"incontrovertible","doi_as_printed":"10.1287/moor"},"severity":"critical","ref_index":29,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/moor","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"a50a65738e62db7904957e37a716ff8034b25debef58250d2812b1dc89e55c14","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7357,"payload_sha256":"12a648394d325cb31c99a5b48bc5064fd54938fc228bfd08c2b68b72ccadc12b","signature_b64":"rkp+D1cZZLV8Kja4LCur1qmThf2CXkSEYhMfqeOvmXqzi9LWzR70SFsYFr46LVpN8T0dSATKKK3OZ9xqppvVCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T04:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ST2GqQv6OU2r5i4HKGzDtG5gJ+8JSIcwxeNYvjyelthj+tFi7c0hP5gUxxJgaN+0tWs43zCoGBgTM91uEcygDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:44.152298Z"},"content_sha256":"9f80950fcfd43eea5c0486b61f1ad4ea6f511c7a048355c8102069ed788ec703","schema_version":"1.0","event_id":"sha256:9f80950fcfd43eea5c0486b61f1ad4ea6f511c7a048355c8102069ed788ec703"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","target":"integrity","payload":{"note":"DOI '10.1016/j.patcog' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognition47(1), 388–401 (2014). DOI 10.1016/j.patcog. 2013.07.012","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":18,"raw_excerpt":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognition47(1), 388–401 (2014). DOI 10.1016/j.patcog. 2013.07.012","verdict_class":"incontrovertible","doi_as_printed":"10.1016/j.patcog"},"severity":"critical","ref_index":18,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.patcog","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"7125005802427aed363679113c5ad9cf44b301bef3febec1770dc9abe9c43a3c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7356,"payload_sha256":"e84364e625a85a732651a3a8a915b424e0d88901db004e57a6dfaf05390b967c","signature_b64":"u610Zo1vMnOCQzfr3mdx2RpD/guYaxNfhA/FAH7uE55iHSTz1FjDDbltxkxveZmFVXYqF3aYTnMcIPkcqjuCCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T04:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LhPSgsRcxSupV2uhC5/xFyvooBaNhIUKhdzn047FNQ5nvqVYFGB4EXtsVxMDVy+NTZjrNym6GUPjFy+/O5dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:44.152782Z"},"content_sha256":"27db5149739fc1f2ada44c84f530ed55ded59e1e58088fd6f6c518a27c5ad606","schema_version":"1.0","event_id":"sha256:27db5149739fc1f2ada44c84f530ed55ded59e1e58088fd6f6c518a27c5ad606"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","target":"integrity","payload":{"note":"DOI '10.1016/j' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition53, 12–24 (2016). DOI 10.1016/j. patcog.2015.11.011","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":3,"raw_excerpt":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition53, 12–24 (2016). DOI 10.1016/j. patcog.2015.11.011","verdict_class":"incontrovertible","doi_as_printed":"10.1016/j"},"severity":"critical","ref_index":3,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"bf86152112832221e2edfa1d686b8f9e3cba6a47f0cd0870af0ec09b48371fca","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7355,"payload_sha256":"4135a99b722d892c892d931c040c1a4eba38e2f9e23e8c7d7c8b4308b2954900","signature_b64":"BFNUFg5t2iDSdmlyo0IZbBDpOMcOxVzjluI2wzFNR8n682B84D3yHIlcDlE4KCUSAok04+ezzVIXJABSTWmMAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T04:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0rph/ssgSxxL7jm61dCJLKe62ebUVnwRjfU0wTvioo+zwyXpGYh40DliZ4G+3rlk85icUMC9el96wZKvMMRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:36:44.153241Z"},"content_sha256":"92a512709a896614acfc71d894664b56d00b285c6971ff29cc7133ca3e58ee47","schema_version":"1.0","event_id":"sha256:92a512709a896614acfc71d894664b56d00b285c6971ff29cc7133ca3e58ee47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/bundle.json","state_url":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/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-05-26T01:36:44Z","links":{"resolver":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND","bundle":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/bundle.json","state":"https://pith.science/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7MEQOPXMRQBRAAPWS32HSY2ND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W7MEQOPXMRQBRAAPWS32HSY2ND","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"559fe5ddde32785d95fc75ff00cc4a197001190f5043401204b53601ccc5de2a","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","title_canon_sha256":"5c0899b5ce1af5297be0dd1b6f0074a628dd2f60c74bd9c083ef556cd7af4aec"},"schema_version":"1.0","source":{"id":"2605.23550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23550","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23550v1","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23550","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_12","alias_value":"W7MEQOPXMRQB","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_16","alias_value":"W7MEQOPXMRQBRAAP","created_at":"2026-05-25T02:02:00Z"},{"alias_kind":"pith_short_8","alias_value":"W7MEQOPX","created_at":"2026-05-25T02:02:00Z"}],"graph_snapshots":[{"event_id":"sha256:074a1b25accd6f3578b59b723a2d239da4a066c89bb5a657abd870538d4d5ef5","target":"graph","created_at":"2026-05-25T02:02:00Z","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/2605.23550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study nonsmooth difference-of-convex programs whose subtracted convex term is a finite maximum of smooth convex functions. In this setting, standard DCA iterations may converge to critical points that are not directionally stationary, whereas exact active-vertex screening can be expensive when active sets are large or combinatorial. We propose RA-DCA, a vertex-first randomized active-set DCA that projects active gradients onto sampled directions, checks a sampled vertex residual, and uses a small linear program only as a low-residual convex-combination fallback. The method preserves the des","authors_text":"Yi-Shuai Niu","cross_cats":["cs.AI","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","title":"RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23550","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:a7ffb273375a1f30c4d843e0e39d27713d052094c6b9b8139df91462ab5ba6af","target":"record","created_at":"2026-05-25T02:02:00Z","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":"559fe5ddde32785d95fc75ff00cc4a197001190f5043401204b53601ccc5de2a","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-22T12:16:58Z","title_canon_sha256":"5c0899b5ce1af5297be0dd1b6f0074a628dd2f60c74bd9c083ef556cd7af4aec"},"schema_version":"1.0","source":{"id":"2605.23550","kind":"arxiv","version":1}},"canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7d84839f7646018800fb4b7a3cb1a68dff5c65c362ce9a03187e4d1eab49ce0","first_computed_at":"2026-05-25T02:02:00.467051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:00.467051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDOmYfr6ReXP8YRwzDYs6cWBgG27ScWscywGIwSJH4k4qowvPRgloCAB99ID9hU/FR1InXtRc8Vggut15IoICA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:00.467990Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23550","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:27db5149739fc1f2ada44c84f530ed55ded59e1e58088fd6f6c518a27c5ad606","sha256:92a512709a896614acfc71d894664b56d00b285c6971ff29cc7133ca3e58ee47","sha256:9f80950fcfd43eea5c0486b61f1ad4ea6f511c7a048355c8102069ed788ec703"]}],"invalid_events":[],"applied_event_ids":["sha256:a7ffb273375a1f30c4d843e0e39d27713d052094c6b9b8139df91462ab5ba6af","sha256:074a1b25accd6f3578b59b723a2d239da4a066c89bb5a657abd870538d4d5ef5"],"state_sha256":"620313f4a0042c0fb88b7fe59dfad034c0ae54036d2bec67f873503b45b34753"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1Q6/1FYTNi5JJyRQOolcQYWhlylv+YBSaEpTVtm+6pRMVABD5w54OkGZW5cwhotG1JuuK1ud3Y4UoM7+kOxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:36:44.157773Z","bundle_sha256":"b95a03f26adb46a7a9ae598465d910fc69db811a23f10ddccb9fde33d27c90cd"}}