{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6HF23WFGJ6TJAYVWTQBJXRIZLA","short_pith_number":"pith:6HF23WFG","canonical_record":{"source":{"id":"1605.05836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-19T07:34:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d236c070397f75c288a17de5d75760747c5880730c0b4a8590a9218d6bf440fe","abstract_canon_sha256":"308b18d90aa3281c92d71b5429da8f6e7ce7a9c1edbdcd1e686fcd7908250209"},"schema_version":"1.0"},"canonical_sha256":"f1cbadd8a64fa69062b69c029bc51958160f062de176898f3c2ed5ae21c044a9","source":{"kind":"arxiv","id":"1605.05836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05836","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05836v1","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05836","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"6HF23WFGJ6TJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HF23WFGJ6TJAYVW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HF23WFG","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6HF23WFGJ6TJAYVWTQBJXRIZLA","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-19T07:34:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d236c070397f75c288a17de5d75760747c5880730c0b4a8590a9218d6bf440fe","abstract_canon_sha256":"308b18d90aa3281c92d71b5429da8f6e7ce7a9c1edbdcd1e686fcd7908250209"},"schema_version":"1.0"},"canonical_sha256":"f1cbadd8a64fa69062b69c029bc51958160f062de176898f3c2ed5ae21c044a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:28.239861Z","signature_b64":"ahSVo5mD9u28rmjQMhzhafLCbQCFYez4+Ps6RGu72OKgik6ulLVFtPDhBgj9sTA0D8z2CI6+raYSkrMPubOqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1cbadd8a64fa69062b69c029bc51958160f062de176898f3c2ed5ae21c044a9","last_reissued_at":"2026-05-18T01:14:28.239161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:28.239161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05836","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-18T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AV08dxw8OcKtZgnhIFCIM+p3bzyevVpjzhUbyb7hX6GYVsVN/Gq29w4C5b4I38C9moWKE+VMP4AJPzOBZW5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:01.736686Z"},"content_sha256":"40dd629cabf30e595b3c7403c6b424b80b9749e8e295a9f818f42be8a8766a1a","schema_version":"1.0","event_id":"sha256:40dd629cabf30e595b3c7403c6b424b80b9749e8e295a9f818f42be8a8766a1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6HF23WFGJ6TJAYVWTQBJXRIZLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How hard is it to verify flat affine counter systems with the finite monoid property ?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Arnaud Sangnier, Radu Iosif","submitted_at":"2016-05-19T07:34:40Z","abstract_excerpt":"We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved by imposing two restrictions: (i) the control structure of the counter system is flat, meaning that nested loops are forbidden, and (ii) the set of matrix powers is finite, for any affine update matrix in the system. We provide tight complexity bounds for several decision problems of such systems, by proving that reachability and model checking for Past Lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05836","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-18T01:14:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1WixZX0fUdDewUBXRxDc7fzdQvRvy/xKReEYbCC2FIHrQT9a9t3KKAo4eulTRAebXqteSaSAP95HpZKrxMiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:29:01.737033Z"},"content_sha256":"bf649824d3ab3516695bfb43ee0b90c842a59ae58c6dde5d0541dfbca8bc8bf1","schema_version":"1.0","event_id":"sha256:bf649824d3ab3516695bfb43ee0b90c842a59ae58c6dde5d0541dfbca8bc8bf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/bundle.json","state_url":"https://pith.science/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/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-30T14:29:01Z","links":{"resolver":"https://pith.science/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA","bundle":"https://pith.science/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/bundle.json","state":"https://pith.science/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HF23WFGJ6TJAYVWTQBJXRIZLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6HF23WFGJ6TJAYVWTQBJXRIZLA","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":"308b18d90aa3281c92d71b5429da8f6e7ce7a9c1edbdcd1e686fcd7908250209","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-19T07:34:40Z","title_canon_sha256":"d236c070397f75c288a17de5d75760747c5880730c0b4a8590a9218d6bf440fe"},"schema_version":"1.0","source":{"id":"1605.05836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05836","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05836v1","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05836","created_at":"2026-05-18T01:14:28Z"},{"alias_kind":"pith_short_12","alias_value":"6HF23WFGJ6TJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HF23WFGJ6TJAYVW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HF23WFG","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:bf649824d3ab3516695bfb43ee0b90c842a59ae58c6dde5d0541dfbca8bc8bf1","target":"graph","created_at":"2026-05-18T01:14:28Z","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 study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved by imposing two restrictions: (i) the control structure of the counter system is flat, meaning that nested loops are forbidden, and (ii) the set of matrix powers is finite, for any affine update matrix in the system. We provide tight complexity bounds for several decision problems of such systems, by proving that reachability and model checking for Past Lin","authors_text":"Arnaud Sangnier, Radu Iosif","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-19T07:34:40Z","title":"How hard is it to verify flat affine counter systems with the finite monoid property ?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05836","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:40dd629cabf30e595b3c7403c6b424b80b9749e8e295a9f818f42be8a8766a1a","target":"record","created_at":"2026-05-18T01:14:28Z","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":"308b18d90aa3281c92d71b5429da8f6e7ce7a9c1edbdcd1e686fcd7908250209","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-19T07:34:40Z","title_canon_sha256":"d236c070397f75c288a17de5d75760747c5880730c0b4a8590a9218d6bf440fe"},"schema_version":"1.0","source":{"id":"1605.05836","kind":"arxiv","version":1}},"canonical_sha256":"f1cbadd8a64fa69062b69c029bc51958160f062de176898f3c2ed5ae21c044a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1cbadd8a64fa69062b69c029bc51958160f062de176898f3c2ed5ae21c044a9","first_computed_at":"2026-05-18T01:14:28.239161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:28.239161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ahSVo5mD9u28rmjQMhzhafLCbQCFYez4+Ps6RGu72OKgik6ulLVFtPDhBgj9sTA0D8z2CI6+raYSkrMPubOqDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:28.239861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40dd629cabf30e595b3c7403c6b424b80b9749e8e295a9f818f42be8a8766a1a","sha256:bf649824d3ab3516695bfb43ee0b90c842a59ae58c6dde5d0541dfbca8bc8bf1"],"state_sha256":"dd4e8417b221106a96a818267e2f9caabf0d2ee0f1819ce58b9db1b9dd5f45a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMDD0ZalgMy0PW8Hg/HG37EVJULDNp/cEu0nm3J4FCjrKzNlpZtr86prNZX2R/IcHR/RoFptpAVIN5jumElvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:29:01.739476Z","bundle_sha256":"d46ef4132d3f539c764de37809a271437dc04ba29752ecf64caa4471b22af471"}}