{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IL5VB6A3V5XW5NPSO43M2FWF5T","short_pith_number":"pith:IL5VB6A3","schema_version":"1.0","canonical_sha256":"42fb50f81baf6f6eb5f27736cd16c5ecfd9db318e48a76c7ffd7a152e4797b13","source":{"kind":"arxiv","id":"2204.04274","version":4},"attestation_state":"computed","paper":{"title":"Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Aleksandar Milosavljevic, Fabio Zanasi, Robin Piedeleu","submitted_at":"2022-04-08T20:04:21Z","abstract_excerpt":"String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency theory, quantum computing, control theory, machine learning, linguistics, and digital circuits. Rewriting theory for string diagrams relies on a combinatorial interpretation as double-pushout rewriting of certain hypergraphs. As previously studied, there is a `tension' in this interpretation: in order to make it sound and complete, we either need to add stru"},"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":"2204.04274","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-04-08T20:04:21Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"13626335f60c9232b790f4feef357c8b6e144f05c18d9957f8f8673c7dd004cc","abstract_canon_sha256":"15658aa6506e5447c9ac24efe8607dcfc1acb18fef51f5d92f5d1abd3aa8dfb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:58.722037Z","signature_b64":"nI/+jHBjZlEAurFAuj3KczvLylCDWwwDlsOxxH2RvAkc4+b9F82TF3J9Rt39TUwhzke82f+JdHQXJRI9bhZ8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42fb50f81baf6f6eb5f27736cd16c5ecfd9db318e48a76c7ffd7a152e4797b13","last_reissued_at":"2026-07-05T10:08:58.721520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:58.721520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.LO","authors_text":"Aleksandar Milosavljevic, Fabio Zanasi, Robin Piedeleu","submitted_at":"2022-04-08T20:04:21Z","abstract_excerpt":"String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency theory, quantum computing, control theory, machine learning, linguistics, and digital circuits. Rewriting theory for string diagrams relies on a combinatorial interpretation as double-pushout rewriting of certain hypergraphs. As previously studied, there is a `tension' in this interpretation: in order to make it sound and complete, we either need to add stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.04274","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/2204.04274/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":"2204.04274","created_at":"2026-07-05T10:08:58.721577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.04274v4","created_at":"2026-07-05T10:08:58.721577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.04274","created_at":"2026-07-05T10:08:58.721577+00:00"},{"alias_kind":"pith_short_12","alias_value":"IL5VB6A3V5XW","created_at":"2026-07-05T10:08:58.721577+00:00"},{"alias_kind":"pith_short_16","alias_value":"IL5VB6A3V5XW5NPS","created_at":"2026-07-05T10:08:58.721577+00:00"},{"alias_kind":"pith_short_8","alias_value":"IL5VB6A3","created_at":"2026-07-05T10:08:58.721577+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":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T","json":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T.json","graph_json":"https://pith.science/api/pith-number/IL5VB6A3V5XW5NPSO43M2FWF5T/graph.json","events_json":"https://pith.science/api/pith-number/IL5VB6A3V5XW5NPSO43M2FWF5T/events.json","paper":"https://pith.science/paper/IL5VB6A3"},"agent_actions":{"view_html":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T","download_json":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T.json","view_paper":"https://pith.science/paper/IL5VB6A3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.04274&json=true","fetch_graph":"https://pith.science/api/pith-number/IL5VB6A3V5XW5NPSO43M2FWF5T/graph.json","fetch_events":"https://pith.science/api/pith-number/IL5VB6A3V5XW5NPSO43M2FWF5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T/action/storage_attestation","attest_author":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T/action/author_attestation","sign_citation":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T/action/citation_signature","submit_replication":"https://pith.science/pith/IL5VB6A3V5XW5NPSO43M2FWF5T/action/replication_record"}},"created_at":"2026-07-05T10:08:58.721577+00:00","updated_at":"2026-07-05T10:08:58.721577+00:00"}