{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RXNYAVUYBP45MV4QCSG4J2JNBQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d12b9e9a6326f54161e4843f7617348fc249405105716b78bb621b2ed1565630","cross_cats_sorted":["hep-th","math-ph","math.CT","math.MP","math.QA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2026-05-07T17:58:40Z","title_canon_sha256":"0a63ff6a2d9686c4b4e033f05fc7d41def669caa597781acdbe64ff79b003be7"},"schema_version":"1.0","source":{"id":"2605.06661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.06661","created_at":"2026-05-20T01:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.06661v2","created_at":"2026-05-20T01:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.06661","created_at":"2026-05-20T01:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"RXNYAVUYBP45","created_at":"2026-05-20T01:06:09Z"},{"alias_kind":"pith_short_16","alias_value":"RXNYAVUYBP45MV4Q","created_at":"2026-05-20T01:06:09Z"},{"alias_kind":"pith_short_8","alias_value":"RXNYAVUY","created_at":"2026-05-20T01:06:09Z"}],"graph_snapshots":[{"event_id":"sha256:f8a8c7e6f98abba26d0288700dc3e48d7a79e6525b2a78edca478763c7059f89","target":"graph","created_at":"2026-05-20T01:06:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We introduce the pro-tensor network, a categorification of the tensor network, as a fully rigorous yet graphically transparent framework for studying the collection of many many-body theories, which we dub many-many-body theory."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a well-defined pro-tensor network can be constructed and used for physical calculations while dispensing with the assumptions of semisimplicity, finiteness, and rigidity."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Pro-tensor networks form a categorified framework for many-many-body theories that recovers the Levin-Wen model and characterizes particles as modules over promonads without requiring semisimplicity, finiteness or rigidity."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Pro-tensor networks categorify tensor networks to study many-many-body theories without semisimplicity or finiteness."}],"snapshot_sha256":"c4dbbf18f67997fb96761f1975d8a26111c10872e2798ff6b3933de6409bedc9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T18:01:19.114331Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T12:29:56.084827Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.06661/integrity.json","findings":[],"snapshot_sha256":"a7621981fab139558597985ae80d0eefc71c9bb98ae6e504a706eae857a8bc7b","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce the pro-tensor network, a categorification of the tensor network, as a fully rigorous yet graphically transparent framework for studying the collection of many many-body theories, which we dub many-many-body theory. We provide a comprehensive toolbox for the graphical calculations using pro-tensor networks. As applications, we recover the Levin-Wen model as a \"uniform\" pro-tensor network and generalize a result of Kitaev and Kong by characterizing particles as modules over promonads. One can also interpret the string-net pro-tensor network as the space of symmetric tensor networks","authors_text":"Ansi Bai, Gen Yue, Linqian Wu, Tian Lan","cross_cats":["hep-th","math-ph","math.CT","math.MP","math.QA"],"headline":"Pro-tensor networks categorify tensor networks to study many-many-body theories without semisimplicity or finiteness.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2026-05-07T17:58:40Z","title":"Pro-Tensor Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.06661","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T05:29:00.531655Z","id":"6009f93a-b338-46d3-8e19-f3f325dae0de","model_set":{"reader":"grok-4.3"},"one_line_summary":"Pro-tensor networks form a categorified framework for many-many-body theories that recovers the Levin-Wen model and characterizes particles as modules over promonads without requiring semisimplicity, finiteness or rigidity.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Pro-tensor networks categorify tensor networks to study many-many-body theories without semisimplicity or finiteness.","strongest_claim":"We introduce the pro-tensor network, a categorification of the tensor network, as a fully rigorous yet graphically transparent framework for studying the collection of many many-body theories, which we dub many-many-body theory.","weakest_assumption":"That a well-defined pro-tensor network can be constructed and used for physical calculations while dispensing with the assumptions of semisimplicity, finiteness, and rigidity."}},"verdict_id":"6009f93a-b338-46d3-8e19-f3f325dae0de"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5ca03cb6c3c5cc79e8df108196bfe9e86ad6ad42727e801ff19aaa96e6bc3d18","target":"record","created_at":"2026-05-20T01:06:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d12b9e9a6326f54161e4843f7617348fc249405105716b78bb621b2ed1565630","cross_cats_sorted":["hep-th","math-ph","math.CT","math.MP","math.QA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.str-el","submitted_at":"2026-05-07T17:58:40Z","title_canon_sha256":"0a63ff6a2d9686c4b4e033f05fc7d41def669caa597781acdbe64ff79b003be7"},"schema_version":"1.0","source":{"id":"2605.06661","kind":"arxiv","version":2}},"canonical_sha256":"8ddb8056980bf9d65790148dc4e92d0c1f465adbd122f2fef45e1f8964c26afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ddb8056980bf9d65790148dc4e92d0c1f465adbd122f2fef45e1f8964c26afb","first_computed_at":"2026-05-20T01:06:09.814883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:06:09.814883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yp7SlotA+iObIf3Q1NK80obT4WTrHvD3o/rupdvTcS/1DAhXnQQbvioS+tqXl9ON2BHa85s4yPUDaxxYo1VjBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T01:06:09.815614Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.06661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ca03cb6c3c5cc79e8df108196bfe9e86ad6ad42727e801ff19aaa96e6bc3d18","sha256:f8a8c7e6f98abba26d0288700dc3e48d7a79e6525b2a78edca478763c7059f89"],"state_sha256":"d90369a907f29bd0cdc9e4b84cc4e09570a3dfd1170a2d110f7566a3ba7b242b"}