{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:464FZCH4QP2S4JHQP6PO3CAAIL","short_pith_number":"pith:464FZCH4","canonical_record":{"source":{"id":"1105.1657","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-09T12:44:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"044fc5879fbe1ee7b8a40a57fdb0fe3747fcff5a35407f123b8537eafe299073","abstract_canon_sha256":"f8406ea9fb0ecca6039dd8bb8d21b19741246afd1b5174d528711b5a23ee371d"},"schema_version":"1.0"},"canonical_sha256":"e7b85c88fc83f52e24f07f9eed880042c27cafb007d447b076c608810e160daf","source":{"kind":"arxiv","id":"1105.1657","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1657","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1657v3","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1657","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"464FZCH4QP2S","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"464FZCH4QP2S4JHQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"464FZCH4","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:464FZCH4QP2S4JHQP6PO3CAAIL","target":"record","payload":{"canonical_record":{"source":{"id":"1105.1657","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-09T12:44:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"044fc5879fbe1ee7b8a40a57fdb0fe3747fcff5a35407f123b8537eafe299073","abstract_canon_sha256":"f8406ea9fb0ecca6039dd8bb8d21b19741246afd1b5174d528711b5a23ee371d"},"schema_version":"1.0"},"canonical_sha256":"e7b85c88fc83f52e24f07f9eed880042c27cafb007d447b076c608810e160daf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:00.514612Z","signature_b64":"x6Apfq0jj8dMBWBUs622iO+GDTiUsM3h7cDa6xeU36wScQ+JvIoObd//eYfnkGSVmSKohMOnGj7RJXsA6rwNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7b85c88fc83f52e24f07f9eed880042c27cafb007d447b076c608810e160daf","last_reissued_at":"2026-05-18T02:22:00.513917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:00.513917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.1657","source_version":3,"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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"si9NhCusTOCVslU9Ys3ovmNsknObjaNeuwEo1cVXvheRF9ijopmuopRknHWkDiQTzGS+Lwr9vA71U01FhonpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:07:45.063172Z"},"content_sha256":"20783055463e71239d37c693a3d733455cc2f16ce1a69b3f4a6e1ba507c9934b","schema_version":"1.0","event_id":"sha256:20783055463e71239d37c693a3d733455cc2f16ce1a69b3f4a6e1ba507c9934b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:464FZCH4QP2S4JHQP6PO3CAAIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Petri Net Reachability Along Context-free Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Mohamed Faouzi Atig, Pierre Ganty","submitted_at":"2011-05-09T12:44:49Z","abstract_excerpt":"We investigate the problem asking whether the intersection of a context-free language (CFL) and a Petri net language (PNL) is empty. Our contribution to solve this long-standing problem which relates, for instance, to the reachability analysis of recursive programs over unbounded data domain, is to identify a class of CFLs called the finite-index CFLs for which the problem is decidable. The k-index approximation of a CFL can be obtained by discarding all the words that cannot be derived within a budget k on the number of occurrences of non-terminals. A finite-index CFL is thus a CFL which coin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1657","kind":"arxiv","version":3},"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-18T02:22:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyoYikaePgCJeF/UQ05MhQmrE9w7QDTyBcUU42Dy0QPdML6Ogvgak7Gv+YyvXHk4tEnLhNnQUuuk4XLCFqjXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:07:45.063732Z"},"content_sha256":"d0acd8459858e8f5015896d3b4ef0fe1f8a0257b34329d015e042ce2f019c390","schema_version":"1.0","event_id":"sha256:d0acd8459858e8f5015896d3b4ef0fe1f8a0257b34329d015e042ce2f019c390"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/464FZCH4QP2S4JHQP6PO3CAAIL/bundle.json","state_url":"https://pith.science/pith/464FZCH4QP2S4JHQP6PO3CAAIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/464FZCH4QP2S4JHQP6PO3CAAIL/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-22T23:07:45Z","links":{"resolver":"https://pith.science/pith/464FZCH4QP2S4JHQP6PO3CAAIL","bundle":"https://pith.science/pith/464FZCH4QP2S4JHQP6PO3CAAIL/bundle.json","state":"https://pith.science/pith/464FZCH4QP2S4JHQP6PO3CAAIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/464FZCH4QP2S4JHQP6PO3CAAIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:464FZCH4QP2S4JHQP6PO3CAAIL","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":"f8406ea9fb0ecca6039dd8bb8d21b19741246afd1b5174d528711b5a23ee371d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-09T12:44:49Z","title_canon_sha256":"044fc5879fbe1ee7b8a40a57fdb0fe3747fcff5a35407f123b8537eafe299073"},"schema_version":"1.0","source":{"id":"1105.1657","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.1657","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"arxiv_version","alias_value":"1105.1657v3","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1657","created_at":"2026-05-18T02:22:00Z"},{"alias_kind":"pith_short_12","alias_value":"464FZCH4QP2S","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"464FZCH4QP2S4JHQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"464FZCH4","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d0acd8459858e8f5015896d3b4ef0fe1f8a0257b34329d015e042ce2f019c390","target":"graph","created_at":"2026-05-18T02:22:00Z","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 investigate the problem asking whether the intersection of a context-free language (CFL) and a Petri net language (PNL) is empty. Our contribution to solve this long-standing problem which relates, for instance, to the reachability analysis of recursive programs over unbounded data domain, is to identify a class of CFLs called the finite-index CFLs for which the problem is decidable. The k-index approximation of a CFL can be obtained by discarding all the words that cannot be derived within a budget k on the number of occurrences of non-terminals. A finite-index CFL is thus a CFL which coin","authors_text":"Mohamed Faouzi Atig, Pierre Ganty","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-09T12:44:49Z","title":"Approximating Petri Net Reachability Along Context-free Traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1657","kind":"arxiv","version":3},"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:20783055463e71239d37c693a3d733455cc2f16ce1a69b3f4a6e1ba507c9934b","target":"record","created_at":"2026-05-18T02:22:00Z","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":"f8406ea9fb0ecca6039dd8bb8d21b19741246afd1b5174d528711b5a23ee371d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-05-09T12:44:49Z","title_canon_sha256":"044fc5879fbe1ee7b8a40a57fdb0fe3747fcff5a35407f123b8537eafe299073"},"schema_version":"1.0","source":{"id":"1105.1657","kind":"arxiv","version":3}},"canonical_sha256":"e7b85c88fc83f52e24f07f9eed880042c27cafb007d447b076c608810e160daf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7b85c88fc83f52e24f07f9eed880042c27cafb007d447b076c608810e160daf","first_computed_at":"2026-05-18T02:22:00.513917Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:00.513917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x6Apfq0jj8dMBWBUs622iO+GDTiUsM3h7cDa6xeU36wScQ+JvIoObd//eYfnkGSVmSKohMOnGj7RJXsA6rwNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:00.514612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.1657","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20783055463e71239d37c693a3d733455cc2f16ce1a69b3f4a6e1ba507c9934b","sha256:d0acd8459858e8f5015896d3b4ef0fe1f8a0257b34329d015e042ce2f019c390"],"state_sha256":"a1aa348edddf92c710b878b271f7a7de6fb48d47067985eabf32ef66bb5a7e3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AVrdjNnnoqfYbrEX0QCfOxinknYrENCiWTkgsAztU1nKPH+l7OHY3gIXAJrRtWYAqJzNvSZHI+SfeF/xr2pDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:07:45.066393Z","bundle_sha256":"3c9506e0d8797e401fe5746044949b428604c1de96c906badf3de760dad87e0b"}}