{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WZ4FB56VCOOU5FN65M36YZTATU","short_pith_number":"pith:WZ4FB56V","schema_version":"1.0","canonical_sha256":"b67850f7d5139d4e95beeb37ec66609d050fba67dc0a83f5cba8cc1eb69918d1","source":{"kind":"arxiv","id":"2411.14802","version":4},"attestation_state":"computed","paper":{"title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kazunori Ueda, Kento Takyu","submitted_at":"2024-11-22T09:03:09Z","abstract_excerpt":"Hierarchical graph rewriting is a highly expressive computational formalism that manipulates graphs enhanced with box structures for representing hierarchies. It has provided the foundations of various graph-based modeling tools, but the design of high-level declarative languages based on hierarchical graph rewriting is still a challenge. For a solid design choice, well-established formalisms with backgrounds other than graph rewriting would provide useful guidelines. Proof nets of Multiplicative Exponential Linear Logic (MELL) is such a framework because its original formulation of cut elimin"},"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":"2411.14802","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2024-11-22T09:03:09Z","cross_cats_sorted":[],"title_canon_sha256":"ca879af186233f2e1e4a2b3eda3461e8622367e2db931238050a94c3efc83751","abstract_canon_sha256":"f5a22b41c7908e4dc56af74713b7e3cbe88c831cebf61d0225ddf6b34041ce49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:20:33.941069Z","signature_b64":"rJp07ozdnH1RZXmuStvyufV9cQIJu+6xx4JEgI5NmTQROqZfzgUOjblLr59gtPgzYOr0rlPYBLc91xOCqxSYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67850f7d5139d4e95beeb37ec66609d050fba67dc0a83f5cba8cc1eb69918d1","last_reissued_at":"2026-07-17T01:20:33.940123Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:20:33.940123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enhancing a Hierarchical Graph Rewriting Language based on MELL Cut Elimination","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kazunori Ueda, Kento Takyu","submitted_at":"2024-11-22T09:03:09Z","abstract_excerpt":"Hierarchical graph rewriting is a highly expressive computational formalism that manipulates graphs enhanced with box structures for representing hierarchies. It has provided the foundations of various graph-based modeling tools, but the design of high-level declarative languages based on hierarchical graph rewriting is still a challenge. For a solid design choice, well-established formalisms with backgrounds other than graph rewriting would provide useful guidelines. Proof nets of Multiplicative Exponential Linear Logic (MELL) is such a framework because its original formulation of cut elimin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14802","kind":"arxiv","version":4},"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/2411.14802/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":"2411.14802","created_at":"2026-07-17T01:20:33.940577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14802v4","created_at":"2026-07-17T01:20:33.940577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14802","created_at":"2026-07-17T01:20:33.940577+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZ4FB56VCOOU","created_at":"2026-07-17T01:20:33.940577+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZ4FB56VCOOU5FN6","created_at":"2026-07-17T01:20:33.940577+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZ4FB56V","created_at":"2026-07-17T01:20:33.940577+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/WZ4FB56VCOOU5FN65M36YZTATU","json":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU.json","graph_json":"https://pith.science/api/pith-number/WZ4FB56VCOOU5FN65M36YZTATU/graph.json","events_json":"https://pith.science/api/pith-number/WZ4FB56VCOOU5FN65M36YZTATU/events.json","paper":"https://pith.science/paper/WZ4FB56V"},"agent_actions":{"view_html":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU","download_json":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU.json","view_paper":"https://pith.science/paper/WZ4FB56V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14802&json=true","fetch_graph":"https://pith.science/api/pith-number/WZ4FB56VCOOU5FN65M36YZTATU/graph.json","fetch_events":"https://pith.science/api/pith-number/WZ4FB56VCOOU5FN65M36YZTATU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU/action/storage_attestation","attest_author":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU/action/author_attestation","sign_citation":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU/action/citation_signature","submit_replication":"https://pith.science/pith/WZ4FB56VCOOU5FN65M36YZTATU/action/replication_record"}},"created_at":"2026-07-17T01:20:33.940577+00:00","updated_at":"2026-07-17T01:20:33.940577+00:00"}