{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:33XR5X5DOAJU5AVOR2CS7WQ7PK","short_pith_number":"pith:33XR5X5D","canonical_record":{"source":{"id":"1712.02120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T10:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"e3ea0319b5092421275044d9a991041c2f1455b6f95629e390460cd418afa403","abstract_canon_sha256":"22988384f89808fae3778538a137b2e121d13d8994cff5ef120c7b8c5a48f94b"},"schema_version":"1.0"},"canonical_sha256":"deef1edfa370134e82ae8e852fda1f7a813ccf16482869b42b3d3ce8c559597b","source":{"kind":"arxiv","id":"1712.02120","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02120","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02120v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02120","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"33XR5X5DOAJU","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"33XR5X5DOAJU5AVO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"33XR5X5D","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:33XR5X5DOAJU5AVOR2CS7WQ7PK","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02120","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T10:37:25Z","cross_cats_sorted":[],"title_canon_sha256":"e3ea0319b5092421275044d9a991041c2f1455b6f95629e390460cd418afa403","abstract_canon_sha256":"22988384f89808fae3778538a137b2e121d13d8994cff5ef120c7b8c5a48f94b"},"schema_version":"1.0"},"canonical_sha256":"deef1edfa370134e82ae8e852fda1f7a813ccf16482869b42b3d3ce8c559597b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:39.126984Z","signature_b64":"mLP8A0/Mxr2ebUaq+JyweP73WXGbIrwdXZCpmu7oyVKNm1pHsY5fY9T9fJrvvqP9oobXdzfLIc4eSBRqmHBPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deef1edfa370134e82ae8e852fda1f7a813ccf16482869b42b3d3ce8c559597b","last_reissued_at":"2026-05-18T00:28:39.126340Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:39.126340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02120","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-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzu1v7IJL+X4DwqcM3Eth3W1WxkP+On1cU6n1gXAu+La7ynFhhZL0e1RC5t7EeHtYmjsVxGwfiCnIt36pX5jBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:53:22.715754Z"},"content_sha256":"b2510d57c893fb2aefe17a974cf5d2edc1d00de3e82b8bc0cd51846516ab79e6","schema_version":"1.0","event_id":"sha256:b2510d57c893fb2aefe17a974cf5d2edc1d00de3e82b8bc0cd51846516ab79e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:33XR5X5DOAJU5AVOR2CS7WQ7PK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform generation of infinite concurrent runs: the case of trace monoids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Samy Abbes, Vincent Jug\\'e","submitted_at":"2017-12-06T10:37:25Z","abstract_excerpt":"We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of a theoretical infinite run, the latter being distributed according to the exact uniform probability measure. The average size of the approximation grows linearly with the time of execution of the algorithm. The execution of the algorithm only involves distributed computations, provided that some - costly - precomputations have been done."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02120","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":""},"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-05-18T00:28:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zi1EeGBDfHNF+yUUVHmTXgjerhPy1ldI3Pog9JBQWSC4ZZI9bxjCq/QEqsJNCJ+e5oIOBFRikFGAz6yL1S/sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:53:22.716091Z"},"content_sha256":"090131a95ae5a77c69927798d7f0b3699e5e9bd0fea1931b2520106a04308236","schema_version":"1.0","event_id":"sha256:090131a95ae5a77c69927798d7f0b3699e5e9bd0fea1931b2520106a04308236"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/bundle.json","state_url":"https://pith.science/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/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-06-02T10:53:22Z","links":{"resolver":"https://pith.science/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK","bundle":"https://pith.science/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/bundle.json","state":"https://pith.science/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33XR5X5DOAJU5AVOR2CS7WQ7PK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:33XR5X5DOAJU5AVOR2CS7WQ7PK","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":"22988384f89808fae3778538a137b2e121d13d8994cff5ef120c7b8c5a48f94b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T10:37:25Z","title_canon_sha256":"e3ea0319b5092421275044d9a991041c2f1455b6f95629e390460cd418afa403"},"schema_version":"1.0","source":{"id":"1712.02120","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02120","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02120v1","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02120","created_at":"2026-05-18T00:28:39Z"},{"alias_kind":"pith_short_12","alias_value":"33XR5X5DOAJU","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"33XR5X5DOAJU5AVO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"33XR5X5D","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:090131a95ae5a77c69927798d7f0b3699e5e9bd0fea1931b2520106a04308236","target":"graph","created_at":"2026-05-18T00:28:39Z","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"},"paper":{"abstract_excerpt":"We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of a theoretical infinite run, the latter being distributed according to the exact uniform probability measure. The average size of the approximation grows linearly with the time of execution of the algorithm. The execution of the algorithm only involves distributed computations, provided that some - costly - precomputations have been done.","authors_text":"Samy Abbes, Vincent Jug\\'e","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T10:37:25Z","title":"Uniform generation of infinite concurrent runs: the case of trace monoids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02120","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:b2510d57c893fb2aefe17a974cf5d2edc1d00de3e82b8bc0cd51846516ab79e6","target":"record","created_at":"2026-05-18T00:28:39Z","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":"22988384f89808fae3778538a137b2e121d13d8994cff5ef120c7b8c5a48f94b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T10:37:25Z","title_canon_sha256":"e3ea0319b5092421275044d9a991041c2f1455b6f95629e390460cd418afa403"},"schema_version":"1.0","source":{"id":"1712.02120","kind":"arxiv","version":1}},"canonical_sha256":"deef1edfa370134e82ae8e852fda1f7a813ccf16482869b42b3d3ce8c559597b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deef1edfa370134e82ae8e852fda1f7a813ccf16482869b42b3d3ce8c559597b","first_computed_at":"2026-05-18T00:28:39.126340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:39.126340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLP8A0/Mxr2ebUaq+JyweP73WXGbIrwdXZCpmu7oyVKNm1pHsY5fY9T9fJrvvqP9oobXdzfLIc4eSBRqmHBPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:39.126984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02120","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2510d57c893fb2aefe17a974cf5d2edc1d00de3e82b8bc0cd51846516ab79e6","sha256:090131a95ae5a77c69927798d7f0b3699e5e9bd0fea1931b2520106a04308236"],"state_sha256":"5b79407381f2d8a63119ba4b973ec181eb4c80573aaa22ac063bc0ce9d504f05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNqs3RHnz1GaDS9AJflT4lwUY+wDv3x1hs1gGEGfO5DieA78HRJkw7QtiVV/EHfzM9mYsSia27KvgPWl5c0tDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:53:22.718032Z","bundle_sha256":"64cba625acfe2aec402f425c50b9db0ea21d5e45ce1bf0574873f80b4bd90cb0"}}