{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:CCPYXXGLWAYLQJNSWCNCAIDPBH","short_pith_number":"pith:CCPYXXGL","schema_version":"1.0","canonical_sha256":"109f8bdccbb030b825b2b09a20206f09ce08a858206e3c36419826d6e5dbbfa1","source":{"kind":"arxiv","id":"2112.06818","version":1},"attestation_state":"computed","paper":{"title":"Composable constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","quant-ph"],"primary_cat":"math.CT","authors_text":"Augustin Vanrietvelde, Matt Wilson","submitted_at":"2021-12-13T17:24:47Z","abstract_excerpt":"We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a \"composable constraint encoding\". We show that every composable constraint encoding can be used to construct an equivalent notion of a constrained category in which morphisms are supplemented with the constraints they satisfy. We further describe how to express the compatibility of constraints with additional categorical structures of their targets, such as parallel composition, compactness, and time-symmetry. We present a variety of concr"},"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":"2112.06818","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CT","submitted_at":"2021-12-13T17:24:47Z","cross_cats_sorted":["cs.LO","quant-ph"],"title_canon_sha256":"550243ff85200143cac1a5e5c21ef9ba8623fcbdc03d67240c9d72f951161330","abstract_canon_sha256":"db6f7b690143dd282a7e6ce3b16decf4a9c743f1a179c0943d09f1b7b151aa4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:40:17.359867Z","signature_b64":"a2Eefcg3adCLchZOx4+A9Rk0fDbi7XI6gI2R1pIDN9Y0ZVBR2+ElxE0eYJ/jSXl22dzTxXOMy6qw61/foS65Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"109f8bdccbb030b825b2b09a20206f09ce08a858206e3c36419826d6e5dbbfa1","last_reissued_at":"2026-07-05T03:40:17.359378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:40:17.359378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composable constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","quant-ph"],"primary_cat":"math.CT","authors_text":"Augustin Vanrietvelde, Matt Wilson","submitted_at":"2021-12-13T17:24:47Z","abstract_excerpt":"We introduce a notion of compatibility between constraint encoding and compositional structure. Phrased in the language of category theory, it is given by a \"composable constraint encoding\". We show that every composable constraint encoding can be used to construct an equivalent notion of a constrained category in which morphisms are supplemented with the constraints they satisfy. We further describe how to express the compatibility of constraints with additional categorical structures of their targets, such as parallel composition, compactness, and time-symmetry. We present a variety of concr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.06818","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/2112.06818/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":"2112.06818","created_at":"2026-07-05T03:40:17.359443+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.06818v1","created_at":"2026-07-05T03:40:17.359443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.06818","created_at":"2026-07-05T03:40:17.359443+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCPYXXGLWAYL","created_at":"2026-07-05T03:40:17.359443+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCPYXXGLWAYLQJNS","created_at":"2026-07-05T03:40:17.359443+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCPYXXGL","created_at":"2026-07-05T03:40:17.359443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2207.09180","citing_title":"Polycategorical Constructions for Unitary Supermaps of Arbitrary Dimension","ref_index":54,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH","json":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH.json","graph_json":"https://pith.science/api/pith-number/CCPYXXGLWAYLQJNSWCNCAIDPBH/graph.json","events_json":"https://pith.science/api/pith-number/CCPYXXGLWAYLQJNSWCNCAIDPBH/events.json","paper":"https://pith.science/paper/CCPYXXGL"},"agent_actions":{"view_html":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH","download_json":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH.json","view_paper":"https://pith.science/paper/CCPYXXGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.06818&json=true","fetch_graph":"https://pith.science/api/pith-number/CCPYXXGLWAYLQJNSWCNCAIDPBH/graph.json","fetch_events":"https://pith.science/api/pith-number/CCPYXXGLWAYLQJNSWCNCAIDPBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH/action/storage_attestation","attest_author":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH/action/author_attestation","sign_citation":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH/action/citation_signature","submit_replication":"https://pith.science/pith/CCPYXXGLWAYLQJNSWCNCAIDPBH/action/replication_record"}},"created_at":"2026-07-05T03:40:17.359443+00:00","updated_at":"2026-07-05T03:40:17.359443+00:00"}