{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NDTNYNFJIGVPS5WLTEF54KOXQ3","short_pith_number":"pith:NDTNYNFJ","canonical_record":{"source":{"id":"2605.16836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:38:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"02cfcee772304b5209c8df2b85e733b2bd3e56461d3313254814fbd434fa27d5","abstract_canon_sha256":"2f76268368513445656f55c32b0b365465c0c72b856413e8a716f5cd47f4ac7c"},"schema_version":"1.0"},"canonical_sha256":"68e6dc34a941aaf976cb990bde29d786e6bff012d1ea909bab41ffedd67da4b8","source":{"kind":"arxiv","id":"2605.16836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16836","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16836v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16836","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"NDTNYNFJIGVP","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"NDTNYNFJIGVPS5WL","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"NDTNYNFJ","created_at":"2026-05-20T00:03:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NDTNYNFJIGVPS5WLTEF54KOXQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:38:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"02cfcee772304b5209c8df2b85e733b2bd3e56461d3313254814fbd434fa27d5","abstract_canon_sha256":"2f76268368513445656f55c32b0b365465c0c72b856413e8a716f5cd47f4ac7c"},"schema_version":"1.0"},"canonical_sha256":"68e6dc34a941aaf976cb990bde29d786e6bff012d1ea909bab41ffedd67da4b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:25.356855Z","signature_b64":"TWIJfw408rtNQMQG3oNL3CBcL5Bijb0rEh2U2skBFHmuBeBuj/92TDnepXx9+zpH/2JK0Gm0DoCdu/Ye6tFaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e6dc34a941aaf976cb990bde29d786e6bff012d1ea909bab41ffedd67da4b8","last_reissued_at":"2026-05-20T00:03:25.356037Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:25.356037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16836","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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4b58Z2DfUjjIwA/2qk625Fo2lKqRS/Q7co3sEd2zAnzAYTrqrlCpk2zJGTN4xUR2DG+EKrTxVvYbnlIBp3M5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:02:48.369139Z"},"content_sha256":"43e584876e165fbda6814dbb8b136256a1886a51fc602a7bbd2cd46c95a73aae","schema_version":"1.0","event_id":"sha256:43e584876e165fbda6814dbb8b136256a1886a51fc602a7bbd2cd46c95a73aae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NDTNYNFJIGVPS5WLTEF54KOXQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HYVINT: Intensity-Driven Hypergraph Generation with Variational Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism.","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Shuntuo Xu, Xinyi Hong, Zhou Yu","submitted_at":"2026-05-16T06:38:33Z","abstract_excerpt":"Hypergraphs provide a principled framework for modeling polyadic interactions, with applications in recommendation systems, social networks, and molecular modeling. Hypergraph generation remains challenging because incidence structures are discrete, sparse, and governed by heterogeneous higher-order interactions. Existing generators often rely on implicit latent spaces or continuous incidence decoders, which provide limited mechanistic interpretation of how node-hyperedge incidences arise. To address these limitations, we propose HYVINT, an intensity-driven hypergraph generative framework. Our"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"HYVINT achieves strong fidelity while maintaining substantial novelty and diversity on synthetic and real-world hypergraphs, supported by generation error bounds with asymptotic convergence rates.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That linking latent interaction strength to binary incidence via an intensity-driven mechanism supplies a meaningfully more interpretable and accurate model of heterogeneous higher-order interactions than prior implicit latent spaces or continuous decoders.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a6afef9f47f5c396c7931f5a35e7f0474692e6e3a2418609ad2abc9e85747116"},"source":{"id":"2605.16836","kind":"arxiv","version":1},"verdict":{"id":"d8646b23-6b0f-40ab-8f18-d5fb11f308aa","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:56:43.963432Z","strongest_claim":"HYVINT achieves strong fidelity while maintaining substantial novelty and diversity on synthetic and real-world hypergraphs, supported by generation error bounds with asymptotic convergence rates.","one_line_summary":"HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That linking latent interaction strength to binary incidence via an intensity-driven mechanism supplies a meaningfully more interpretable and accurate model of heterogeneous higher-order interactions than prior implicit latent spaces or continuous decoders.","pith_extraction_headline":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16836/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T20:10:48.115663Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.011696Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.251227Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.397693Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8e85a2d49ec62481f97f8fec1ffb9939fbe47833d7f4bae6b7299245a24c4f21"},"references":{"count":53,"sample":[{"doi":"","year":2006,"title":"Learning with hypergraphs: Clustering, classification, and embedding.Advances in neural information processing systems, 19, 2006","work_id":"1aa472a6-12bb-4e15-836b-6a267d938a5a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Molecular hypergraph grammar with its application to molecular optimization","work_id":"5fabc890-7621-4a41-bfb1-f971ccc44b24","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"Evolutionary dynamics of higher-order interactions in social networks.Nature Human Behaviour, 5(5): 586–595, 2021","work_id":"7538cb92-f879-4da6-8622-065b9a65900a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Hypergraph contrastive col- laborative filtering","work_id":"478f9472-b0fc-4652-8503-a61617371ac1","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"scmhnn: a novel hypergraph neural network for integrative analysis of single-cell epigenomic, transcriptomic and proteomic data.Briefings in Bioinformatics, 24(6):bbad391, 2023","work_id":"a58b9b08-30d9-4b21-9a6b-0e24bcd2fdd8","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":53,"snapshot_sha256":"f4710d1a28785fc02f22759eaa463a2f327a923b3cab209a2bf9b69f8d6071b0","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"385dd0f98684f175b3401fe39520314bb4d14ef8031db26172bf572438ad790c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"d8646b23-6b0f-40ab-8f18-d5fb11f308aa"},"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:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JmW/H51UfxnaEUbqQC0pfZhdERVuw6NQsuVI0q7cOM1LpAnJ79V56ujSTZ5RJOUlbGHwbPa4LtExYFm3hKJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:02:48.369848Z"},"content_sha256":"6000a22db86306ecc259cda405e0202e320bc21b49bca7f2cc9bbcdd5f864666","schema_version":"1.0","event_id":"sha256:6000a22db86306ecc259cda405e0202e320bc21b49bca7f2cc9bbcdd5f864666"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/bundle.json","state_url":"https://pith.science/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/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-28T10:02:48Z","links":{"resolver":"https://pith.science/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3","bundle":"https://pith.science/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/bundle.json","state":"https://pith.science/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDTNYNFJIGVPS5WLTEF54KOXQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NDTNYNFJIGVPS5WLTEF54KOXQ3","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":"2f76268368513445656f55c32b0b365465c0c72b856413e8a716f5cd47f4ac7c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:38:33Z","title_canon_sha256":"02cfcee772304b5209c8df2b85e733b2bd3e56461d3313254814fbd434fa27d5"},"schema_version":"1.0","source":{"id":"2605.16836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16836","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16836v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16836","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"NDTNYNFJIGVP","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"NDTNYNFJIGVPS5WL","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"NDTNYNFJ","created_at":"2026-05-20T00:03:25Z"}],"graph_snapshots":[{"event_id":"sha256:6000a22db86306ecc259cda405e0202e320bc21b49bca7f2cc9bbcdd5f864666","target":"graph","created_at":"2026-05-20T00:03:25Z","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":"HYVINT achieves strong fidelity while maintaining substantial novelty and diversity on synthetic and real-world hypergraphs, supported by generation error bounds with asymptotic convergence rates."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That linking latent interaction strength to binary incidence via an intensity-driven mechanism supplies a meaningfully more interpretable and accurate model of heterogeneous higher-order interactions than prior implicit latent spaces or continuous decoders."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism."}],"snapshot_sha256":"a6afef9f47f5c396c7931f5a35e7f0474692e6e3a2418609ad2abc9e85747116"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"385dd0f98684f175b3401fe39520314bb4d14ef8031db26172bf572438ad790c"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:10:48.115663Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:01:19.011696Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.251227Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.397693Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16836/integrity.json","findings":[],"snapshot_sha256":"8e85a2d49ec62481f97f8fec1ffb9939fbe47833d7f4bae6b7299245a24c4f21","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hypergraphs provide a principled framework for modeling polyadic interactions, with applications in recommendation systems, social networks, and molecular modeling. Hypergraph generation remains challenging because incidence structures are discrete, sparse, and governed by heterogeneous higher-order interactions. Existing generators often rely on implicit latent spaces or continuous incidence decoders, which provide limited mechanistic interpretation of how node-hyperedge incidences arise. To address these limitations, we propose HYVINT, an intensity-driven hypergraph generative framework. Our","authors_text":"Shuntuo Xu, Xinyi Hong, Zhou Yu","cross_cats":["cs.LG"],"headline":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:38:33Z","title":"HYVINT: Intensity-Driven Hypergraph Generation with Variational Representations"},"references":{"count":53,"internal_anchors":2,"resolved_work":53,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Learning with hypergraphs: Clustering, classification, and embedding.Advances in neural information processing systems, 19, 2006","work_id":"1aa472a6-12bb-4e15-836b-6a267d938a5a","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Molecular hypergraph grammar with its application to molecular optimization","work_id":"5fabc890-7621-4a41-bfb1-f971ccc44b24","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Evolutionary dynamics of higher-order interactions in social networks.Nature Human Behaviour, 5(5): 586–595, 2021","work_id":"7538cb92-f879-4da6-8622-065b9a65900a","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Hypergraph contrastive col- laborative filtering","work_id":"478f9472-b0fc-4652-8503-a61617371ac1","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"scmhnn: a novel hypergraph neural network for integrative analysis of single-cell epigenomic, transcriptomic and proteomic data.Briefings in Bioinformatics, 24(6):bbad391, 2023","work_id":"a58b9b08-30d9-4b21-9a6b-0e24bcd2fdd8","year":2023}],"snapshot_sha256":"f4710d1a28785fc02f22759eaa463a2f327a923b3cab209a2bf9b69f8d6071b0"},"source":{"id":"2605.16836","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:56:43.963432Z","id":"d8646b23-6b0f-40ab-8f18-d5fb11f308aa","model_set":{"reader":"grok-4.3"},"one_line_summary":"HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"HYVINT generates hypergraphs by linking latent interaction strengths to binary incidences with an intensity-driven mechanism.","strongest_claim":"HYVINT achieves strong fidelity while maintaining substantial novelty and diversity on synthetic and real-world hypergraphs, supported by generation error bounds with asymptotic convergence rates.","weakest_assumption":"That linking latent interaction strength to binary incidence via an intensity-driven mechanism supplies a meaningfully more interpretable and accurate model of heterogeneous higher-order interactions than prior implicit latent spaces or continuous decoders."}},"verdict_id":"d8646b23-6b0f-40ab-8f18-d5fb11f308aa"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:43e584876e165fbda6814dbb8b136256a1886a51fc602a7bbd2cd46c95a73aae","target":"record","created_at":"2026-05-20T00:03:25Z","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":"2f76268368513445656f55c32b0b365465c0c72b856413e8a716f5cd47f4ac7c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-05-16T06:38:33Z","title_canon_sha256":"02cfcee772304b5209c8df2b85e733b2bd3e56461d3313254814fbd434fa27d5"},"schema_version":"1.0","source":{"id":"2605.16836","kind":"arxiv","version":1}},"canonical_sha256":"68e6dc34a941aaf976cb990bde29d786e6bff012d1ea909bab41ffedd67da4b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e6dc34a941aaf976cb990bde29d786e6bff012d1ea909bab41ffedd67da4b8","first_computed_at":"2026-05-20T00:03:25.356037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:25.356037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TWIJfw408rtNQMQG3oNL3CBcL5Bijb0rEh2U2skBFHmuBeBuj/92TDnepXx9+zpH/2JK0Gm0DoCdu/Ye6tFaAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:25.356855Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e584876e165fbda6814dbb8b136256a1886a51fc602a7bbd2cd46c95a73aae","sha256:6000a22db86306ecc259cda405e0202e320bc21b49bca7f2cc9bbcdd5f864666"],"state_sha256":"8380d8e2d61cc4603c549d755a5ae591737d34a26bf6dae7e152273e4756195a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrU2PPOummirT8pHQlCWLSi7HGhBmWGd64dFW+gJiujRt6oWuuxkuNKlkgVuFLxGKkYXXgoyvy5nY3dHq0VdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:02:48.372653Z","bundle_sha256":"0389ded9b3bac73eab56b20e008794cf45130f605322a8658b53082da06a64f8"}}