{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:RDKLPYAVSVFHHXT73NHI4SVYSM","short_pith_number":"pith:RDKLPYAV","schema_version":"1.0","canonical_sha256":"88d4b7e015954a73de7fdb4e8e4ab893268c1e588ebfe739c457cfd43e200d8b","source":{"kind":"arxiv","id":"math/0011037","version":1},"attestation_state":"computed","paper":{"title":"Braided Near-group Categories","license":"","headline":"","cross_cats":["math.AT"],"primary_cat":"math.QA","authors_text":"Jacob A. Siehler","submitted_at":"2000-11-06T15:03:57Z","abstract_excerpt":"A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their associativity and commutativity morphisms."},"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":"math/0011037","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.QA","submitted_at":"2000-11-06T15:03:57Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"0a989071d6e32df5e72f535a554036814af06f21b564dc9d2ab6b4775c7dcb46","abstract_canon_sha256":"8e9fef56013eda7aeeffbaddd807dba9e2bee846895fd9581639c5f5fcecf502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:34:54.484350Z","signature_b64":"GVXH1b/d0dr/35O0X3u6pj+PYNbtZxAgNE5zzWTnyqws1ulI2KtsTY8tIfrEozzE1EgXLbcoRnS35k67fqgyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88d4b7e015954a73de7fdb4e8e4ab893268c1e588ebfe739c457cfd43e200d8b","last_reissued_at":"2026-07-04T14:34:54.483996Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:34:54.483996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Braided Near-group Categories","license":"","headline":"","cross_cats":["math.AT"],"primary_cat":"math.QA","authors_text":"Jacob A. Siehler","submitted_at":"2000-11-06T15:03:57Z","abstract_excerpt":"A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their associativity and commutativity morphisms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0011037","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/math/0011037/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":"math/0011037","created_at":"2026-07-04T14:34:54.484056+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0011037v1","created_at":"2026-07-04T14:34:54.484056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0011037","created_at":"2026-07-04T14:34:54.484056+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDKLPYAVSVFH","created_at":"2026-07-04T14:34:54.484056+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDKLPYAVSVFHHXT7","created_at":"2026-07-04T14:34:54.484056+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDKLPYAV","created_at":"2026-07-04T14:34:54.484056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07353","citing_title":"A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes","ref_index":2000,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM","json":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM.json","graph_json":"https://pith.science/api/pith-number/RDKLPYAVSVFHHXT73NHI4SVYSM/graph.json","events_json":"https://pith.science/api/pith-number/RDKLPYAVSVFHHXT73NHI4SVYSM/events.json","paper":"https://pith.science/paper/RDKLPYAV"},"agent_actions":{"view_html":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM","download_json":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM.json","view_paper":"https://pith.science/paper/RDKLPYAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0011037&json=true","fetch_graph":"https://pith.science/api/pith-number/RDKLPYAVSVFHHXT73NHI4SVYSM/graph.json","fetch_events":"https://pith.science/api/pith-number/RDKLPYAVSVFHHXT73NHI4SVYSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM/action/storage_attestation","attest_author":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM/action/author_attestation","sign_citation":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM/action/citation_signature","submit_replication":"https://pith.science/pith/RDKLPYAVSVFHHXT73NHI4SVYSM/action/replication_record"}},"created_at":"2026-07-04T14:34:54.484056+00:00","updated_at":"2026-07-04T14:34:54.484056+00:00"}