{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E5MDNXDBJTQVN3I2ZYCU736QUX","short_pith_number":"pith:E5MDNXDB","schema_version":"1.0","canonical_sha256":"275836dc614ce156ed1ace054fefd0a5c97351ceec2347c2a413cf595b42a2fd","source":{"kind":"arxiv","id":"1702.01695","version":2},"attestation_state":"computed","paper":{"title":"A Structural and Nominal Syntax for Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aliaume Lopez (ENS Cachan), Dan R Ghica (University of Birmingham)","submitted_at":"2017-02-06T16:40:00Z","abstract_excerpt":"The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more. From the categorical perspective, diagrams can be specified using (name-free) combinators which enjoy elegant equational properties. However, conventional notations for diagrammatic structures, such as hardware description languages (VHDL, Verilog) or graph languages (Dot), use a  different style, which is flat, relational, and reliant on extensive use of names (labels). Such lan"},"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":"1702.01695","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-02-06T16:40:00Z","cross_cats_sorted":[],"title_canon_sha256":"a9a4460d5052cf8d07c0c158bc0bbc5ff59a8f2c88b9177ef294e0d2d74f73e4","abstract_canon_sha256":"e8b8084913011c5dc324965a5f47a6fda4878575453ac9033b40a8511d6000a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:11.114715Z","signature_b64":"PFBD9TtuGj8GlJn+e52gO/VmiuJMSkNI3n3ktVAo1e10vQJlQVkndcPclYMSPjwudoL4/Mf9yZ7aFzNLFVM1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"275836dc614ce156ed1ace054fefd0a5c97351ceec2347c2a413cf595b42a2fd","last_reissued_at":"2026-05-18T00:22:11.114216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:11.114216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Structural and Nominal Syntax for Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aliaume Lopez (ENS Cachan), Dan R Ghica (University of Birmingham)","submitted_at":"2017-02-06T16:40:00Z","abstract_excerpt":"The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more. From the categorical perspective, diagrams can be specified using (name-free) combinators which enjoy elegant equational properties. However, conventional notations for diagrammatic structures, such as hardware description languages (VHDL, Verilog) or graph languages (Dot), use a  different style, which is flat, relational, and reliant on extensive use of names (labels). Such lan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01695","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":""},"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":"1702.01695","created_at":"2026-05-18T00:22:11.114290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01695v2","created_at":"2026-05-18T00:22:11.114290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01695","created_at":"2026-05-18T00:22:11.114290+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5MDNXDBJTQV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5MDNXDBJTQVN3I2","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5MDNXDB","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08497","citing_title":"Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX","json":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX.json","graph_json":"https://pith.science/api/pith-number/E5MDNXDBJTQVN3I2ZYCU736QUX/graph.json","events_json":"https://pith.science/api/pith-number/E5MDNXDBJTQVN3I2ZYCU736QUX/events.json","paper":"https://pith.science/paper/E5MDNXDB"},"agent_actions":{"view_html":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX","download_json":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX.json","view_paper":"https://pith.science/paper/E5MDNXDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01695&json=true","fetch_graph":"https://pith.science/api/pith-number/E5MDNXDBJTQVN3I2ZYCU736QUX/graph.json","fetch_events":"https://pith.science/api/pith-number/E5MDNXDBJTQVN3I2ZYCU736QUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX/action/storage_attestation","attest_author":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX/action/author_attestation","sign_citation":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX/action/citation_signature","submit_replication":"https://pith.science/pith/E5MDNXDBJTQVN3I2ZYCU736QUX/action/replication_record"}},"created_at":"2026-05-18T00:22:11.114290+00:00","updated_at":"2026-05-18T00:22:11.114290+00:00"}