{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YGSCXXQMWOOW4RXRSICHZDA4ZQ","short_pith_number":"pith:YGSCXXQM","schema_version":"1.0","canonical_sha256":"c1a42bde0cb39d6e46f192047c8c1ccc221a3cc1038495071a4a6ba9ed34678b","source":{"kind":"arxiv","id":"1806.08304","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph Categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CT","authors_text":"Brendan Fong, David I Spivak","submitted_at":"2018-06-21T16:03:04Z","abstract_excerpt":"Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is two-fold: there are many applications---including to automata, databases, circuits, linear relations, graph rewriting, and belief propagation---and yet the standard definition is so involved and ornate as to be difficult to find in the literature. Indeed, a hypergraph category is, roughly speaking, a \"symmetric monoidal category in which each object is equipped"},"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":"1806.08304","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CT","submitted_at":"2018-06-21T16:03:04Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"283f2f2c0087599e0754947e7c30d568770cc495260dedfb93eecede69aee0ea","abstract_canon_sha256":"93b087481e6c681b75c0e02eb6741e8861b5a3d7eb79912677fa9a0bbbccbdb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:58.393621Z","signature_b64":"LQfchxaE3YSKu70o9UNY8jCbE6g0keP9CrGGAAf3jIxtaD6cXtrL1sasn/S7rIMAMz5wUf5pNSktydqUjeu5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a42bde0cb39d6e46f192047c8c1ccc221a3cc1038495071a4a6ba9ed34678b","last_reissued_at":"2026-05-17T23:55:58.392879Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:58.392879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Categories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.CT","authors_text":"Brendan Fong, David I Spivak","submitted_at":"2018-06-21T16:03:04Z","abstract_excerpt":"Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is two-fold: there are many applications---including to automata, databases, circuits, linear relations, graph rewriting, and belief propagation---and yet the standard definition is so involved and ornate as to be difficult to find in the literature. Indeed, a hypergraph category is, roughly speaking, a \"symmetric monoidal category in which each object is equipped"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08304","kind":"arxiv","version":3},"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":"1806.08304","created_at":"2026-05-17T23:55:58.393005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08304v3","created_at":"2026-05-17T23:55:58.393005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08304","created_at":"2026-05-17T23:55:58.393005+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGSCXXQMWOOW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGSCXXQMWOOW4RXR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGSCXXQM","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.08934","citing_title":"From Mechanistic to Compositional Interpretability","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ","json":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ.json","graph_json":"https://pith.science/api/pith-number/YGSCXXQMWOOW4RXRSICHZDA4ZQ/graph.json","events_json":"https://pith.science/api/pith-number/YGSCXXQMWOOW4RXRSICHZDA4ZQ/events.json","paper":"https://pith.science/paper/YGSCXXQM"},"agent_actions":{"view_html":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ","download_json":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ.json","view_paper":"https://pith.science/paper/YGSCXXQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08304&json=true","fetch_graph":"https://pith.science/api/pith-number/YGSCXXQMWOOW4RXRSICHZDA4ZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YGSCXXQMWOOW4RXRSICHZDA4ZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ/action/storage_attestation","attest_author":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ/action/author_attestation","sign_citation":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ/action/citation_signature","submit_replication":"https://pith.science/pith/YGSCXXQMWOOW4RXRSICHZDA4ZQ/action/replication_record"}},"created_at":"2026-05-17T23:55:58.393005+00:00","updated_at":"2026-05-17T23:55:58.393005+00:00"}