{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BAEM75KBX3E63VHDFMUPUHFD4R","short_pith_number":"pith:BAEM75KB","schema_version":"1.0","canonical_sha256":"0808cff541bec9edd4e32b28fa1ca3e46b414d96616d91a1e95329455ef8dfbc","source":{"kind":"arxiv","id":"1401.2751","version":1},"attestation_state":"computed","paper":{"title":"Transformation of Attributed Structures with Cloning (Long Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dominique Duval, Frederic Prost, Leila Ribeiro, Rachid Echahed","submitted_at":"2014-01-13T08:39:08Z","abstract_excerpt":"Copying, or cloning, is a basic operation used in the specification of many applications in computer science. However, when dealing with complex structures, like graphs, cloning is not a straightforward operation since a copy of a single vertex may involve (implicitly)copying many edges. Therefore, most graph transformation approaches forbid the possibility of cloning. We tackle this problem by providing a framework for graph transformations with cloning. We use attributed graphs and allow rules to change attributes. These two features (cloning/changing attributes) together give rise to a powe"},"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":"1401.2751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-01-13T08:39:08Z","cross_cats_sorted":[],"title_canon_sha256":"5af2143ea911e9a959c5048566ea8bde36726231a2aecae7ca02881282dc3cb7","abstract_canon_sha256":"e1c8fdc6ce5f1c159592c126675ee2a3f8c52abd63318bffdf9f6729a9d26b22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:32.243377Z","signature_b64":"KC8Dbr8DBVPhUCRdpDdIuVwM4LAEyEAawDZPGA/HMgiN/hZ3+jy3qtx8Wj7sUszYijxJWM6V8Ajk9onhaIEECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0808cff541bec9edd4e32b28fa1ca3e46b414d96616d91a1e95329455ef8dfbc","last_reissued_at":"2026-05-18T03:02:32.242635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:32.242635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformation of Attributed Structures with Cloning (Long Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dominique Duval, Frederic Prost, Leila Ribeiro, Rachid Echahed","submitted_at":"2014-01-13T08:39:08Z","abstract_excerpt":"Copying, or cloning, is a basic operation used in the specification of many applications in computer science. However, when dealing with complex structures, like graphs, cloning is not a straightforward operation since a copy of a single vertex may involve (implicitly)copying many edges. Therefore, most graph transformation approaches forbid the possibility of cloning. We tackle this problem by providing a framework for graph transformations with cloning. We use attributed graphs and allow rules to change attributes. These two features (cloning/changing attributes) together give rise to a powe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2751","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":"1401.2751","created_at":"2026-05-18T03:02:32.242753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2751v1","created_at":"2026-05-18T03:02:32.242753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2751","created_at":"2026-05-18T03:02:32.242753+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAEM75KBX3E6","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAEM75KBX3E63VHD","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAEM75KB","created_at":"2026-05-18T12:28:22.404517+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/BAEM75KBX3E63VHDFMUPUHFD4R","json":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R.json","graph_json":"https://pith.science/api/pith-number/BAEM75KBX3E63VHDFMUPUHFD4R/graph.json","events_json":"https://pith.science/api/pith-number/BAEM75KBX3E63VHDFMUPUHFD4R/events.json","paper":"https://pith.science/paper/BAEM75KB"},"agent_actions":{"view_html":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R","download_json":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R.json","view_paper":"https://pith.science/paper/BAEM75KB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2751&json=true","fetch_graph":"https://pith.science/api/pith-number/BAEM75KBX3E63VHDFMUPUHFD4R/graph.json","fetch_events":"https://pith.science/api/pith-number/BAEM75KBX3E63VHDFMUPUHFD4R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R/action/storage_attestation","attest_author":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R/action/author_attestation","sign_citation":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R/action/citation_signature","submit_replication":"https://pith.science/pith/BAEM75KBX3E63VHDFMUPUHFD4R/action/replication_record"}},"created_at":"2026-05-18T03:02:32.242753+00:00","updated_at":"2026-05-18T03:02:32.242753+00:00"}