{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J6CODUW2TAPPA5FLC4WNTTWACC","short_pith_number":"pith:J6CODUW2","canonical_record":{"source":{"id":"1611.08554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-11-25T19:02:23Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"b70054a95139ed449968005ce4ec63a98ae71f4800977e53a55f797a2af74d61","abstract_canon_sha256":"4bbcf1a12dbbf4bb1c19eac2a5eaf63ae8620534f1572795f627a112b5056556"},"schema_version":"1.0"},"canonical_sha256":"4f84e1d2da981ef074ab172cd9cec0109230d176bd0b0b5858af57cedb6dc6f2","source":{"kind":"arxiv","id":"1611.08554","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08554","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08554v2","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08554","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"J6CODUW2TAPP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6CODUW2TAPPA5FL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6CODUW2","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J6CODUW2TAPPA5FLC4WNTTWACC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08554","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-11-25T19:02:23Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"b70054a95139ed449968005ce4ec63a98ae71f4800977e53a55f797a2af74d61","abstract_canon_sha256":"4bbcf1a12dbbf4bb1c19eac2a5eaf63ae8620534f1572795f627a112b5056556"},"schema_version":"1.0"},"canonical_sha256":"4f84e1d2da981ef074ab172cd9cec0109230d176bd0b0b5858af57cedb6dc6f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:47.434733Z","signature_b64":"0bOuxXMQPADzRp0m0dAIsAZwsoZsS5pdUQ+qlHjcIzZNoplk8hnkxya+WT9XTKNOgVVVjcGyPFQcaZ+bqtHPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f84e1d2da981ef074ab172cd9cec0109230d176bd0b0b5858af57cedb6dc6f2","last_reissued_at":"2026-05-18T00:15:47.434087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:47.434087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08554","source_version":2,"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:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkM8YezOR4e4R38FQY2ip91AYcZDS/qmG1IRhIVjwR61LN4IQ//V+Ref0KQ8Dfk9XoIvoJbhXAGCLZiZbzYlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:50:05.066463Z"},"content_sha256":"80664c19e5be0cebec4d1366b542a0694b5fea9c8ae151779e6a08239fbefaaf","schema_version":"1.0","event_id":"sha256:80664c19e5be0cebec4d1366b542a0694b5fea9c8ae151779e6a08239fbefaaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J6CODUW2TAPPA5FLC4WNTTWACC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Fabian Reiter","submitted_at":"2016-11-25T19:02:23Z","abstract_excerpt":"We establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the fragment of the modal $\\mu$-calculus that allows least fixpoints but forbids greatest fixpoints. The corresponding automaton model uses a network of identical finite-state machines that communicate in an asynchronous manner and whose state diagram must be acyclic except for self-loops. Exploiting the connection with logic, we also prove that the expressive power o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08554","kind":"arxiv","version":2},"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:15:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ol0ZP69FEdpzXLxU3og8ipAwkKkb7smEfKo8HPmBV4lx68eR4WmH2fPHA6xp/B/Xm7A3B+aH66Jg0PMFGyFnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:50:05.066819Z"},"content_sha256":"897df6d864fa408f7139e07ec112a02acc9643691456bf4c9162d957662e9cf6","schema_version":"1.0","event_id":"sha256:897df6d864fa408f7139e07ec112a02acc9643691456bf4c9162d957662e9cf6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6CODUW2TAPPA5FLC4WNTTWACC/bundle.json","state_url":"https://pith.science/pith/J6CODUW2TAPPA5FLC4WNTTWACC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6CODUW2TAPPA5FLC4WNTTWACC/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-05T12:50:05Z","links":{"resolver":"https://pith.science/pith/J6CODUW2TAPPA5FLC4WNTTWACC","bundle":"https://pith.science/pith/J6CODUW2TAPPA5FLC4WNTTWACC/bundle.json","state":"https://pith.science/pith/J6CODUW2TAPPA5FLC4WNTTWACC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6CODUW2TAPPA5FLC4WNTTWACC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J6CODUW2TAPPA5FLC4WNTTWACC","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":"4bbcf1a12dbbf4bb1c19eac2a5eaf63ae8620534f1572795f627a112b5056556","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-11-25T19:02:23Z","title_canon_sha256":"b70054a95139ed449968005ce4ec63a98ae71f4800977e53a55f797a2af74d61"},"schema_version":"1.0","source":{"id":"1611.08554","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08554","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08554v2","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08554","created_at":"2026-05-18T00:15:47Z"},{"alias_kind":"pith_short_12","alias_value":"J6CODUW2TAPP","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J6CODUW2TAPPA5FL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J6CODUW2","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:897df6d864fa408f7139e07ec112a02acc9643691456bf4c9162d957662e9cf6","target":"graph","created_at":"2026-05-18T00:15:47Z","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 establish the equivalence between a class of asynchronous distributed automata and a small fragment of least fixpoint logic, when restricted to finite directed graphs. More specifically, the logic we consider is (a variant of) the fragment of the modal $\\mu$-calculus that allows least fixpoints but forbids greatest fixpoints. The corresponding automaton model uses a network of identical finite-state machines that communicate in an asynchronous manner and whose state diagram must be acyclic except for self-loops. Exploiting the connection with logic, we also prove that the expressive power o","authors_text":"Fabian Reiter","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-11-25T19:02:23Z","title":"Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08554","kind":"arxiv","version":2},"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:80664c19e5be0cebec4d1366b542a0694b5fea9c8ae151779e6a08239fbefaaf","target":"record","created_at":"2026-05-18T00:15:47Z","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":"4bbcf1a12dbbf4bb1c19eac2a5eaf63ae8620534f1572795f627a112b5056556","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2016-11-25T19:02:23Z","title_canon_sha256":"b70054a95139ed449968005ce4ec63a98ae71f4800977e53a55f797a2af74d61"},"schema_version":"1.0","source":{"id":"1611.08554","kind":"arxiv","version":2}},"canonical_sha256":"4f84e1d2da981ef074ab172cd9cec0109230d176bd0b0b5858af57cedb6dc6f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f84e1d2da981ef074ab172cd9cec0109230d176bd0b0b5858af57cedb6dc6f2","first_computed_at":"2026-05-18T00:15:47.434087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:47.434087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0bOuxXMQPADzRp0m0dAIsAZwsoZsS5pdUQ+qlHjcIzZNoplk8hnkxya+WT9XTKNOgVVVjcGyPFQcaZ+bqtHPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:47.434733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08554","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80664c19e5be0cebec4d1366b542a0694b5fea9c8ae151779e6a08239fbefaaf","sha256:897df6d864fa408f7139e07ec112a02acc9643691456bf4c9162d957662e9cf6"],"state_sha256":"a5d13f3014d038dfce031e316c5e5e2919857b1a2502c47de9ca84d723350683"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"40hFAQXCw9e/A47mLAsVb9r6QAkl3HRACDOcvNem5UveRT4/bkbfmWE3tkSdWRnJB04Mg9/gJykbQtlo3skzDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:50:05.069302Z","bundle_sha256":"5760ba99663907d7ff1be9826536fac5eb1f651b021d8ec8b2362b7f1229bc70"}}