{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7CB2UOB5NLL426WDI2ECDYMYXL","short_pith_number":"pith:7CB2UOB5","schema_version":"1.0","canonical_sha256":"f883aa383d6ad7cd7ac3468821e198baf516ced79924f26d9bf6c96ece5657d4","source":{"kind":"arxiv","id":"0902.1809","version":2},"attestation_state":"computed","paper":{"title":"Matrix Graph Grammars with Application Conditions","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Juan de Lara Jaramillo, Pedro Pablo Perez Velasco","submitted_at":"2009-02-11T06:53:29Z","abstract_excerpt":"In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operators only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, state reachability and the minimal graph able to fire a sequence.\n  In the present paper we improve our framework in two ways. First, we make explicit (in the form of a Boolean matrix) some negative implicit information in rules. This matrix (called nihilation matrix) contains the eleme"},"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":"0902.1809","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DM","submitted_at":"2009-02-11T06:53:29Z","cross_cats_sorted":[],"title_canon_sha256":"c6b57b4383d0ddd5ee182388f489127a8c68a00016d3e94efe5a6794aaee2b4f","abstract_canon_sha256":"875ad2767fd74b7e3c991ded6cd1e7d3cc39adf95bc7ec734c7d43d780d2470f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:15:48.491651Z","signature_b64":"JAA7Je/Msj4ayx5MGv4JGfDfxKzPmMU2AfAdEJLtCvBebMnC/lTwuwoMFXdqZExtmkh/gdpqKfhteNyMkZ9/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f883aa383d6ad7cd7ac3468821e198baf516ced79924f26d9bf6c96ece5657d4","last_reissued_at":"2026-07-04T17:15:48.490888Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:15:48.490888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matrix Graph Grammars with Application Conditions","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Juan de Lara Jaramillo, Pedro Pablo Perez Velasco","submitted_at":"2009-02-11T06:53:29Z","abstract_excerpt":"In the Matrix approach to graph transformation we represent simple digraphs and rules with Boolean matrices and vectors, and the rewriting is expressed using Boolean operators only. In previous works, we developed analysis techniques enabling the study of the applicability of rule sequences, their independence, state reachability and the minimal graph able to fire a sequence.\n  In the present paper we improve our framework in two ways. First, we make explicit (in the form of a Boolean matrix) some negative implicit information in rules. This matrix (called nihilation matrix) contains the eleme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.1809","kind":"arxiv","version":2},"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/0902.1809/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0902.1809","created_at":"2026-07-04T17:15:48.491101+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.1809v2","created_at":"2026-07-04T17:15:48.491101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.1809","created_at":"2026-07-04T17:15:48.491101+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CB2UOB5NLL4","created_at":"2026-07-04T17:15:48.491101+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CB2UOB5NLL426WD","created_at":"2026-07-04T17:15:48.491101+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CB2UOB5","created_at":"2026-07-04T17:15:48.491101+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/7CB2UOB5NLL426WDI2ECDYMYXL","json":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL.json","graph_json":"https://pith.science/api/pith-number/7CB2UOB5NLL426WDI2ECDYMYXL/graph.json","events_json":"https://pith.science/api/pith-number/7CB2UOB5NLL426WDI2ECDYMYXL/events.json","paper":"https://pith.science/paper/7CB2UOB5"},"agent_actions":{"view_html":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL","download_json":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL.json","view_paper":"https://pith.science/paper/7CB2UOB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.1809&json=true","fetch_graph":"https://pith.science/api/pith-number/7CB2UOB5NLL426WDI2ECDYMYXL/graph.json","fetch_events":"https://pith.science/api/pith-number/7CB2UOB5NLL426WDI2ECDYMYXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL/action/storage_attestation","attest_author":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL/action/author_attestation","sign_citation":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL/action/citation_signature","submit_replication":"https://pith.science/pith/7CB2UOB5NLL426WDI2ECDYMYXL/action/replication_record"}},"created_at":"2026-07-04T17:15:48.491101+00:00","updated_at":"2026-07-04T17:15:48.491101+00:00"}