{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:NOOQ3DYVUD4OOHBZYVLK4EM3QD","short_pith_number":"pith:NOOQ3DYV","canonical_record":{"source":{"id":"2010.03444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-07T14:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"6ac1fa5d4d47a6273f693608abcbc73664ecf7f51805a2de25939de5e042b031","abstract_canon_sha256":"1ccb793de823a19fc00ec353433f5ab53dc2a826fd8dcfd9641eb15cbbd52b77"},"schema_version":"1.0"},"canonical_sha256":"6b9d0d8f15a0f8e71c39c556ae119b80d4c28507d26960362c73f46b3d10cf2e","source":{"kind":"arxiv","id":"2010.03444","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03444","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03444v3","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03444","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"NOOQ3DYVUD4O","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_16","alias_value":"NOOQ3DYVUD4OOHBZ","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_8","alias_value":"NOOQ3DYV","created_at":"2026-07-05T02:10:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:NOOQ3DYVUD4OOHBZYVLK4EM3QD","target":"record","payload":{"canonical_record":{"source":{"id":"2010.03444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-07T14:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"6ac1fa5d4d47a6273f693608abcbc73664ecf7f51805a2de25939de5e042b031","abstract_canon_sha256":"1ccb793de823a19fc00ec353433f5ab53dc2a826fd8dcfd9641eb15cbbd52b77"},"schema_version":"1.0"},"canonical_sha256":"6b9d0d8f15a0f8e71c39c556ae119b80d4c28507d26960362c73f46b3d10cf2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:27.022896Z","signature_b64":"JJPULT9Jrz02PalrIQhIlM12GskWny74pu3vq8uID2lTSfmnqMIDt6PI83wAWxMZbJ/vL2utXHMD2PgNf3yOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b9d0d8f15a0f8e71c39c556ae119b80d4c28507d26960362c73f46b3d10cf2e","last_reissued_at":"2026-07-05T02:10:27.022521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:27.022521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.03444","source_version":3,"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-07-05T02:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6znesU6ZawsApVhaKtXxLqHpqf8P0Y2ttp3r4S6H2zD5VRNI0oNA3DY6t8r/EvyfEXjD+vzfVqx5oii/qjhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:04:24.370279Z"},"content_sha256":"6c26b286270c2b501430087f52999556371b88b14c4fefb0ca39b868ecb63d8f","schema_version":"1.0","event_id":"sha256:6c26b286270c2b501430087f52999556371b88b14c4fefb0ca39b868ecb63d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:NOOQ3DYVUD4OOHBZYVLK4EM3QD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Termination Analysis of Polynomial Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ezio Bartocci, Joost-Pieter Katoen, Laura Kov\\'acs, Marcel Moosbrugger","submitted_at":"2020-10-07T14:37:23Z","abstract_excerpt":"The termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps. This paper presents a fully automated approach to the termination analysis of probabilistic while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST is undecidable in general, existing proof rules typically provide sufficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03444","kind":"arxiv","version":3},"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/2010.03444/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-07-05T02:10:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CemRyi8NpSjyFDlUjarmKJv18q6QK1F8Oipqdce6pVAG2js2WRL/aDK6IIpqrmYhevWmsI88qJf8C5V0uNp9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T07:04:24.370666Z"},"content_sha256":"936ee3769187c92e5086d29fed36978aabc70c6064f71b8700225a6c21eca073","schema_version":"1.0","event_id":"sha256:936ee3769187c92e5086d29fed36978aabc70c6064f71b8700225a6c21eca073"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/bundle.json","state_url":"https://pith.science/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/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-07-12T07:04:24Z","links":{"resolver":"https://pith.science/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD","bundle":"https://pith.science/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/bundle.json","state":"https://pith.science/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOOQ3DYVUD4OOHBZYVLK4EM3QD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NOOQ3DYVUD4OOHBZYVLK4EM3QD","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":"1ccb793de823a19fc00ec353433f5ab53dc2a826fd8dcfd9641eb15cbbd52b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-07T14:37:23Z","title_canon_sha256":"6ac1fa5d4d47a6273f693608abcbc73664ecf7f51805a2de25939de5e042b031"},"schema_version":"1.0","source":{"id":"2010.03444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.03444","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.03444v3","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.03444","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_12","alias_value":"NOOQ3DYVUD4O","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_16","alias_value":"NOOQ3DYVUD4OOHBZ","created_at":"2026-07-05T02:10:27Z"},{"alias_kind":"pith_short_8","alias_value":"NOOQ3DYV","created_at":"2026-07-05T02:10:27Z"}],"graph_snapshots":[{"event_id":"sha256:936ee3769187c92e5086d29fed36978aabc70c6064f71b8700225a6c21eca073","target":"graph","created_at":"2026-07-05T02:10:27Z","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/2010.03444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The termination behavior of probabilistic programs depends on the outcomes of random assignments. Almost sure termination (AST) is concerned with the question whether a program terminates with probability one on all possible inputs. Positive almost sure termination (PAST) focuses on termination in a finite expected number of steps. This paper presents a fully automated approach to the termination analysis of probabilistic while-programs whose guards and expressions are polynomial expressions. As proving (positive) AST is undecidable in general, existing proof rules typically provide sufficient","authors_text":"Ezio Bartocci, Joost-Pieter Katoen, Laura Kov\\'acs, Marcel Moosbrugger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-07T14:37:23Z","title":"Automated Termination Analysis of Polynomial Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.03444","kind":"arxiv","version":3},"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:6c26b286270c2b501430087f52999556371b88b14c4fefb0ca39b868ecb63d8f","target":"record","created_at":"2026-07-05T02:10:27Z","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":"1ccb793de823a19fc00ec353433f5ab53dc2a826fd8dcfd9641eb15cbbd52b77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2020-10-07T14:37:23Z","title_canon_sha256":"6ac1fa5d4d47a6273f693608abcbc73664ecf7f51805a2de25939de5e042b031"},"schema_version":"1.0","source":{"id":"2010.03444","kind":"arxiv","version":3}},"canonical_sha256":"6b9d0d8f15a0f8e71c39c556ae119b80d4c28507d26960362c73f46b3d10cf2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b9d0d8f15a0f8e71c39c556ae119b80d4c28507d26960362c73f46b3d10cf2e","first_computed_at":"2026-07-05T02:10:27.022521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:27.022521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJPULT9Jrz02PalrIQhIlM12GskWny74pu3vq8uID2lTSfmnqMIDt6PI83wAWxMZbJ/vL2utXHMD2PgNf3yOCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:27.022896Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.03444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c26b286270c2b501430087f52999556371b88b14c4fefb0ca39b868ecb63d8f","sha256:936ee3769187c92e5086d29fed36978aabc70c6064f71b8700225a6c21eca073"],"state_sha256":"e4b9e3e7cd9f6ab718f75bd9a4a94684a78124ae46bdfeaa0db8d53ed0f55ae1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pH49Y7+Y/EXVsFJk4lCO9Dzme5as1nl3v3/M2DLCQ7UJSbqUIySptkx5skF+dYsC62eVa5FA1DwvNOj9/VyVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T07:04:24.373167Z","bundle_sha256":"b0d5c8990a208d940b1270648fdc7d9c439a728b0d979943f43a7d9c49e771b2"}}