{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UYC7RJBPUVOAAGFCCBEYCCEDPK","short_pith_number":"pith:UYC7RJBP","canonical_record":{"source":{"id":"2605.15907","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T12:45:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"798512c731d750f0f4b73426a6cf411a4576968ef38c61c5badadf06be8ce71f","abstract_canon_sha256":"e8b98e0781b0cba2a61cabcf1af90a9a1dbc28e3d14a72bdf91f17851ee2a0b4"},"schema_version":"1.0"},"canonical_sha256":"a605f8a42fa55c0018a210498108837a855e9f161f0121168cc9c8a2ba3ea2a3","source":{"kind":"arxiv","id":"2605.15907","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15907","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15907v1","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15907","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"UYC7RJBPUVOA","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_16","alias_value":"UYC7RJBPUVOAAGFC","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_8","alias_value":"UYC7RJBP","created_at":"2026-05-20T00:01:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UYC7RJBPUVOAAGFCCBEYCCEDPK","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15907","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T12:45:15Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"798512c731d750f0f4b73426a6cf411a4576968ef38c61c5badadf06be8ce71f","abstract_canon_sha256":"e8b98e0781b0cba2a61cabcf1af90a9a1dbc28e3d14a72bdf91f17851ee2a0b4"},"schema_version":"1.0"},"canonical_sha256":"a605f8a42fa55c0018a210498108837a855e9f161f0121168cc9c8a2ba3ea2a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:24.873310Z","signature_b64":"qbI0LZWLlUaSjdDFNfh5pj33rVLB++XxA28S7OoNJ50pVEXIt8naPlKz4beCpJcwTEMyQ97qHviNK98GLH4YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a605f8a42fa55c0018a210498108837a855e9f161f0121168cc9c8a2ba3ea2a3","last_reissued_at":"2026-05-20T00:01:24.872551Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:24.872551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15907","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:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IVjnksaJqeJu7YSVzHH/aeUh8hJybfxcilLaZjvx5yNmlR2t2FKQx2ra50l8QyTwurAxA3ESWkpVLI5M9O9SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:36:35.881479Z"},"content_sha256":"0d15572a8790522985c13b5be645702407e3f4bc16ea64ba2b7e371ef4e66a4b","schema_version":"1.0","event_id":"sha256:0d15572a8790522985c13b5be645702407e3f4bc16ea64ba2b7e371ef4e66a4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UYC7RJBPUVOAAGFCCBEYCCEDPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-indexed network time series with graph Ornstein-Uhlenbeck dynamics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Almut E. D. Veraart, Jiaming Chen","submitted_at":"2026-05-15T12:45:15Z","abstract_excerpt":"We introduce a class of L\\'evy-driven graph Ornstein-Uhlenbeck (grOU) models for edge-indexed network time series. The proposed framework extends generalized network autoregressive (GNAR) processes for edge-indexed network time series to continuous time and adapts graph Ornstein-Uhlenbeck dynamics, originally developed for node-indexed processes, to the edge-indexed setting. The model accommodates general L\\'evy noise and therefore captures both Brownian and jump behavior. We show that the model parameters can be estimated via a maximum-likelihood framework and derive the asymptotic properties"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8cf09d44a969680d02bff59b42123fc85c6e86e2170070aec1376354ccedb0a5"},"source":{"id":"2605.15907","kind":"arxiv","version":1},"verdict":{"id":"408a9e5f-c12a-4196-a77a-9e53a91a0c7f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:11:06.944175Z","strongest_claim":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.","one_line_summary":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension.","pith_extraction_headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15907/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.061360Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:21:19.883505Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:46.560790Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.766457Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"58cdffc3fa422cfba75d2884b17e48edb00fe994d53b9d43aa644303a101830e"},"references":{"count":15,"sample":[{"doi":"","year":2001,"title":"Barndorff-Nielsen, O. E. & Shephard, N. (2001), ‘Non-Gaussian Or nstein–Uhlenbeck-based models and some of their uses in financial economics’, Journal of the Royal Statistical Society: Series B (Statist","work_id":"701fd12c-4ceb-44f0-b15b-481ba4147598","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Christensen, K., Kinnebrock, S. & Podolskij, M. (2010), ‘Pre-aver aging estimators of the ex-post covariance matrix in noisy diffusion models with non-synchro nous data’, Journal of econometrics 159(1)","work_id":"440249ed-c50b-4a44-b1b2-325f434e89a1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Courgeau, V. & Veraart, A. E. (2022 a), ‘High-frequency estimation of the L´ evy-driven graph Ornstein-Uhlenbeck process’, Electronic Journal of Statistics 16(2), 4863–4925","work_id":"b693fecf-7ba1-4d46-9328-01481f1b0793","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Courgeau, V. & Veraart, A. E. (2022 b), ‘Likelihood theory for the graph Ornstein-Uhlenbeck process’, Statistical Inference for Stochastic Processes 25(2), 227–260","work_id":"63f0a12b-dc08-4d20-9b0d-a50a94b01491","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"Epps, T. W. (1979), ‘Comovements in stock prices in the very short run’, Journal of the American Statistical Association 74(366a), 291–298. iti Sato, K. & Yamazato, M. (1984), ‘Operator-selfdecomposab","work_id":"8624d795-760e-4580-a822-ae85478fc6b6","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"fc2b8ed6c78a68afad334adfc15587e5e653573c82f05fcd6561d05c59e06354","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"68413a29ad55701597a0a1c7d8bf97298e4050d766d639fb593b3c9d3685e3ee"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"408a9e5f-c12a-4196-a77a-9e53a91a0c7f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWUk5gPpRmvRokfDyy62g7N1bj/ase07R9IKEkLu7QpLz36BW5+Z6LsvEnU+4r+j9xA1Wiov7DtOkDUuuNGeAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:36:35.882941Z"},"content_sha256":"b945e522bfb43db9e41c63e765233d399ab66ce57f92539d2accab82974d5e98","schema_version":"1.0","event_id":"sha256:b945e522bfb43db9e41c63e765233d399ab66ce57f92539d2accab82974d5e98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/bundle.json","state_url":"https://pith.science/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/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-26T14:36:35Z","links":{"resolver":"https://pith.science/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK","bundle":"https://pith.science/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/bundle.json","state":"https://pith.science/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UYC7RJBPUVOAAGFCCBEYCCEDPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UYC7RJBPUVOAAGFCCBEYCCEDPK","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":"e8b98e0781b0cba2a61cabcf1af90a9a1dbc28e3d14a72bdf91f17851ee2a0b4","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T12:45:15Z","title_canon_sha256":"798512c731d750f0f4b73426a6cf411a4576968ef38c61c5badadf06be8ce71f"},"schema_version":"1.0","source":{"id":"2605.15907","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15907","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15907v1","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15907","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"UYC7RJBPUVOA","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_16","alias_value":"UYC7RJBPUVOAAGFC","created_at":"2026-05-20T00:01:24Z"},{"alias_kind":"pith_short_8","alias_value":"UYC7RJBP","created_at":"2026-05-20T00:01:24Z"}],"graph_snapshots":[{"event_id":"sha256:b945e522bfb43db9e41c63e765233d399ab66ce57f92539d2accab82974d5e98","target":"graph","created_at":"2026-05-20T00:01:24Z","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":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series."}],"snapshot_sha256":"8cf09d44a969680d02bff59b42123fc85c6e86e2170070aec1376354ccedb0a5"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"68413a29ad55701597a0a1c7d8bf97298e4050d766d639fb593b3c9d3685e3ee"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.061360Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:21:19.883505Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:46.560790Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.766457Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15907/integrity.json","findings":[],"snapshot_sha256":"58cdffc3fa422cfba75d2884b17e48edb00fe994d53b9d43aa644303a101830e","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a class of L\\'evy-driven graph Ornstein-Uhlenbeck (grOU) models for edge-indexed network time series. The proposed framework extends generalized network autoregressive (GNAR) processes for edge-indexed network time series to continuous time and adapts graph Ornstein-Uhlenbeck dynamics, originally developed for node-indexed processes, to the edge-indexed setting. The model accommodates general L\\'evy noise and therefore captures both Brownian and jump behavior. We show that the model parameters can be estimated via a maximum-likelihood framework and derive the asymptotic properties","authors_text":"Almut E. D. Veraart, Jiaming Chen","cross_cats":["stat.TH"],"headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T12:45:15Z","title":"Edge-indexed network time series with graph Ornstein-Uhlenbeck dynamics"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Barndorff-Nielsen, O. E. & Shephard, N. (2001), ‘Non-Gaussian Or nstein–Uhlenbeck-based models and some of their uses in financial economics’, Journal of the Royal Statistical Society: Series B (Statist","work_id":"701fd12c-4ceb-44f0-b15b-481ba4147598","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Christensen, K., Kinnebrock, S. & Podolskij, M. (2010), ‘Pre-aver aging estimators of the ex-post covariance matrix in noisy diffusion models with non-synchro nous data’, Journal of econometrics 159(1)","work_id":"440249ed-c50b-4a44-b1b2-325f434e89a1","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Courgeau, V. & Veraart, A. E. (2022 a), ‘High-frequency estimation of the L´ evy-driven graph Ornstein-Uhlenbeck process’, Electronic Journal of Statistics 16(2), 4863–4925","work_id":"b693fecf-7ba1-4d46-9328-01481f1b0793","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Courgeau, V. & Veraart, A. E. (2022 b), ‘Likelihood theory for the graph Ornstein-Uhlenbeck process’, Statistical Inference for Stochastic Processes 25(2), 227–260","work_id":"63f0a12b-dc08-4d20-9b0d-a50a94b01491","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Epps, T. W. (1979), ‘Comovements in stock prices in the very short run’, Journal of the American Statistical Association 74(366a), 291–298. iti Sato, K. & Yamazato, M. (1984), ‘Operator-selfdecomposab","work_id":"8624d795-760e-4580-a822-ae85478fc6b6","year":1979}],"snapshot_sha256":"fc2b8ed6c78a68afad334adfc15587e5e653573c82f05fcd6561d05c59e06354"},"source":{"id":"2605.15907","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T19:11:06.944175Z","id":"408a9e5f-c12a-4196-a77a-9e53a91a0c7f","model_set":{"reader":"grok-4.3"},"one_line_summary":"Proposes Lévy-driven grOU models for edge-indexed network time series, extending GNAR processes to continuous time with MLE estimation, asymptotic results, simulations, and financial data application showing improved forecasting.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Lévy-driven graph Ornstein-Uhlenbeck models extend continuous-time dynamics to edge-indexed network time series.","strongest_claim":"The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.","weakest_assumption":"That the adaptation of graph Ornstein-Uhlenbeck dynamics from node-indexed to edge-indexed processes preserves the key statistical properties (such as stationarity and estimability) needed for the maximum-likelihood framework and asymptotic results to apply, as stated in the abstract's description of the extension."}},"verdict_id":"408a9e5f-c12a-4196-a77a-9e53a91a0c7f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0d15572a8790522985c13b5be645702407e3f4bc16ea64ba2b7e371ef4e66a4b","target":"record","created_at":"2026-05-20T00:01:24Z","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":"e8b98e0781b0cba2a61cabcf1af90a9a1dbc28e3d14a72bdf91f17851ee2a0b4","cross_cats_sorted":["stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2026-05-15T12:45:15Z","title_canon_sha256":"798512c731d750f0f4b73426a6cf411a4576968ef38c61c5badadf06be8ce71f"},"schema_version":"1.0","source":{"id":"2605.15907","kind":"arxiv","version":1}},"canonical_sha256":"a605f8a42fa55c0018a210498108837a855e9f161f0121168cc9c8a2ba3ea2a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a605f8a42fa55c0018a210498108837a855e9f161f0121168cc9c8a2ba3ea2a3","first_computed_at":"2026-05-20T00:01:24.872551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:24.872551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qbI0LZWLlUaSjdDFNfh5pj33rVLB++XxA28S7OoNJ50pVEXIt8naPlKz4beCpJcwTEMyQ97qHviNK98GLH4YCQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:24.873310Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15907","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d15572a8790522985c13b5be645702407e3f4bc16ea64ba2b7e371ef4e66a4b","sha256:b945e522bfb43db9e41c63e765233d399ab66ce57f92539d2accab82974d5e98"],"state_sha256":"ccbb7dd937d30f2f21236a951d24bb72b0731449bbd99f3b4e7078602c9a3673"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K7C3tYPlTCRpYzi1hVRbTeuS86s0TjBi+axrR9LDEuhXOqNVzNkE1NVhGwWIQ0C1LEGKFsrZ6Yxhq2fthB7pCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:36:35.889638Z","bundle_sha256":"17b4de8bb9acba811a7ac28a384899cd71b591b12b53a9afbb9078d5a6afe02c"}}