{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CCM6DXQBKKQ2MCT3QSJ723O2KM","short_pith_number":"pith:CCM6DXQB","schema_version":"1.0","canonical_sha256":"1099e1de0152a1a60a7b8493fd6dda5318371a956d4f4a921c027533356f5426","source":{"kind":"arxiv","id":"2404.02679","version":1},"attestation_state":"computed","paper":{"title":"Rendering string diagrams recursively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CT","authors_text":"Celia Rubio-Madrigal, Jules Hedges","submitted_at":"2024-04-03T12:22:24Z","abstract_excerpt":"String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the layout of a string diagram by folding over its algebraic representation in terms of sequential and parallel composition operators. The algebraic representation can be seen as a term of a free monoidal category or a proof tree for a small fragment of linear logic. This contrasts to existing non-compositional approaches that use graph layout techniques. The key i"},"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":"2404.02679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2024-04-03T12:22:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"96fa6870a67a7bfc0b53b6ab77573c972eb93376253decdfbc8d7596841a728a","abstract_canon_sha256":"c737b92d59e5d99822ca1b4663ceb66ef624981f354329f23134e6b545931db5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:59.873091Z","signature_b64":"03CajIsfy2+RIgFKGlBFEGn6fEqlQnxynbbcgPveB3uPYvTWxkDqRz1vc/3cs48im/pwQijQF+hKyudY2Z99Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1099e1de0152a1a60a7b8493fd6dda5318371a956d4f4a921c027533356f5426","last_reissued_at":"2026-07-05T08:03:59.872558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:59.872558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rendering string diagrams recursively","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CT","authors_text":"Celia Rubio-Madrigal, Jules Hedges","submitted_at":"2024-04-03T12:22:24Z","abstract_excerpt":"String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the layout of a string diagram by folding over its algebraic representation in terms of sequential and parallel composition operators. The algebraic representation can be seen as a term of a free monoidal category or a proof tree for a small fragment of linear logic. This contrasts to existing non-compositional approaches that use graph layout techniques. The key i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02679","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.02679/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":"2404.02679","created_at":"2026-07-05T08:03:59.872639+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.02679v1","created_at":"2026-07-05T08:03:59.872639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02679","created_at":"2026-07-05T08:03:59.872639+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCM6DXQBKKQ2","created_at":"2026-07-05T08:03:59.872639+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCM6DXQBKKQ2MCT3","created_at":"2026-07-05T08:03:59.872639+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCM6DXQB","created_at":"2026-07-05T08:03:59.872639+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25321","citing_title":"Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM","json":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM.json","graph_json":"https://pith.science/api/pith-number/CCM6DXQBKKQ2MCT3QSJ723O2KM/graph.json","events_json":"https://pith.science/api/pith-number/CCM6DXQBKKQ2MCT3QSJ723O2KM/events.json","paper":"https://pith.science/paper/CCM6DXQB"},"agent_actions":{"view_html":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM","download_json":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM.json","view_paper":"https://pith.science/paper/CCM6DXQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.02679&json=true","fetch_graph":"https://pith.science/api/pith-number/CCM6DXQBKKQ2MCT3QSJ723O2KM/graph.json","fetch_events":"https://pith.science/api/pith-number/CCM6DXQBKKQ2MCT3QSJ723O2KM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM/action/storage_attestation","attest_author":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM/action/author_attestation","sign_citation":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM/action/citation_signature","submit_replication":"https://pith.science/pith/CCM6DXQBKKQ2MCT3QSJ723O2KM/action/replication_record"}},"created_at":"2026-07-05T08:03:59.872639+00:00","updated_at":"2026-07-05T08:03:59.872639+00:00"}