{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JVZLWUZX4PPIRZRK4T77YMO64K","short_pith_number":"pith:JVZLWUZX","schema_version":"1.0","canonical_sha256":"4d72bb5337e3de88e62ae4fffc31dee29088a23ddeb93da4a4ae9c08b436ffe4","source":{"kind":"arxiv","id":"1406.5942","version":2},"attestation_state":"computed","paper":{"title":"Finite matrices are complete for (dagger-)hypergraph categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Aleks Kissinger","submitted_at":"2014-06-23T15:25:28Z","abstract_excerpt":"Hypergraph categories are symmetric monoidal categories where each object is equipped with a special commutative Frobenius algebra (SCFA). Dagger-hypergraph categories are the same, but with dagger-symmetric monoidal categories and dagger-SCFAs. In this paper, we show that finite matrices over a field K of characteristic 0 are complete for hypergraph categories, and that finite matrices where K has a non-trivial involution are complete for dagger-hypergraph categories."},"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":"1406.5942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2014-06-23T15:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"3a5114b71798705aa8aaad4dbbf4f32aaf96a2abe36e9d43110f74e0e385702a","abstract_canon_sha256":"d7f478a47e994489cf7bd29a6db61a2bc98d087e04749fc17ff8c9a717d55ffd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:05.164509Z","signature_b64":"UC8k+67snsfrhD0jzJL+zsqYofZp2cCuhI3rOwbAyhxt4Zg/X+DWHLHRWD/a6ubX+P5drYc8Y+ieBDW1jdFbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d72bb5337e3de88e62ae4fffc31dee29088a23ddeb93da4a4ae9c08b436ffe4","last_reissued_at":"2026-05-18T01:35:05.163807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:05.163807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite matrices are complete for (dagger-)hypergraph categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Aleks Kissinger","submitted_at":"2014-06-23T15:25:28Z","abstract_excerpt":"Hypergraph categories are symmetric monoidal categories where each object is equipped with a special commutative Frobenius algebra (SCFA). Dagger-hypergraph categories are the same, but with dagger-symmetric monoidal categories and dagger-SCFAs. In this paper, we show that finite matrices over a field K of characteristic 0 are complete for hypergraph categories, and that finite matrices where K has a non-trivial involution are complete for dagger-hypergraph categories."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5942","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1406.5942","created_at":"2026-05-18T01:35:05.163910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5942v2","created_at":"2026-05-18T01:35:05.163910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5942","created_at":"2026-05-18T01:35:05.163910+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVZLWUZX4PPI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVZLWUZX4PPIRZRK","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVZLWUZX","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.08934","citing_title":"From Mechanistic to Compositional Interpretability","ref_index":45,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25321","citing_title":"Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K","json":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K.json","graph_json":"https://pith.science/api/pith-number/JVZLWUZX4PPIRZRK4T77YMO64K/graph.json","events_json":"https://pith.science/api/pith-number/JVZLWUZX4PPIRZRK4T77YMO64K/events.json","paper":"https://pith.science/paper/JVZLWUZX"},"agent_actions":{"view_html":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K","download_json":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K.json","view_paper":"https://pith.science/paper/JVZLWUZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5942&json=true","fetch_graph":"https://pith.science/api/pith-number/JVZLWUZX4PPIRZRK4T77YMO64K/graph.json","fetch_events":"https://pith.science/api/pith-number/JVZLWUZX4PPIRZRK4T77YMO64K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K/action/storage_attestation","attest_author":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K/action/author_attestation","sign_citation":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K/action/citation_signature","submit_replication":"https://pith.science/pith/JVZLWUZX4PPIRZRK4T77YMO64K/action/replication_record"}},"created_at":"2026-05-18T01:35:05.163910+00:00","updated_at":"2026-05-18T01:35:05.163910+00:00"}