{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M7SP7DE7TEAEOO3CVVHEJOPSNL","short_pith_number":"pith:M7SP7DE7","schema_version":"1.0","canonical_sha256":"67e4ff8c9f9900473b62ad4e44b9f26af800808ffa2b164691355b883c65fc7a","source":{"kind":"arxiv","id":"2502.05373","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Problems in Categories of Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"cs.DS","authors_text":"Nicolas Faro{\\ss}, Sebastian Volz","submitted_at":"2025-02-07T22:54:55Z","abstract_excerpt":"Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present efficient algorithms and data-structures for partitions of sets and their corresponding category operations, including a concrete implementation in the computer algebra system OSCAR. Moreover, we show that there exists a category of partitions for which the natural computational problems of deciding membership of a given partition as well as counting partitions of"},"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":"2502.05373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-07T22:54:55Z","cross_cats_sorted":["math.QA"],"title_canon_sha256":"6abda356a1ff581ff9675b0ee03392e88a06ff0f0c558a225c20ba666b046d75","abstract_canon_sha256":"9105b869a56afc34a6ea4e6f6cfa7b9a8157ececc1e01cfda9fd3b4210c3f0a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:37.107132Z","signature_b64":"zldp8Ld9wu8cu6OMw+rI4/aRqmOafC/+nXozXRLFXx9ql7KRfaeqrR+NhWqj3Prp/TZws9pBHu+pyLZD8Q+ACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e4ff8c9f9900473b62ad4e44b9f26af800808ffa2b164691355b883c65fc7a","last_reissued_at":"2026-07-05T10:11:37.106637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:37.106637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Problems in Categories of Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"cs.DS","authors_text":"Nicolas Faro{\\ss}, Sebastian Volz","submitted_at":"2025-02-07T22:54:55Z","abstract_excerpt":"Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present efficient algorithms and data-structures for partitions of sets and their corresponding category operations, including a concrete implementation in the computer algebra system OSCAR. Moreover, we show that there exists a category of partitions for which the natural computational problems of deciding membership of a given partition as well as counting partitions of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05373","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/2502.05373/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":"2502.05373","created_at":"2026-07-05T10:11:37.106700+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05373v1","created_at":"2026-07-05T10:11:37.106700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05373","created_at":"2026-07-05T10:11:37.106700+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7SP7DE7TEAE","created_at":"2026-07-05T10:11:37.106700+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7SP7DE7TEAEOO3C","created_at":"2026-07-05T10:11:37.106700+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7SP7DE7","created_at":"2026-07-05T10:11:37.106700+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL","json":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL.json","graph_json":"https://pith.science/api/pith-number/M7SP7DE7TEAEOO3CVVHEJOPSNL/graph.json","events_json":"https://pith.science/api/pith-number/M7SP7DE7TEAEOO3CVVHEJOPSNL/events.json","paper":"https://pith.science/paper/M7SP7DE7"},"agent_actions":{"view_html":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL","download_json":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL.json","view_paper":"https://pith.science/paper/M7SP7DE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05373&json=true","fetch_graph":"https://pith.science/api/pith-number/M7SP7DE7TEAEOO3CVVHEJOPSNL/graph.json","fetch_events":"https://pith.science/api/pith-number/M7SP7DE7TEAEOO3CVVHEJOPSNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL/action/storage_attestation","attest_author":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL/action/author_attestation","sign_citation":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL/action/citation_signature","submit_replication":"https://pith.science/pith/M7SP7DE7TEAEOO3CVVHEJOPSNL/action/replication_record"}},"created_at":"2026-07-05T10:11:37.106700+00:00","updated_at":"2026-07-05T10:11:37.106700+00:00"}