{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:EMLM2Y6XPZVWR2LVX37ZOAPURF","short_pith_number":"pith:EMLM2Y6X","schema_version":"1.0","canonical_sha256":"2316cd63d77e6b68e975beff9701f4894ef084ffbeda4548b48bd7c52d4a0318","source":{"kind":"arxiv","id":"0908.3347","version":1},"attestation_state":"computed","paper":{"title":"A survey of graphical languages for monoidal categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Peter Selinger","submitted_at":"2009-08-23T23:53:43Z","abstract_excerpt":"This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments 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":"0908.3347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2009-08-23T23:53:43Z","cross_cats_sorted":[],"title_canon_sha256":"8ac6681dfd52174d29eb53382e91efb17b0c891e1233071c75c9f3ddb28be393","abstract_canon_sha256":"822615b00a3ac5dd25d78c1acb89995a0cb9ea97da655e0dda689c96e3caca18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:58.743196Z","signature_b64":"BFTVubKGjNVCQm+7ob/qnnz0zHK9vbv8oWef9gx3bcHT4MHHH+CgCk12hdFcrzwJhPla5EljXOTQEvfbnbOoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2316cd63d77e6b68e975beff9701f4894ef084ffbeda4548b48bd7c52d4a0318","last_reissued_at":"2026-05-18T03:49:58.742724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:58.742724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A survey of graphical languages for monoidal categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Peter Selinger","submitted_at":"2009-08-23T23:53:43Z","abstract_excerpt":"This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3347","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":"0908.3347","created_at":"2026-05-18T03:49:58.742786+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3347v1","created_at":"2026-05-18T03:49:58.742786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3347","created_at":"2026-05-18T03:49:58.742786+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMLM2Y6XPZVW","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMLM2Y6XPZVWR2LV","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMLM2Y6X","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2309.13014","citing_title":"Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2510.14716","citing_title":"Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11417","citing_title":"String Diagrams for Quantum Foundations, Computing and Natural Language Processing","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF","json":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF.json","graph_json":"https://pith.science/api/pith-number/EMLM2Y6XPZVWR2LVX37ZOAPURF/graph.json","events_json":"https://pith.science/api/pith-number/EMLM2Y6XPZVWR2LVX37ZOAPURF/events.json","paper":"https://pith.science/paper/EMLM2Y6X"},"agent_actions":{"view_html":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF","download_json":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF.json","view_paper":"https://pith.science/paper/EMLM2Y6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3347&json=true","fetch_graph":"https://pith.science/api/pith-number/EMLM2Y6XPZVWR2LVX37ZOAPURF/graph.json","fetch_events":"https://pith.science/api/pith-number/EMLM2Y6XPZVWR2LVX37ZOAPURF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF/action/storage_attestation","attest_author":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF/action/author_attestation","sign_citation":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF/action/citation_signature","submit_replication":"https://pith.science/pith/EMLM2Y6XPZVWR2LVX37ZOAPURF/action/replication_record"}},"created_at":"2026-05-18T03:49:58.742786+00:00","updated_at":"2026-05-18T03:49:58.742786+00:00"}