{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JVME5N5JR53QA5BEYA3FRTHYZN","short_pith_number":"pith:JVME5N5J","canonical_record":{"source":{"id":"2605.16755","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T02:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"259a5c80fc8e7ebd88d68461cd211e64b45009e04335da96a0105a6e1bcb9ad0","abstract_canon_sha256":"f86fa8730b9abab7b96099a40b6aa681b906422392ec63f99c1556c615bbad7b"},"schema_version":"1.0"},"canonical_sha256":"4d584eb7a98f77007424c03658ccf8cb61a860fd138161dd63c5cdb357b9dd51","source":{"kind":"arxiv","id":"2605.16755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16755","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16755v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16755","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"JVME5N5JR53Q","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"JVME5N5JR53QA5BE","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"JVME5N5J","created_at":"2026-05-20T00:03:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JVME5N5JR53QA5BEYA3FRTHYZN","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16755","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T02:10:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"259a5c80fc8e7ebd88d68461cd211e64b45009e04335da96a0105a6e1bcb9ad0","abstract_canon_sha256":"f86fa8730b9abab7b96099a40b6aa681b906422392ec63f99c1556c615bbad7b"},"schema_version":"1.0"},"canonical_sha256":"4d584eb7a98f77007424c03658ccf8cb61a860fd138161dd63c5cdb357b9dd51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:20.037203Z","signature_b64":"4F2x6EJQh/bJmdhXG/uDTV+b41j33TdrDVN0siQmEr3ktHVh8L6hKU/6dViOk6m1BYZEEoPQs8AiwcUFxp57Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d584eb7a98f77007424c03658ccf8cb61a860fd138161dd63c5cdb357b9dd51","last_reissued_at":"2026-05-20T00:03:20.036117Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:20.036117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16755","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hEz36tyBXzIiregzx97bwXXx8a1dSYAk+E9rHz7PvtDQE9DoqzaJM6mK3YPmXYR4lI9VT+FkEE2WNRQv+U2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:50:28.860671Z"},"content_sha256":"bbc3cadadda3cc37a31ff26c78da0f9eb726117c648f1331353b5f1afee18b15","schema_version":"1.0","event_id":"sha256:bbc3cadadda3cc37a31ff26c78da0f9eb726117c648f1331353b5f1afee18b15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JVME5N5JR53QA5BEYA3FRTHYZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Unbiased Permutations via Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices.","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Carla P. Gomes, Yimeng Min","submitted_at":"2026-05-16T02:10:35Z","abstract_excerpt":"Learning permutations is fundamental to sorting, ranking, and matching, but existing differentiable methods based on entropy-regularized Sinkhorn produce a single softened solution and collapse under ambiguity. We present PermFlow, a conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory, by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct v"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"A conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct valid permutations, enabling the model to capture multimodal permutation distributions rather than collapsing them to a single mode.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the closed-form tangent-space projector can be computed efficiently and remains numerically stable for the chosen flow schedules, and that the nearest-target coupling strategy is sufficient to train the model to distinguish and recover distinct modes without requiring extra regularization or assumptions on the underlying data distribution.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PermFlow applies conditional flow matching on the affine subspace of doubly stochastic matrices with a closed-form tangent projector and nearest-target coupling to capture multimodal permutation distributions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b44f748da307a8c0ba393bc13aa21985759112a24d0aa32e497654685aef2c17"},"source":{"id":"2605.16755","kind":"arxiv","version":1},"verdict":{"id":"f375d5c7-3741-4b64-8ae9-2702a497673f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:50:12.109022Z","strongest_claim":"A conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct valid permutations, enabling the model to capture multimodal permutation distributions rather than collapsing them to a single mode.","one_line_summary":"PermFlow applies conditional flow matching on the affine subspace of doubly stochastic matrices with a closed-form tangent projector and nearest-target coupling to capture multimodal permutation distributions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the closed-form tangent-space projector can be computed efficiently and remains numerically stable for the chosen flow schedules, and that the nearest-target coupling strategy is sufficient to train the model to distinguish and recover distinct modes without requiring extra regularization or assumptions on the underlying data distribution.","pith_extraction_headline":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16755/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.795486Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:01:02.915877Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.323429Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.454675Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b522754934c62d4653788999bd5f3a26c1943a6c15bc09a47fdaad732a3f0151"},"references":{"count":21,"sample":[{"doi":"","year":null,"title":"Improving and generalizing flow-based generative models with minibatch optimal transport","work_id":"7b689852-603d-46be-aaa5-c38325ba2182","ref_index":1,"cited_arxiv_id":"2302.00482","is_internal_anchor":true},{"doi":"","year":null,"title":"Forty-first international conference on machine learning , year=","work_id":"e8b2b5ad-cc79-4c1f-8154-a6c759a76754","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"f9f7887c-2cac-4e56-87eb-08a3321cfd80","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"91b427e6-acdf-4c9e-a946-983589a7f6e3","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Flow matching on general geometries","work_id":"ffbe7c63-9aed-405e-b074-a6412192fc38","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":21,"snapshot_sha256":"4edd6626ebf49ae355dc68cfece1c1e583cd3925e68e5b9a2f032fc64596710c","internal_anchors":5},"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":"f375d5c7-3741-4b64-8ae9-2702a497673f"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+rYwEPCorMNb7DdOWo8Byz9EDnwwT4hFG22Gk6ndzQTC+dtI72XPtGYt7BzbxeMaHPTCm5EOGt5inblfxBGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:50:28.861285Z"},"content_sha256":"c903a9e2da60a51f438c61469fb5619bd1a225bbf1577613dbb54435cf83bdb7","schema_version":"1.0","event_id":"sha256:c903a9e2da60a51f438c61469fb5619bd1a225bbf1577613dbb54435cf83bdb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVME5N5JR53QA5BEYA3FRTHYZN/bundle.json","state_url":"https://pith.science/pith/JVME5N5JR53QA5BEYA3FRTHYZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVME5N5JR53QA5BEYA3FRTHYZN/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-24T04:50:28Z","links":{"resolver":"https://pith.science/pith/JVME5N5JR53QA5BEYA3FRTHYZN","bundle":"https://pith.science/pith/JVME5N5JR53QA5BEYA3FRTHYZN/bundle.json","state":"https://pith.science/pith/JVME5N5JR53QA5BEYA3FRTHYZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVME5N5JR53QA5BEYA3FRTHYZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JVME5N5JR53QA5BEYA3FRTHYZN","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":"f86fa8730b9abab7b96099a40b6aa681b906422392ec63f99c1556c615bbad7b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T02:10:35Z","title_canon_sha256":"259a5c80fc8e7ebd88d68461cd211e64b45009e04335da96a0105a6e1bcb9ad0"},"schema_version":"1.0","source":{"id":"2605.16755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16755","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16755v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16755","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"JVME5N5JR53Q","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"JVME5N5JR53QA5BE","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"JVME5N5J","created_at":"2026-05-20T00:03:20Z"}],"graph_snapshots":[{"event_id":"sha256:c903a9e2da60a51f438c61469fb5619bd1a225bbf1577613dbb54435cf83bdb7","target":"graph","created_at":"2026-05-20T00:03:20Z","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":"A conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct valid permutations, enabling the model to capture multimodal permutation distributions rather than collapsing them to a single mode."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the closed-form tangent-space projector can be computed efficiently and remains numerically stable for the chosen flow schedules, and that the nearest-target coupling strategy is sufficient to train the model to distinguish and recover distinct modes without requiring extra regularization or assumptions on the underlying data distribution."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PermFlow applies conditional flow matching on the affine subspace of doubly stochastic matrices with a closed-form tangent projector and nearest-target coupling to capture multimodal permutation distributions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices."}],"snapshot_sha256":"b44f748da307a8c0ba393bc13aa21985759112a24d0aa32e497654685aef2c17"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.795486Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:01:02.915877Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.323429Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.454675Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16755/integrity.json","findings":[],"snapshot_sha256":"b522754934c62d4653788999bd5f3a26c1943a6c15bc09a47fdaad732a3f0151","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning permutations is fundamental to sorting, ranking, and matching, but existing differentiable methods based on entropy-regularized Sinkhorn produce a single softened solution and collapse under ambiguity. We present PermFlow, a conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory, by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct v","authors_text":"Carla P. Gomes, Yimeng Min","cross_cats":["cs.AI"],"headline":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T02:10:35Z","title":"Learning Unbiased Permutations via Flow Matching"},"references":{"count":21,"internal_anchors":5,"resolved_work":21,"sample":[{"cited_arxiv_id":"2302.00482","doi":"","is_internal_anchor":true,"ref_index":1,"title":"Improving and generalizing flow-based generative models with minibatch optimal transport","work_id":"7b689852-603d-46be-aaa5-c38325ba2182","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Forty-first international conference on machine learning , year=","work_id":"e8b2b5ad-cc79-4c1f-8154-a6c759a76754","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"f9f7887c-2cac-4e56-87eb-08a3321cfd80","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"91b427e6-acdf-4c9e-a946-983589a7f6e3","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Flow matching on general geometries","work_id":"ffbe7c63-9aed-405e-b074-a6412192fc38","year":null}],"snapshot_sha256":"4edd6626ebf49ae355dc68cfece1c1e583cd3925e68e5b9a2f032fc64596710c"},"source":{"id":"2605.16755","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:50:12.109022Z","id":"f375d5c7-3741-4b64-8ae9-2702a497673f","model_set":{"reader":"grok-4.3"},"one_line_summary":"PermFlow applies conditional flow matching on the affine subspace of doubly stochastic matrices with a closed-form tangent projector and nearest-target coupling to capture multimodal permutation distributions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A flow matching model learns multimodal permutations by projecting trajectories onto the space of unit row and column sum matrices.","strongest_claim":"A conditional flow matching framework that operates directly on the affine subspace of matrices with unit row and column sums. A closed-form tangent-space projector preserves these constraints exactly along every trajectory by construction rather than through iterative correction, and a nearest-target coupling routes distinct noisy initializations toward distinct valid permutations, enabling the model to capture multimodal permutation distributions rather than collapsing them to a single mode.","weakest_assumption":"That the closed-form tangent-space projector can be computed efficiently and remains numerically stable for the chosen flow schedules, and that the nearest-target coupling strategy is sufficient to train the model to distinguish and recover distinct modes without requiring extra regularization or assumptions on the underlying data distribution."}},"verdict_id":"f375d5c7-3741-4b64-8ae9-2702a497673f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bbc3cadadda3cc37a31ff26c78da0f9eb726117c648f1331353b5f1afee18b15","target":"record","created_at":"2026-05-20T00:03:20Z","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":"f86fa8730b9abab7b96099a40b6aa681b906422392ec63f99c1556c615bbad7b","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T02:10:35Z","title_canon_sha256":"259a5c80fc8e7ebd88d68461cd211e64b45009e04335da96a0105a6e1bcb9ad0"},"schema_version":"1.0","source":{"id":"2605.16755","kind":"arxiv","version":1}},"canonical_sha256":"4d584eb7a98f77007424c03658ccf8cb61a860fd138161dd63c5cdb357b9dd51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d584eb7a98f77007424c03658ccf8cb61a860fd138161dd63c5cdb357b9dd51","first_computed_at":"2026-05-20T00:03:20.036117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:20.036117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4F2x6EJQh/bJmdhXG/uDTV+b41j33TdrDVN0siQmEr3ktHVh8L6hKU/6dViOk6m1BYZEEoPQs8AiwcUFxp57Bw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:20.037203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc3cadadda3cc37a31ff26c78da0f9eb726117c648f1331353b5f1afee18b15","sha256:c903a9e2da60a51f438c61469fb5619bd1a225bbf1577613dbb54435cf83bdb7"],"state_sha256":"d127693bedb3ca4a944337cc1b8bd147e2c7ebfc6a14ba2b08ac8983066140c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLIRPtZo4HH5rSmj0JGPRru7Zt6ABlBBo3NWzUhunkufoM65GFaOCvE506sTGKTXS2Tq6ITmHHINnmtDZkWIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:50:28.864368Z","bundle_sha256":"7b54156745720be0012762d5975416166a3bb5a5ad949fdabaa037db3757a355"}}