{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:C36CAKC7MZRQCCEVPS7E4EKN3V","short_pith_number":"pith:C36CAKC7","canonical_record":{"source":{"id":"1710.07528","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","cross_cats_sorted":["cs.LO","math.GR"],"title_canon_sha256":"68b99eefb6a235bbedbc477d36b766c1a88e29fd90b6605a86563502bf49e788","abstract_canon_sha256":"9c690d4ad99fc802c84da9cab52c9b130fb294d380a08e40726aa09f879c682f"},"schema_version":"1.0"},"canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","source":{"kind":"arxiv","id":"1710.07528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07528","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07528v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07528","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"C36CAKC7MZRQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C36CAKC7MZRQCCEV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C36CAKC7","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:C36CAKC7MZRQCCEVPS7E4EKN3V","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07528","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","cross_cats_sorted":["cs.LO","math.GR"],"title_canon_sha256":"68b99eefb6a235bbedbc477d36b766c1a88e29fd90b6605a86563502bf49e788","abstract_canon_sha256":"9c690d4ad99fc802c84da9cab52c9b130fb294d380a08e40726aa09f879c682f"},"schema_version":"1.0"},"canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:24.607358Z","signature_b64":"H9o9Lyvi+I3cdvZuxlYM3w8H1C97aBneeGjkluQDEP53RyO43w+7AUuYgm6+m4oYzUCJogt9CGlgWEvem/Q4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","last_reissued_at":"2026-05-18T00:32:24.606700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:24.606700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07528","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:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wGqufWg/rWb2f6KRueFxlNgclTn+w7zYiu4PrJmxC16yU6Hxp/kPFrmBL8lfrlA2orWn8C9AuOnbwHQ/00QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:14:19.630062Z"},"content_sha256":"35c1dfdf7838de5a132eaffa19b2177eaca160b550cc586741a9a2595432f1d1","schema_version":"1.0","event_id":"sha256:35c1dfdf7838de5a132eaffa19b2177eaca160b550cc586741a9a2595432f1d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:C36CAKC7MZRQCCEVPS7E4EKN3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Emptiness Problem for Valence Automata over Graph Monoids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2017-10-20T13:44:30Z","abstract_excerpt":"This work studies which storage mechanisms in automata permit decidability of the emptiness problem. The question is formalized using valence automata, an abstract model of automata in which the storage mechanism is given by a monoid. For each of a variety of storage mechanisms, one can choose a (typically infinite) monoid $M$ such that valence automata over $M$ are equivalent to (one-way) automata with this type of storage. In fact, many important storage mechanisms can be realized by monoids defined by finite graphs, called graph monoids. Examples include pushdown stacks, partially blind cou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07528","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:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xy5jIdTKP5f7WA/2bDAyJnMO04rPrHubomyq6/B6d8X+iwdDfatWf460yh/NToLcYPhPgVDQJ+uMdsLWwxMBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:14:19.630525Z"},"content_sha256":"46bafc65a5099f5298dfef0a772f1bb9775e6b98679865da16d472e2e2abde32","schema_version":"1.0","event_id":"sha256:46bafc65a5099f5298dfef0a772f1bb9775e6b98679865da16d472e2e2abde32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/bundle.json","state_url":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/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-26T19:14:19Z","links":{"resolver":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V","bundle":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/bundle.json","state":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:C36CAKC7MZRQCCEVPS7E4EKN3V","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":"9c690d4ad99fc802c84da9cab52c9b130fb294d380a08e40726aa09f879c682f","cross_cats_sorted":["cs.LO","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","title_canon_sha256":"68b99eefb6a235bbedbc477d36b766c1a88e29fd90b6605a86563502bf49e788"},"schema_version":"1.0","source":{"id":"1710.07528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07528","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07528v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07528","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"C36CAKC7MZRQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"C36CAKC7MZRQCCEV","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"C36CAKC7","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:46bafc65a5099f5298dfef0a772f1bb9775e6b98679865da16d472e2e2abde32","target":"graph","created_at":"2026-05-18T00:32: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This work studies which storage mechanisms in automata permit decidability of the emptiness problem. The question is formalized using valence automata, an abstract model of automata in which the storage mechanism is given by a monoid. For each of a variety of storage mechanisms, one can choose a (typically infinite) monoid $M$ such that valence automata over $M$ are equivalent to (one-way) automata with this type of storage. In fact, many important storage mechanisms can be realized by monoids defined by finite graphs, called graph monoids. Examples include pushdown stacks, partially blind cou","authors_text":"Georg Zetzsche","cross_cats":["cs.LO","math.GR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","title":"The Emptiness Problem for Valence Automata over Graph Monoids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07528","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:35c1dfdf7838de5a132eaffa19b2177eaca160b550cc586741a9a2595432f1d1","target":"record","created_at":"2026-05-18T00:32: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":"9c690d4ad99fc802c84da9cab52c9b130fb294d380a08e40726aa09f879c682f","cross_cats_sorted":["cs.LO","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","title_canon_sha256":"68b99eefb6a235bbedbc477d36b766c1a88e29fd90b6605a86563502bf49e788"},"schema_version":"1.0","source":{"id":"1710.07528","kind":"arxiv","version":1}},"canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","first_computed_at":"2026-05-18T00:32:24.606700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:24.606700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H9o9Lyvi+I3cdvZuxlYM3w8H1C97aBneeGjkluQDEP53RyO43w+7AUuYgm6+m4oYzUCJogt9CGlgWEvem/Q4Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:24.607358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35c1dfdf7838de5a132eaffa19b2177eaca160b550cc586741a9a2595432f1d1","sha256:46bafc65a5099f5298dfef0a772f1bb9775e6b98679865da16d472e2e2abde32"],"state_sha256":"3d29b8dd0fd2f5b6296dd7b4cfa3b62d496cc9c3c8bad20105ea526457d2b1d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sTEqGiD+LzIuj+2BWEizwa2WIMk6Nu7/QrzV7EJrce0eFPx77gL0s7QlJ5vA1Cb34zY109yWvl5+JPet+sE5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:14:19.633969Z","bundle_sha256":"2db76bb888b319a3c0a911c55910fecb0507ac636ae5dc41ddf8091d59542cf5"}}