{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YMP4LKXYRJGSZIJ453VMLH2ILF","short_pith_number":"pith:YMP4LKXY","schema_version":"1.0","canonical_sha256":"c31fc5aaf88a4d2ca13ceeeac59f485974d7e97630a1e862b181735d2812c4ed","source":{"kind":"arxiv","id":"2604.18346","version":2},"attestation_state":"computed","paper":{"title":"Implementing the biset category of finite groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The biset category of finite groups is implemented as a tower of standard categorical constructions in the CAP software.","cross_cats":["math.GR"],"primary_cat":"math.CT","authors_text":"Fabian Zickgraf, Marc Talleux, Mohamed Barakat","submitted_at":"2026-04-20T14:42:12Z","abstract_excerpt":"We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software projec t CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Expressing this universal property offers an elegant categorical interpretation of the Schreier-Sims orbit algorithm. Indeed, the implementatio"},"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":"2604.18346","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CT","submitted_at":"2026-04-20T14:42:12Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"6a4570da804ee275be570e8cde7c3a0bb7df57b968f48d8c26964a6461516c07","abstract_canon_sha256":"336e15afc8f78bd3afd9a63a6267e424b186fecd57f8dc7adf48019565aa2e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:03.143598Z","signature_b64":"z+zvMtxrFWL2DjIs1ZOLIXcU4i8sBtpMX47xfR0WQh2bWiXbjuumt/+EMQiXpZTUw7xEw937Y5daZuRUavIYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c31fc5aaf88a4d2ca13ceeeac59f485974d7e97630a1e862b181735d2812c4ed","last_reissued_at":"2026-05-21T02:05:03.142930Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:03.142930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementing the biset category of finite groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The biset category of finite groups is implemented as a tower of standard categorical constructions in the CAP software.","cross_cats":["math.GR"],"primary_cat":"math.CT","authors_text":"Fabian Zickgraf, Marc Talleux, Mohamed Barakat","submitted_at":"2026-04-20T14:42:12Z","abstract_excerpt":"We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software projec t CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Expressing this universal property offers an elegant categorical interpretation of the Schreier-Sims orbit algorithm. Indeed, the implementatio"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software project CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Implementing this universal property makes nontrivial use of the Schreier-Sims orbit algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the universal property of the coequalizer completion of a one-object groupoid can be realized algorithmically via the Schreier-Sims orbit algorithm in a manner that correctly implements biset composition inside the existing CAP framework.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Implementation of the biset category of finite groups in CAP as a tower of categorical constructions, with biset composition realized as Kleisli composition of a biadjunction monad using the Schreier-Sims algorithm on coequalizer completions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The biset category of finite groups is implemented as a tower of standard categorical constructions in the CAP software.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b29747137db5d69c02d1a69bc1caf082d15d588af7e988f4a323f80063025ef5"},"source":{"id":"2604.18346","kind":"arxiv","version":2},"verdict":{"id":"ecc07f85-5dba-4d6e-b29c-180b7357d187","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T03:03:17.302731Z","strongest_claim":"We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software project CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Implementing this universal property makes nontrivial use of the Schreier-Sims orbit algorithm.","one_line_summary":"Implementation of the biset category of finite groups in CAP as a tower of categorical constructions, with biset composition realized as Kleisli composition of a biadjunction monad using the Schreier-Sims algorithm on coequalizer completions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the universal property of the coequalizer completion of a one-object groupoid can be realized algorithmically via the Schreier-Sims orbit algorithm in a manner that correctly implements biset composition inside the existing CAP framework.","pith_extraction_headline":"The biset category of finite groups is implemented as a tower of standard categorical constructions in the CAP software."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.18346/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T04:09:26.190554Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b762c3b016ec7611332dab601ad9465deff018b7ce790d17297c73c2c581c938"},"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":"2604.18346","created_at":"2026-05-21T02:05:03.143021+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.18346v2","created_at":"2026-05-21T02:05:03.143021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.18346","created_at":"2026-05-21T02:05:03.143021+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMP4LKXYRJGS","created_at":"2026-05-21T02:05:03.143021+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMP4LKXYRJGSZIJ4","created_at":"2026-05-21T02:05:03.143021+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMP4LKXY","created_at":"2026-05-21T02:05:03.143021+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/YMP4LKXYRJGSZIJ453VMLH2ILF","json":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF.json","graph_json":"https://pith.science/api/pith-number/YMP4LKXYRJGSZIJ453VMLH2ILF/graph.json","events_json":"https://pith.science/api/pith-number/YMP4LKXYRJGSZIJ453VMLH2ILF/events.json","paper":"https://pith.science/paper/YMP4LKXY"},"agent_actions":{"view_html":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF","download_json":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF.json","view_paper":"https://pith.science/paper/YMP4LKXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.18346&json=true","fetch_graph":"https://pith.science/api/pith-number/YMP4LKXYRJGSZIJ453VMLH2ILF/graph.json","fetch_events":"https://pith.science/api/pith-number/YMP4LKXYRJGSZIJ453VMLH2ILF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF/action/storage_attestation","attest_author":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF/action/author_attestation","sign_citation":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF/action/citation_signature","submit_replication":"https://pith.science/pith/YMP4LKXYRJGSZIJ453VMLH2ILF/action/replication_record"}},"created_at":"2026-05-21T02:05:03.143021+00:00","updated_at":"2026-05-21T02:05:03.143021+00:00"}