{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YLH3ZWZLA4M3V7OJWHXPYN2SP5","short_pith_number":"pith:YLH3ZWZL","canonical_record":{"source":{"id":"2605.15453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-14T22:35:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6cec1058e737ba18245adec54e28030453db6ed8ae0a75d5b6479a79d0a677b1","abstract_canon_sha256":"8e80d2280d7e82accf3852b1370b4bb198e29e6424dd5d05caee714722e171a3"},"schema_version":"1.0"},"canonical_sha256":"c2cfbcdb2b0719bafdc9b1eefc37527f4edf6a47a5b05aaebacda71884321846","source":{"kind":"arxiv","id":"2605.15453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15453","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15453v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15453","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"YLH3ZWZLA4M3","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"YLH3ZWZLA4M3V7OJ","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"YLH3ZWZL","created_at":"2026-05-20T00:00:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YLH3ZWZLA4M3V7OJWHXPYN2SP5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-14T22:35:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6cec1058e737ba18245adec54e28030453db6ed8ae0a75d5b6479a79d0a677b1","abstract_canon_sha256":"8e80d2280d7e82accf3852b1370b4bb198e29e6424dd5d05caee714722e171a3"},"schema_version":"1.0"},"canonical_sha256":"c2cfbcdb2b0719bafdc9b1eefc37527f4edf6a47a5b05aaebacda71884321846","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:59.400410Z","signature_b64":"Pd9ZhcGnihqt6C9xyt7s3628gq1zydBrTRgRM+aGYJOry2+EF91GMMwDxcACoHpazQ6hD3RkgboRzvDIvFnxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2cfbcdb2b0719bafdc9b1eefc37527f4edf6a47a5b05aaebacda71884321846","last_reissued_at":"2026-05-20T00:00:59.399595Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:59.399595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15453","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJxx7FxKPs70/RndmwH38keySWHxb78r6vqVB2JJtIfGpMQmkpbD0jFvHTTtw58bfX+3nQkmpKVxHb2L3NJfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:47.008902Z"},"content_sha256":"174eab7d84d560554603110bf8e0ca34cfa113b671d0a8102e2679b8c3fec61e","schema_version":"1.0","event_id":"sha256:174eab7d84d560554603110bf8e0ca34cfa113b671d0a8102e2679b8c3fec61e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YLH3ZWZLA4M3V7OJWHXPYN2SP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clique-width and induced topological minors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Amir Nikabadi, Jadwiga Czy\\.zewska, Martin Milani\\v{c}, Pawe{\\l} Rafa{\\l} Bieli\\'nski, Pawe{\\l} Rz\\k{a}\\.zewski","submitted_at":"2026-05-14T22:35:09Z","abstract_excerpt":"A $P_4$ is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique of size four by removing two adjacent edges of the clique. We prove that for a graph $H$, the class of graphs with no induced subdivision of $H$ has bounded clique-width if and only if $H$ is an induced subgraph of $P_4$, the paw, or the diamond. This answers a~question of Dabrowski, Johnson, and Paulusma."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that for a graph H, the class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The 'only if' direction relies on the existence of explicit constructions of graphs with unbounded clique-width that still avoid induced subdivisions of any H outside the three listed graphs; this construction step is invoked in the main theorem statement (abstract).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2d179f99f95bfbd997a3f9b8b0ff503838970be814fa2f8c4725ab928e1e75b0"},"source":{"id":"2605.15453","kind":"arxiv","version":1},"verdict":{"id":"dac1b27d-74b2-4202-8f20-71babc15b4d8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:32:44.739707Z","strongest_claim":"We prove that for a graph H, the class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","one_line_summary":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The 'only if' direction relies on the existence of explicit constructions of graphs with unbounded clique-width that still avoid induced subdivisions of any H outside the three listed graphs; this construction step is invoked in the main theorem statement (abstract).","pith_extraction_headline":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15453/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:55.392462Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:49:52.347209Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.615162Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:50:17.366710Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.107471Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.676189Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9142be800b4414c545c17e96aca53f9bfe172c6756e6e83e36d83f01394a8590"},"references":{"count":18,"sample":[{"doi":"","year":2022,"title":"Induced subgraphs and tree decom- positions I","work_id":"bb6c844d-f5d1-4a0f-a5c4-9855512a96d3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Induced minor free graphs: Isomorphism and clique-width.Algorithmica, 80(1):29–47, 2018","work_id":"c2b3c298-5901-412b-a06b-0de71fa2ec2b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Induced subgraphs and tree decompositions XIX","work_id":"13301095-ff5d-4c19-9ed6-e675d947b890","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Induced subgraphs and tree decompositions XVI","work_id":"7a2b9826-bfe6-4132-a93f-9235c1b42c9a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Excluding induced subdivisions of the bull and related graphs.Journal of Graph Theory, 71(1):49–68, 2012","work_id":"0320cbc3-2a1e-4acd-a0e8-14538c6e60ed","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":18,"snapshot_sha256":"58033e8c602d74144415a7b43ee8f2463462d7abed2a2cb09aead0829fa62312","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b1a636704f340c85e7b2de98f6f3798e61d28b929ef2fd2bb8ad2bbd8acab41e"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"dac1b27d-74b2-4202-8f20-71babc15b4d8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IsCfpwFC2iwt8W6V+yymI971ofxd2Lu4NJTPJ4/k4UPGHv7Uim4ekjcIZEtk9af8TYkDbf6iQpWWZM1KESZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:47.009661Z"},"content_sha256":"34c01257abfa95b74a6719138857ddcb7fb11295490a6a6e07c3ca3ff61ee706","schema_version":"1.0","event_id":"sha256:34c01257abfa95b74a6719138857ddcb7fb11295490a6a6e07c3ca3ff61ee706"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/bundle.json","state_url":"https://pith.science/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/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-21T22:25:47Z","links":{"resolver":"https://pith.science/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5","bundle":"https://pith.science/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/bundle.json","state":"https://pith.science/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLH3ZWZLA4M3V7OJWHXPYN2SP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YLH3ZWZLA4M3V7OJWHXPYN2SP5","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":"8e80d2280d7e82accf3852b1370b4bb198e29e6424dd5d05caee714722e171a3","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-14T22:35:09Z","title_canon_sha256":"6cec1058e737ba18245adec54e28030453db6ed8ae0a75d5b6479a79d0a677b1"},"schema_version":"1.0","source":{"id":"2605.15453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15453","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15453v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15453","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"YLH3ZWZLA4M3","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"YLH3ZWZLA4M3V7OJ","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"YLH3ZWZL","created_at":"2026-05-20T00:00:59Z"}],"graph_snapshots":[{"event_id":"sha256:34c01257abfa95b74a6719138857ddcb7fb11295490a6a6e07c3ca3ff61ee706","target":"graph","created_at":"2026-05-20T00:00:59Z","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 prove that for a graph H, the class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The 'only if' direction relies on the existence of explicit constructions of graphs with unbounded clique-width that still avoid induced subdivisions of any H outside the three listed graphs; this construction step is invoked in the main theorem statement (abstract)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond."}],"snapshot_sha256":"2d179f99f95bfbd997a3f9b8b0ff503838970be814fa2f8c4725ab928e1e75b0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b1a636704f340c85e7b2de98f6f3798e61d28b929ef2fd2bb8ad2bbd8acab41e"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:55.392462Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:49:52.347209Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.615162Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:50:17.366710Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.107471Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.676189Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15453/integrity.json","findings":[],"snapshot_sha256":"9142be800b4414c545c17e96aca53f9bfe172c6756e6e83e36d83f01394a8590","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $P_4$ is a chordless path on four vertices. A diamond is a graph obtained from a clique of size four by removing one edge of the clique. A paw is a graph obtained from a clique of size four by removing two adjacent edges of the clique. We prove that for a graph $H$, the class of graphs with no induced subdivision of $H$ has bounded clique-width if and only if $H$ is an induced subgraph of $P_4$, the paw, or the diamond. This answers a~question of Dabrowski, Johnson, and Paulusma.","authors_text":"Amir Nikabadi, Jadwiga Czy\\.zewska, Martin Milani\\v{c}, Pawe{\\l} Rafa{\\l} Bieli\\'nski, Pawe{\\l} Rz\\k{a}\\.zewski","cross_cats":["math.CO"],"headline":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-14T22:35:09Z","title":"Clique-width and induced topological minors"},"references":{"count":18,"internal_anchors":0,"resolved_work":18,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Induced subgraphs and tree decom- positions I","work_id":"bb6c844d-f5d1-4a0f-a5c4-9855512a96d3","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Induced minor free graphs: Isomorphism and clique-width.Algorithmica, 80(1):29–47, 2018","work_id":"c2b3c298-5901-412b-a06b-0de71fa2ec2b","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Induced subgraphs and tree decompositions XIX","work_id":"13301095-ff5d-4c19-9ed6-e675d947b890","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Induced subgraphs and tree decompositions XVI","work_id":"7a2b9826-bfe6-4132-a93f-9235c1b42c9a","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Excluding induced subdivisions of the bull and related graphs.Journal of Graph Theory, 71(1):49–68, 2012","work_id":"0320cbc3-2a1e-4acd-a0e8-14538c6e60ed","year":2012}],"snapshot_sha256":"58033e8c602d74144415a7b43ee8f2463462d7abed2a2cb09aead0829fa62312"},"source":{"id":"2605.15453","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:32:44.739707Z","id":"dac1b27d-74b2-4202-8f20-71babc15b4d8","model_set":{"reader":"grok-4.3"},"one_line_summary":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, paw, or diamond.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","strongest_claim":"We prove that for a graph H, the class of graphs with no induced subdivision of H has bounded clique-width if and only if H is an induced subgraph of P4, the paw, or the diamond.","weakest_assumption":"The 'only if' direction relies on the existence of explicit constructions of graphs with unbounded clique-width that still avoid induced subdivisions of any H outside the three listed graphs; this construction step is invoked in the main theorem statement (abstract)."}},"verdict_id":"dac1b27d-74b2-4202-8f20-71babc15b4d8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:174eab7d84d560554603110bf8e0ca34cfa113b671d0a8102e2679b8c3fec61e","target":"record","created_at":"2026-05-20T00:00:59Z","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":"8e80d2280d7e82accf3852b1370b4bb198e29e6424dd5d05caee714722e171a3","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-05-14T22:35:09Z","title_canon_sha256":"6cec1058e737ba18245adec54e28030453db6ed8ae0a75d5b6479a79d0a677b1"},"schema_version":"1.0","source":{"id":"2605.15453","kind":"arxiv","version":1}},"canonical_sha256":"c2cfbcdb2b0719bafdc9b1eefc37527f4edf6a47a5b05aaebacda71884321846","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2cfbcdb2b0719bafdc9b1eefc37527f4edf6a47a5b05aaebacda71884321846","first_computed_at":"2026-05-20T00:00:59.399595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:59.399595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pd9ZhcGnihqt6C9xyt7s3628gq1zydBrTRgRM+aGYJOry2+EF91GMMwDxcACoHpazQ6hD3RkgboRzvDIvFnxCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:59.400410Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:174eab7d84d560554603110bf8e0ca34cfa113b671d0a8102e2679b8c3fec61e","sha256:34c01257abfa95b74a6719138857ddcb7fb11295490a6a6e07c3ca3ff61ee706"],"state_sha256":"465c4a917afdf2b284b4bd3739ee9a7fd6947459bf43eb5aa8d39425053e41f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BHVtvPwB4lC82opGLZkpcs3ZEUm703wYpY4KgQPIF7JZnoHdv8CrGvlLW1KjnJROSWHuFEh+f5fkjsY5t+4RDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:25:47.013743Z","bundle_sha256":"416a9c3f6ed0f4e78cad066870e4373c21379c4812958d0bc8020fe56712aa5e"}}