{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PZ3KWNCZTSISPXNAAOIYY7RT43","short_pith_number":"pith:PZ3KWNCZ","schema_version":"1.0","canonical_sha256":"7e76ab34599c9127dda003918c7e33e6c7767cf0b3795f96bd3af0e263bd3969","source":{"kind":"arxiv","id":"1012.5560","version":1},"attestation_state":"computed","paper":{"title":"Strategic programming on graph rewriting systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Maribel Fern\\'andez (King's College London), Olivier Namet (King's College London)","submitted_at":"2010-12-27T06:30:03Z","abstract_excerpt":"We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas.  This language is part of a graph-based programming tool  built within the port-graph transformation and visualisation environment PORGY."},"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":"1012.5560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2010-12-27T06:30:03Z","cross_cats_sorted":[],"title_canon_sha256":"4178981c84d92bbdcb8c475d8ae59e5c5908ec9a9ad1c6d3631d2994bf17f987","abstract_canon_sha256":"4612d72388c88370844e59465fe7db5f594286032c629c72f969b40afab18952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:23.040825Z","signature_b64":"Pi9L8ankDkjRbnruxGp6KuvLS7vKnCo9khlrkQwQooOx5V0lsvT/mUAjlSz2CS8gHUUTTwCIauRKQkbzyXdXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e76ab34599c9127dda003918c7e33e6c7767cf0b3795f96bd3af0e263bd3969","last_reissued_at":"2026-05-18T04:32:23.040103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:23.040103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strategic programming on graph rewriting systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Maribel Fern\\'andez (King's College London), Olivier Namet (King's College London)","submitted_at":"2010-12-27T06:30:03Z","abstract_excerpt":"We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas.  This language is part of a graph-based programming tool  built within the port-graph transformation and visualisation environment PORGY."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5560","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":"1012.5560","created_at":"2026-05-18T04:32:23.040205+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5560v1","created_at":"2026-05-18T04:32:23.040205+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5560","created_at":"2026-05-18T04:32:23.040205+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZ3KWNCZTSIS","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZ3KWNCZTSISPXNA","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZ3KWNCZ","created_at":"2026-05-18T12:26:12.377268+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/PZ3KWNCZTSISPXNAAOIYY7RT43","json":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43.json","graph_json":"https://pith.science/api/pith-number/PZ3KWNCZTSISPXNAAOIYY7RT43/graph.json","events_json":"https://pith.science/api/pith-number/PZ3KWNCZTSISPXNAAOIYY7RT43/events.json","paper":"https://pith.science/paper/PZ3KWNCZ"},"agent_actions":{"view_html":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43","download_json":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43.json","view_paper":"https://pith.science/paper/PZ3KWNCZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5560&json=true","fetch_graph":"https://pith.science/api/pith-number/PZ3KWNCZTSISPXNAAOIYY7RT43/graph.json","fetch_events":"https://pith.science/api/pith-number/PZ3KWNCZTSISPXNAAOIYY7RT43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43/action/storage_attestation","attest_author":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43/action/author_attestation","sign_citation":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43/action/citation_signature","submit_replication":"https://pith.science/pith/PZ3KWNCZTSISPXNAAOIYY7RT43/action/replication_record"}},"created_at":"2026-05-18T04:32:23.040205+00:00","updated_at":"2026-05-18T04:32:23.040205+00:00"}