{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","short_pith_number":"pith:OIGJECWS","canonical_record":{"source":{"id":"2608.13268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-13T14:06:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"81a4e25d92e644384e4fb69280f3a76b673366882095c6f012338a416332de21","abstract_canon_sha256":"b18b20e825c6bef5f09847fb2491d778374dc1e4e87b59f93e793fad0515c552"},"schema_version":"1.0"},"canonical_sha256":"720c920ad28cb76835c8f0bb1cd4a16aa649ef19769f07c0ff7d816bf67ab115","source":{"kind":"arxiv","id":"2608.13268","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13268","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13268v1","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13268","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"OIGJECWSRS3W","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_16","alias_value":"OIGJECWSRS3WQNOI","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_8","alias_value":"OIGJECWS","created_at":"2026-08-14T01:00:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","target":"record","payload":{"canonical_record":{"source":{"id":"2608.13268","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-13T14:06:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"81a4e25d92e644384e4fb69280f3a76b673366882095c6f012338a416332de21","abstract_canon_sha256":"b18b20e825c6bef5f09847fb2491d778374dc1e4e87b59f93e793fad0515c552"},"schema_version":"1.0"},"canonical_sha256":"720c920ad28cb76835c8f0bb1cd4a16aa649ef19769f07c0ff7d816bf67ab115","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T01:00:49.272182Z","signature_b64":"MkwfuIk9C96tfB61UTFru6LNKScO6zrWSSZrbnctxmkCKFT9Xx1hAsjpYd+mP/b1HCHJQKMx1sIJJzyxFoPDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720c920ad28cb76835c8f0bb1cd4a16aa649ef19769f07c0ff7d816bf67ab115","last_reissued_at":"2026-08-14T01:00:49.269935Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T01:00:49.269935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.13268","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-08-14T01:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6+VgtM/vd8+KzDJqICvtVQDGH14VjLr8G9yqqbW5ViC3gRWyMqgLohq4k+RPHytE+luIDqtJIDzbTzY3kgUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:14.740785Z"},"content_sha256":"61ec674594ff5fa6b6ef4c30714c0b52443e511bbb8aa8eaa008351f06f33697","schema_version":"1.0","event_id":"sha256:61ec674594ff5fa6b6ef4c30714c0b52443e511bbb8aa8eaa008351f06f33697"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiobjective Preexpectation Reasoning for Probabilistic Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Benjamin Lucien Kaminski, Hannah Mertens, Joost-Pieter Katoen, Kevin Batz, Lena Verscht, Sebastian Junges","submitted_at":"2026-08-13T14:06:58Z","abstract_excerpt":"Probabilistic programs with nondeterminism model planning problems in which a strategy resolves the nondeterminism to optimize an expected outcome. We study the multiobjective setting, optimizing several outcomes at once along a Pareto front, and provide a deductive, program-level account of strategy synthesis. Its core is a multiobjective preexpectation transformer mapping a tuple of postexpectations to the set of simultaneously achievable values, an element of the convex Hoare powerdomain. It conservatively extends weakest preexpectations and lifts standard loop rules. We develop rules to sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13268","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/2608.13268/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-08-14T01:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpwfR11NMi2bARsI4Vxb89ruh0ejlhcy2xBu6bzcg04DYKmR8YiAb5JZvWJGW3rbcy8jobJOjvqLPHXTfSdFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:14.741333Z"},"content_sha256":"feb69fb50988d240535ebbf708916352cd6e89197bd588a70ef1160904ae693c","schema_version":"1.0","event_id":"sha256:feb69fb50988d240535ebbf708916352cd6e89197bd588a70ef1160904ae693c"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/s1571-0661(05)80746-7 resolves to 'Convex Power Constructions for Continuous D-Cones'. A reader following the printed text alone cannot reach it.","snippet":"Convex power constructions for continuous d-cones. InWorkshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998 (Electronic Notes in Theoretical Computer Science, Vol. 35), Dieter Spreen, Ralf Greb, Holg","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":1998,"verdict_class":"incontrovertible","resolved_title":"Convex Power Constructions for Continuous D-Cones","printed_excerpt":"10.1016/s1571-0661(05)80746-","reconstructed_doi":"10.1016/s1571-0661(05)80746-7"},"severity":"advisory","ref_index":1998,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s1571-0661(05)80746-7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0d5934d5c729fe70bd4bf9bd70afe86cb2b3318628a88d8e26054fa2256b91bc","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Convex Power Constructions for Continuous D-Cones","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19735,"payload_sha256":"4e6edce393650c090f964e06aabb08282af57103406f383eb453b14c81372871","signature_b64":"hXz5s/+/iUiRKNUP8ZHzTmmmneKzQglLAHKNpX87V0HIh3FQgxfuoGiu5rhl9zBlNE2bUYNPa6xfC1HcQ403Cg==","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-08-14T15:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"st4ZH99zEdo8babL68KjEomm0hyat8Cdfv/BncM3Zl5w74Zz6RjC5wfFgOM4Wp7X9/kPhN8gOcp7TKi/yfjSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:14.743869Z"},"content_sha256":"a10fb9ba6261b9f359985d2474d1e7d19f30848134c8fbcf086a4e1dc65de13b","schema_version":"1.0","event_id":"sha256:a10fb9ba6261b9f359985d2474d1e7d19f30848134c8fbcf086a4e1dc65de13b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/IJOC.1100.0419 resolves to 'Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets'. A reader following the printed text alone cannot reach it.","snippet":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets.INFORMS J. Comput.23, 4 (2011), 493–517. https://doi.org/10.1287/IJOC.1100. 0419 R. Tyrrell Rockafellar. 1970.Convex Analysis. Princeton University P","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":32,"verdict_class":"incontrovertible","resolved_title":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets","printed_excerpt":"10.1287/ijoc.1100","reconstructed_doi":"10.1287/IJOC.1100.0419"},"severity":"advisory","ref_index":32,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/IJOC.1100.0419","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ac564beb00c63a8f331fbe30d4e5af933ded53b86386d8c70a09f80f1dc52608","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19734,"payload_sha256":"1cd5c40d620c85aa45c7941890fdfb1c1e8db22a41abaa9710d2956cc4e2856d","signature_b64":"NedezFBBuT3ldAnF+esd5mRvZQ12izRKDJA/AdB/o/yK+ZcAxs7HqwE2zl5FWuAZxcmKg0a9nzgT7vWaT/wNCA==","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-08-14T15:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Yrib4sDryguRVp/1pGWBkTmTDZT7CtUEzIt0IT4v5PmL5OonV1WU01ALkrA1OgK0bBvC8hRQzh0/LqzvmmnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:14.744271Z"},"content_sha256":"e489721caa1fc236192b582426ee09a5a1251166b6795154dcd38ff5b2f24f20","schema_version":"1.0","event_id":"sha256:e489721caa1fc236192b582426ee09a5a1251166b6795154dcd38ff5b2f24f20"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-61739-4_5) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Qualitative Multi-objective Reachability for Ordered Branching MDPs. In Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12448), Sylvain","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-","reconstructed_doi":"10.1007/978-3-030-61739-4_5"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-61739-4_5","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"4a057ddffce78545afb26eb60d213e6363e2c7039707a395f95aeb2076756c31","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19733,"payload_sha256":"7685fb0077223a1a7e26326a17e4b9248dda5d7ef926888f1aa62f35f742260a","signature_b64":"TKa4XgS9D0ineMjKjGPMgJPSKsLvj6tpktn5C/9szPq3dLJovTmN8qeUO/zUdxAya/KvGXShT7MF9Bqt8QbuDg==","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-08-14T15:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9K0l0Q7jMzqHpX4ojTSxjJPulbLTewRGJass4gFFTT9N1hHoPN7s7LXM3SF6eArBKEXvo1d9TSbOTKLBuFQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T04:24:14.744640Z"},"content_sha256":"92293c97e8255ff18b0309eef27e63a633ec49c582c3c7f6d90cad4437611d95","schema_version":"1.0","event_id":"sha256:92293c97e8255ff18b0309eef27e63a633ec49c582c3c7f6d90cad4437611d95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/bundle.json","state_url":"https://pith.science/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/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-08-21T04:24:14Z","links":{"resolver":"https://pith.science/pith/OIGJECWSRS3WQNOI6C5RZVFBNK","bundle":"https://pith.science/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/bundle.json","state":"https://pith.science/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIGJECWSRS3WQNOI6C5RZVFBNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OIGJECWSRS3WQNOI6C5RZVFBNK","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":"b18b20e825c6bef5f09847fb2491d778374dc1e4e87b59f93e793fad0515c552","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-13T14:06:58Z","title_canon_sha256":"81a4e25d92e644384e4fb69280f3a76b673366882095c6f012338a416332de21"},"schema_version":"1.0","source":{"id":"2608.13268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.13268","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"2608.13268v1","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.13268","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"OIGJECWSRS3W","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_16","alias_value":"OIGJECWSRS3WQNOI","created_at":"2026-08-14T01:00:49Z"},{"alias_kind":"pith_short_8","alias_value":"OIGJECWS","created_at":"2026-08-14T01:00:49Z"}],"graph_snapshots":[{"event_id":"sha256:feb69fb50988d240535ebbf708916352cd6e89197bd588a70ef1160904ae693c","target":"graph","created_at":"2026-08-14T01:00:49Z","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/2608.13268/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic programs with nondeterminism model planning problems in which a strategy resolves the nondeterminism to optimize an expected outcome. We study the multiobjective setting, optimizing several outcomes at once along a Pareto front, and provide a deductive, program-level account of strategy synthesis. Its core is a multiobjective preexpectation transformer mapping a tuple of postexpectations to the set of simultaneously achievable values, an element of the convex Hoare powerdomain. It conservatively extends weakest preexpectations and lifts standard loop rules. We develop rules to sy","authors_text":"Benjamin Lucien Kaminski, Hannah Mertens, Joost-Pieter Katoen, Kevin Batz, Lena Verscht, Sebastian Junges","cross_cats":["cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-13T14:06:58Z","title":"Multiobjective Preexpectation Reasoning for Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.13268","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:61ec674594ff5fa6b6ef4c30714c0b52443e511bbb8aa8eaa008351f06f33697","target":"record","created_at":"2026-08-14T01:00:49Z","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":"b18b20e825c6bef5f09847fb2491d778374dc1e4e87b59f93e793fad0515c552","cross_cats_sorted":["cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-08-13T14:06:58Z","title_canon_sha256":"81a4e25d92e644384e4fb69280f3a76b673366882095c6f012338a416332de21"},"schema_version":"1.0","source":{"id":"2608.13268","kind":"arxiv","version":1}},"canonical_sha256":"720c920ad28cb76835c8f0bb1cd4a16aa649ef19769f07c0ff7d816bf67ab115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"720c920ad28cb76835c8f0bb1cd4a16aa649ef19769f07c0ff7d816bf67ab115","first_computed_at":"2026-08-14T01:00:49.269935Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T01:00:49.269935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkwfuIk9C96tfB61UTFru6LNKScO6zrWSSZrbnctxmkCKFT9Xx1hAsjpYd+mP/b1HCHJQKMx1sIJJzyxFoPDBw==","signature_status":"signed_v1","signed_at":"2026-08-14T01:00:49.272182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.13268","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:92293c97e8255ff18b0309eef27e63a633ec49c582c3c7f6d90cad4437611d95","sha256:a10fb9ba6261b9f359985d2474d1e7d19f30848134c8fbcf086a4e1dc65de13b","sha256:e489721caa1fc236192b582426ee09a5a1251166b6795154dcd38ff5b2f24f20"]}],"invalid_events":[],"applied_event_ids":["sha256:61ec674594ff5fa6b6ef4c30714c0b52443e511bbb8aa8eaa008351f06f33697","sha256:feb69fb50988d240535ebbf708916352cd6e89197bd588a70ef1160904ae693c"],"state_sha256":"94dc8660b7ce7ead0f1e468ee3367bd45b75193021a11247067fac0c13b5d22a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/EYQELiKEGNI5T8kmjQuo0sork7bonLwDPcbHAG7sXpdVr+ZERcsACHXKY8XTAa/1iN5CaU16LMviZOkaX3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T04:24:14.747569Z","bundle_sha256":"c0f573b1760fe3268ff0020dcfa8a5d9cf2489f94451f348241c0d1f9b37cf2f"}}