{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YFQUITDCVL3MZ5L3QHEZ32OIGD","short_pith_number":"pith:YFQUITDC","schema_version":"1.0","canonical_sha256":"c161444c62aaf6ccf57b81c99de9c830f5b158b4df08c314f4a92b7ca5639619","source":{"kind":"arxiv","id":"1302.3365","version":1},"attestation_state":"computed","paper":{"title":"Under-approximating Cut Sets for Reachability in Large Scale Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Geoffroy Andrieux, Heinz Koeppl, Lo\\\"ic Paulev\\'e","submitted_at":"2013-02-14T10:53:29Z","abstract_excerpt":"In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous work and generalised here to finite automata networks. The extracted sets of local states form an under"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1302.3365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-02-14T10:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"bb4e49c9c7f83cfd3a0dd6ee83ae354acd5370ac0df94932a6b04d0b3c2d8813","abstract_canon_sha256":"c3985457d9f28b406ffbdba8fddc98677744893bb93cb77a962a7b0b61186fa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:40.148916Z","signature_b64":"N04zsfEk0UWRK8aveSY712MSPRUT8jGI3s2dZuTFlA1wRuId2inAHsJ3qplI/OGq3gDd+RSQtxAFgIcP6m2VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c161444c62aaf6ccf57b81c99de9c830f5b158b4df08c314f4a92b7ca5639619","last_reissued_at":"2026-05-18T03:18:40.148492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:40.148492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Under-approximating Cut Sets for Reachability in Large Scale Automata Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Geoffroy Andrieux, Heinz Koeppl, Lo\\\"ic Paulev\\'e","submitted_at":"2013-02-14T10:53:29Z","abstract_excerpt":"In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the local states from such a set are disabled in the model, the concerned reachability is impossible. Those sets are referred to as cut sets and are computed from a particular abstract causality structure, so-called Graph of Local Causality, inspired from previous work and generalised here to finite automata networks. The extracted sets of local states form an under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3365","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3365","created_at":"2026-05-18T03:18:40.148567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3365v1","created_at":"2026-05-18T03:18:40.148567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3365","created_at":"2026-05-18T03:18:40.148567+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFQUITDCVL3M","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFQUITDCVL3MZ5L3","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFQUITDC","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD","json":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD.json","graph_json":"https://pith.science/api/pith-number/YFQUITDCVL3MZ5L3QHEZ32OIGD/graph.json","events_json":"https://pith.science/api/pith-number/YFQUITDCVL3MZ5L3QHEZ32OIGD/events.json","paper":"https://pith.science/paper/YFQUITDC"},"agent_actions":{"view_html":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD","download_json":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD.json","view_paper":"https://pith.science/paper/YFQUITDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3365&json=true","fetch_graph":"https://pith.science/api/pith-number/YFQUITDCVL3MZ5L3QHEZ32OIGD/graph.json","fetch_events":"https://pith.science/api/pith-number/YFQUITDCVL3MZ5L3QHEZ32OIGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD/action/storage_attestation","attest_author":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD/action/author_attestation","sign_citation":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD/action/citation_signature","submit_replication":"https://pith.science/pith/YFQUITDCVL3MZ5L3QHEZ32OIGD/action/replication_record"}},"created_at":"2026-05-18T03:18:40.148567+00:00","updated_at":"2026-05-18T03:18:40.148567+00:00"}