{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JAAQRCTTEV4N7DM3MY73ZOJ7AL","short_pith_number":"pith:JAAQRCTT","canonical_record":{"source":{"id":"2007.05269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-07-10T09:27:55Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"281c83110dda5545ddd7e531ef9192a33fedb73422934f0ba2b1f5711a493643","abstract_canon_sha256":"466ad6affe66ffdc29e04e5ebaa069b5ca5ece34deb257dd6b96d4f7218238be"},"schema_version":"1.0"},"canonical_sha256":"4801088a732578df8d9b663fbcb93f02f32cad7cbe2059fffe2466cc5f3299c6","source":{"kind":"arxiv","id":"2007.05269","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05269","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05269v1","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05269","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"JAAQRCTTEV4N","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"JAAQRCTTEV4N7DM3","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"JAAQRCTT","created_at":"2026-07-05T01:17:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JAAQRCTTEV4N7DM3MY73ZOJ7AL","target":"record","payload":{"canonical_record":{"source":{"id":"2007.05269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-07-10T09:27:55Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"281c83110dda5545ddd7e531ef9192a33fedb73422934f0ba2b1f5711a493643","abstract_canon_sha256":"466ad6affe66ffdc29e04e5ebaa069b5ca5ece34deb257dd6b96d4f7218238be"},"schema_version":"1.0"},"canonical_sha256":"4801088a732578df8d9b663fbcb93f02f32cad7cbe2059fffe2466cc5f3299c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:45.198243Z","signature_b64":"5iDIBgGKWWn1Am56LYOAlRqK1hghMUhWbweWeoGhLwYBbXunrh6wanjVBiCxopDZWqUUNUkj1+CZr/H8tpaIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4801088a732578df8d9b663fbcb93f02f32cad7cbe2059fffe2466cc5f3299c6","last_reissued_at":"2026-07-05T01:17:45.197805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:45.197805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.05269","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-05T01:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7r/m5j5pniKBmun3+U38pTdqu8kC9d/zuU3FIOpVY25h6X2nZhYJXdwWOF6iIvhNMq0Yf9ILlvhd1IRsfonCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:19:18.688124Z"},"content_sha256":"9640f7009bc1618f73fd34a734de9834cc02f32937343f10619dbbe81dc91b84","schema_version":"1.0","event_id":"sha256:9640f7009bc1618f73fd34a734de9834cc02f32937343f10619dbbe81dc91b84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JAAQRCTTEV4N7DM3MY73ZOJ7AL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On flat lossy channel machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Philippe Schnoebelen","submitted_at":"2020-07-10T09:27:55Z","abstract_excerpt":"We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine analysis of iterations of lossy channel actions and uses compressed word techniques for efficiently reasoning with paths of exponential lengths. The lower bounds already apply to acyclic or single-path machines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05269","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/2007.05269/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-05T01:17:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttSgEsFJ1F9EsfC3jdnBp1RLdLv6wOtTLX8i7s87i2CBRohTUpwEqofm2yqk19euArCdZcPU94GOfeG+VOoQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:19:18.688637Z"},"content_sha256":"4770c84037ddd65f2bedf5fffdb602b644e581378946932057a14dafcb41a256","schema_version":"1.0","event_id":"sha256:4770c84037ddd65f2bedf5fffdb602b644e581378946932057a14dafcb41a256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/bundle.json","state_url":"https://pith.science/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/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-17T08:19:18Z","links":{"resolver":"https://pith.science/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL","bundle":"https://pith.science/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/bundle.json","state":"https://pith.science/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAAQRCTTEV4N7DM3MY73ZOJ7AL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JAAQRCTTEV4N7DM3MY73ZOJ7AL","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":"466ad6affe66ffdc29e04e5ebaa069b5ca5ece34deb257dd6b96d4f7218238be","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-07-10T09:27:55Z","title_canon_sha256":"281c83110dda5545ddd7e531ef9192a33fedb73422934f0ba2b1f5711a493643"},"schema_version":"1.0","source":{"id":"2007.05269","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05269","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05269v1","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05269","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_12","alias_value":"JAAQRCTTEV4N","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_16","alias_value":"JAAQRCTTEV4N7DM3","created_at":"2026-07-05T01:17:45Z"},{"alias_kind":"pith_short_8","alias_value":"JAAQRCTT","created_at":"2026-07-05T01:17:45Z"}],"graph_snapshots":[{"event_id":"sha256:4770c84037ddd65f2bedf5fffdb602b644e581378946932057a14dafcb41a256","target":"graph","created_at":"2026-07-05T01:17:45Z","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/2007.05269/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that reachability, repeated reachability, nontermination and unboundedness are NP-complete for Lossy Channel Machines that are flat, i.e., with no nested cycles in the control graph. The upper complexity bound relies on a fine analysis of iterations of lossy channel actions and uses compressed word techniques for efficiently reasoning with paths of exponential lengths. The lower bounds already apply to acyclic or single-path machines.","authors_text":"Philippe Schnoebelen","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-07-10T09:27:55Z","title":"On flat lossy channel machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05269","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:9640f7009bc1618f73fd34a734de9834cc02f32937343f10619dbbe81dc91b84","target":"record","created_at":"2026-07-05T01:17:45Z","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":"466ad6affe66ffdc29e04e5ebaa069b5ca5ece34deb257dd6b96d4f7218238be","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-07-10T09:27:55Z","title_canon_sha256":"281c83110dda5545ddd7e531ef9192a33fedb73422934f0ba2b1f5711a493643"},"schema_version":"1.0","source":{"id":"2007.05269","kind":"arxiv","version":1}},"canonical_sha256":"4801088a732578df8d9b663fbcb93f02f32cad7cbe2059fffe2466cc5f3299c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4801088a732578df8d9b663fbcb93f02f32cad7cbe2059fffe2466cc5f3299c6","first_computed_at":"2026-07-05T01:17:45.197805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:45.197805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5iDIBgGKWWn1Am56LYOAlRqK1hghMUhWbweWeoGhLwYBbXunrh6wanjVBiCxopDZWqUUNUkj1+CZr/H8tpaIAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:45.198243Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.05269","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9640f7009bc1618f73fd34a734de9834cc02f32937343f10619dbbe81dc91b84","sha256:4770c84037ddd65f2bedf5fffdb602b644e581378946932057a14dafcb41a256"],"state_sha256":"629e11d7ecc350ae48a024e77a1965197ecdfc70a26b4d98ed6f7269d11a44ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiUqnh0kWVX5vwteqXoSXJ2DU2VNl8UrRzQcluMrfi+8DIFMpoql1hjDwhrMg5tSJjESsRfg/kTJFirLNc8xAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T08:19:18.693168Z","bundle_sha256":"9f8a87541bae7709e68546fd703b5cee59bc610e368953715adef4c65c75041b"}}