{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MZV4EM5RVEHKSGPEZ6RPCM4MTW","short_pith_number":"pith:MZV4EM5R","canonical_record":{"source":{"id":"2505.13749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"b6beb02dfbab1ad8fd960897dbaf8b301b3879596a22394c51b016a1e9507e08","abstract_canon_sha256":"86f4d8a509fdc0a65a7a43f7ae128f39d8a33bab3188872bec89c5ee6fba25ae"},"schema_version":"1.0"},"canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","source":{"kind":"arxiv","id":"2505.13749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.13749","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.13749v1","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13749","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"MZV4EM5RVEHK","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"MZV4EM5RVEHKSGPE","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"MZV4EM5R","created_at":"2026-07-05T11:05:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MZV4EM5RVEHKSGPEZ6RPCM4MTW","target":"record","payload":{"canonical_record":{"source":{"id":"2505.13749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"b6beb02dfbab1ad8fd960897dbaf8b301b3879596a22394c51b016a1e9507e08","abstract_canon_sha256":"86f4d8a509fdc0a65a7a43f7ae128f39d8a33bab3188872bec89c5ee6fba25ae"},"schema_version":"1.0"},"canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:50.568907Z","signature_b64":"ETsi+Vko1PjaPj6b1kRSy9WFpyrL8fQQzbSVBMIZ24SUfLMpzsD7lAOD/FJSOCLG3gW3IlRTi/LHecVFcq6ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","last_reissued_at":"2026-07-05T11:05:50.568460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:50.568460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.13749","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-07-05T11:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fwgw71MA5hByjQ2nwsOFAXDykwwNXDNnyphzcV6VTKD9f06UQ1ySIH1AcRicX+M2s0UwhuHslANi4Fg/+zB8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T12:48:20.507660Z"},"content_sha256":"4237e35f151242ab436a760d9fd5f8333e6797355647fcf9f6a9cbad44a0d3c7","schema_version":"1.0","event_id":"sha256:4237e35f151242ab436a760d9fd5f8333e6797355647fcf9f6a9cbad44a0d3c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MZV4EM5RVEHKSGPEZ6RPCM4MTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche, Henry Sinclair-Banks, Yousef Shakiba","submitted_at":"2025-05-19T21:52:56Z","abstract_excerpt":"In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose to place these problems in a more general context, which makes it possible to prove complexity dichotomies.\n  The more general setting arises as follows. We note that for coverability, we are given a vector $t$ and are asked if there is a reachable vector $x$ satisfying the relation $x\\ge t$. For reachability, we want to satisfy the relation $x=t$. In the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13749","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/2505.13749/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-05T11:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6O0VEGtl6r7A0QEIOqzmMnDCd0lDcKCMN18ce6vrI6IlFuwDzAv99wOic5/1ITQOYtO0JSPJg6xi2M4bqNRfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T12:48:20.508175Z"},"content_sha256":"892c4683a509421230d365ca145d3a73adfbc4195db0ed56d46e4d557a0a5344","schema_version":"1.0","event_id":"sha256:892c4683a509421230d365ca145d3a73adfbc4195db0ed56d46e4d557a0a5344"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/bundle.json","state_url":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/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-12T12:48:20Z","links":{"resolver":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW","bundle":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/bundle.json","state":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MZV4EM5RVEHKSGPEZ6RPCM4MTW","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":"86f4d8a509fdc0a65a7a43f7ae128f39d8a33bab3188872bec89c5ee6fba25ae","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","title_canon_sha256":"b6beb02dfbab1ad8fd960897dbaf8b301b3879596a22394c51b016a1e9507e08"},"schema_version":"1.0","source":{"id":"2505.13749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.13749","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2505.13749v1","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13749","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"MZV4EM5RVEHK","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"MZV4EM5RVEHKSGPE","created_at":"2026-07-05T11:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"MZV4EM5R","created_at":"2026-07-05T11:05:50Z"}],"graph_snapshots":[{"event_id":"sha256:892c4683a509421230d365ca145d3a73adfbc4195db0ed56d46e4d557a0a5344","target":"graph","created_at":"2026-07-05T11:05:50Z","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/2505.13749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose to place these problems in a more general context, which makes it possible to prove complexity dichotomies.\n  The more general setting arises as follows. We note that for coverability, we are given a vector $t$ and are asked if there is a reachable vector $x$ satisfying the relation $x\\ge t$. For reachability, we want to satisfy the relation $x=t$. In the m","authors_text":"Georg Zetzsche, Henry Sinclair-Banks, Yousef Shakiba","cross_cats":["cs.CC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","title":"A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13749","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:4237e35f151242ab436a760d9fd5f8333e6797355647fcf9f6a9cbad44a0d3c7","target":"record","created_at":"2026-07-05T11:05:50Z","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":"86f4d8a509fdc0a65a7a43f7ae128f39d8a33bab3188872bec89c5ee6fba25ae","cross_cats_sorted":["cs.CC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","title_canon_sha256":"b6beb02dfbab1ad8fd960897dbaf8b301b3879596a22394c51b016a1e9507e08"},"schema_version":"1.0","source":{"id":"2505.13749","kind":"arxiv","version":1}},"canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","first_computed_at":"2026-07-05T11:05:50.568460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:50.568460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ETsi+Vko1PjaPj6b1kRSy9WFpyrL8fQQzbSVBMIZ24SUfLMpzsD7lAOD/FJSOCLG3gW3IlRTi/LHecVFcq6ACw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:50.568907Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.13749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4237e35f151242ab436a760d9fd5f8333e6797355647fcf9f6a9cbad44a0d3c7","sha256:892c4683a509421230d365ca145d3a73adfbc4195db0ed56d46e4d557a0a5344"],"state_sha256":"a898e973c020335b7d7880022d3d3e9d52716c0c085fb6d3382a015d953d2e2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apc8HiuIh6EM3k6e5JYkFLitfwsB4c0Y4SbNldiZxSmVyW5M9DtqXZnX9iEVapTD+I7hbLhx6rXI1L0LbWlwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T12:48:20.515021Z","bundle_sha256":"f6f4498b7e04066ffbac09e59a8f11f59f0deb87ba4cc8a83e456bdc03c96808"}}