{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G6725N57OPHTAAK65HJMGGHPIE","short_pith_number":"pith:G6725N57","canonical_record":{"source":{"id":"1306.1069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"69013cad178806a036e6a73efc504c930ca04e186c71a6e7b02f75f3c5e8ddfe","abstract_canon_sha256":"8554e8e1d7e0f9a3837e84ff16511563cc5329dd528583329345c1f5ea4ffca4"},"schema_version":"1.0"},"canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","source":{"kind":"arxiv","id":"1306.1069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1069","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1069v1","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1069","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"G6725N57OPHT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G6725N57OPHTAAK6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G6725N57","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G6725N57OPHTAAK65HJMGGHPIE","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"69013cad178806a036e6a73efc504c930ca04e186c71a6e7b02f75f3c5e8ddfe","abstract_canon_sha256":"8554e8e1d7e0f9a3837e84ff16511563cc5329dd528583329345c1f5ea4ffca4"},"schema_version":"1.0"},"canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:44.445415Z","signature_b64":"Nwve9cZpWEB4ZrHmMlMHhAhMp0+Uge6LKSMmcfFyjatgixEsswJQiSHdJbbWARoAC0ntIcQksOgwQhUiKTB4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","last_reissued_at":"2026-05-18T03:21:44.444676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:44.444676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1069","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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7pO2gi/nXDcpM8EDekORIIQRNV2MHjmRVvkDaPG1z/N+yhqqDERXeZWItZB4ixrTKdM6YQkA/4awYlQ6qryDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:37:37.308790Z"},"content_sha256":"e055f107a512353cc89efa2533c5ecab451becc19c44a8ded0d6b4ecf516c6e1","schema_version":"1.0","event_id":"sha256:e055f107a512353cc89efa2533c5ecab451becc19c44a8ded0d6b4ecf516c6e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G6725N57OPHTAAK65HJMGGHPIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability in Higher-Order-Counters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Heu{\\ss}ner, Alexander Kartzow","submitted_at":"2013-06-05T11:54:53Z","abstract_excerpt":"Higher-order counter automata (\\HOCS) can be either seen as a restriction of higher-order pushdown automata (\\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of \\HOCS: those that can test whether the topmost counter value is zero and those which cannot.\n  We show that control-state reachability for level $k$ \\HOCS with $0$-test is complete for \\mbox{$(k-2)$}-fold exponential space; leaving out the $0$-test leads to completeness for \\mbox{$(k-2)$}-fold exponential time. Restricting \\HOCS (without $0$-test) to level $2$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1069","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-18T03:21:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlDzDgI27pDDy/asrCwC/6/1aPS+5Vi1FKXcuVw6Dm8/w/8Ef0Rlz5qRokDXAjFAAsyckzx2dGxLXTkbnhGZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:37:37.309144Z"},"content_sha256":"c845305b6d9805b2601201c25d32ccee18c67013cc4725353b97f4e5cabfa711","schema_version":"1.0","event_id":"sha256:c845305b6d9805b2601201c25d32ccee18c67013cc4725353b97f4e5cabfa711"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/bundle.json","state_url":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6725N57OPHTAAK65HJMGGHPIE/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-28T05:37:37Z","links":{"resolver":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE","bundle":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/bundle.json","state":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6725N57OPHTAAK65HJMGGHPIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G6725N57OPHTAAK65HJMGGHPIE","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":"8554e8e1d7e0f9a3837e84ff16511563cc5329dd528583329345c1f5ea4ffca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","title_canon_sha256":"69013cad178806a036e6a73efc504c930ca04e186c71a6e7b02f75f3c5e8ddfe"},"schema_version":"1.0","source":{"id":"1306.1069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1069","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1069v1","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1069","created_at":"2026-05-18T03:21:44Z"},{"alias_kind":"pith_short_12","alias_value":"G6725N57OPHT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G6725N57OPHTAAK6","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G6725N57","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:c845305b6d9805b2601201c25d32ccee18c67013cc4725353b97f4e5cabfa711","target":"graph","created_at":"2026-05-18T03:21:44Z","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":"Higher-order counter automata (\\HOCS) can be either seen as a restriction of higher-order pushdown automata (\\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of \\HOCS: those that can test whether the topmost counter value is zero and those which cannot.\n  We show that control-state reachability for level $k$ \\HOCS with $0$-test is complete for \\mbox{$(k-2)$}-fold exponential space; leaving out the $0$-test leads to completeness for \\mbox{$(k-2)$}-fold exponential time. Restricting \\HOCS (without $0$-test) to level $2$","authors_text":"Alexander Heu{\\ss}ner, Alexander Kartzow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","title":"Reachability in Higher-Order-Counters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1069","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:e055f107a512353cc89efa2533c5ecab451becc19c44a8ded0d6b4ecf516c6e1","target":"record","created_at":"2026-05-18T03:21:44Z","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":"8554e8e1d7e0f9a3837e84ff16511563cc5329dd528583329345c1f5ea4ffca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","title_canon_sha256":"69013cad178806a036e6a73efc504c930ca04e186c71a6e7b02f75f3c5e8ddfe"},"schema_version":"1.0","source":{"id":"1306.1069","kind":"arxiv","version":1}},"canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","first_computed_at":"2026-05-18T03:21:44.444676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:44.444676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nwve9cZpWEB4ZrHmMlMHhAhMp0+Uge6LKSMmcfFyjatgixEsswJQiSHdJbbWARoAC0ntIcQksOgwQhUiKTB4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:44.445415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e055f107a512353cc89efa2533c5ecab451becc19c44a8ded0d6b4ecf516c6e1","sha256:c845305b6d9805b2601201c25d32ccee18c67013cc4725353b97f4e5cabfa711"],"state_sha256":"fba6908ced31b630b45b55946e02c6078ac78975bc828a8916eeffeef9b7d7f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBDQf28bs/5iP0kAyIx++C2T1/MkU9Du6mL89mT10mJY9UGtI1XJ7hQYba+4jMnSbPm2glopZJSJSaBgP+GxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:37:37.311119Z","bundle_sha256":"de78ee1195e177068571ba47aa102aea9f2c612e36ae42046c7b78403edf6335"}}