{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OE7W6HQGD3ILMUCSAUMCXVCFHU","short_pith_number":"pith:OE7W6HQG","schema_version":"1.0","canonical_sha256":"713f6f1e061ed0b6505205182bd4453d31364e751126186e6da063d257aca519","source":{"kind":"arxiv","id":"2412.17790","version":1},"attestation_state":"computed","paper":{"title":"Classification of exchange relation planar algebras through sieving forest fusion graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OA","authors_text":"Fan Lu, Zhengwei Liu","submitted_at":"2024-12-23T18:49:39Z","abstract_excerpt":"We suggest a classification scheme for subfactorizable fusion bialgebras, particularly for exchange relation planar algebras. This scheme begins by transforming infinite diagrammatic consistency equations of exchange relations into a finite set of algebraic equations of degree at most 3. We then introduce a key concept, the fusion graph of a fusion bialgebra, and prove that the fusion graph for any minimal projection is a forest if and only if the planar algebra has an exchange relation. For each fusion graph, the system of degree 3 equations reduces to linear and quadratic equations that are "},"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":"2412.17790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2024-12-23T18:49:39Z","cross_cats_sorted":[],"title_canon_sha256":"eb74d67e14c6a997b5f81b1cac810200b622ce879eefbd2d2d07f93d92e354fd","abstract_canon_sha256":"cb4c6fc198b05d30210bbd7ba35c4cc433ba660f6676ccc008143a8619c6163f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:27.378375Z","signature_b64":"2Dq95aDRb6XSGnAOZhVDALUbR+q/G8sALCgO2rFhJet6fl6E0+LDRuIQlhT2HH8WerocxUF5QxgGibaUuawMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"713f6f1e061ed0b6505205182bd4453d31364e751126186e6da063d257aca519","last_reissued_at":"2026-07-05T09:53:27.377755Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:27.377755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of exchange relation planar algebras through sieving forest fusion graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OA","authors_text":"Fan Lu, Zhengwei Liu","submitted_at":"2024-12-23T18:49:39Z","abstract_excerpt":"We suggest a classification scheme for subfactorizable fusion bialgebras, particularly for exchange relation planar algebras. This scheme begins by transforming infinite diagrammatic consistency equations of exchange relations into a finite set of algebraic equations of degree at most 3. We then introduce a key concept, the fusion graph of a fusion bialgebra, and prove that the fusion graph for any minimal projection is a forest if and only if the planar algebra has an exchange relation. For each fusion graph, the system of degree 3 equations reduces to linear and quadratic equations that are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.17790","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/2412.17790/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":"2412.17790","created_at":"2026-07-05T09:53:27.377831+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.17790v1","created_at":"2026-07-05T09:53:27.377831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.17790","created_at":"2026-07-05T09:53:27.377831+00:00"},{"alias_kind":"pith_short_12","alias_value":"OE7W6HQGD3IL","created_at":"2026-07-05T09:53:27.377831+00:00"},{"alias_kind":"pith_short_16","alias_value":"OE7W6HQGD3ILMUCS","created_at":"2026-07-05T09:53:27.377831+00:00"},{"alias_kind":"pith_short_8","alias_value":"OE7W6HQG","created_at":"2026-07-05T09:53:27.377831+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05324","citing_title":"A 2D-CFT Factory: Critical Lattice Models from Competing Anyon Condensation Processes in SymTO/SymTFT","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU","json":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU.json","graph_json":"https://pith.science/api/pith-number/OE7W6HQGD3ILMUCSAUMCXVCFHU/graph.json","events_json":"https://pith.science/api/pith-number/OE7W6HQGD3ILMUCSAUMCXVCFHU/events.json","paper":"https://pith.science/paper/OE7W6HQG"},"agent_actions":{"view_html":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU","download_json":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU.json","view_paper":"https://pith.science/paper/OE7W6HQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.17790&json=true","fetch_graph":"https://pith.science/api/pith-number/OE7W6HQGD3ILMUCSAUMCXVCFHU/graph.json","fetch_events":"https://pith.science/api/pith-number/OE7W6HQGD3ILMUCSAUMCXVCFHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU/action/storage_attestation","attest_author":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU/action/author_attestation","sign_citation":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU/action/citation_signature","submit_replication":"https://pith.science/pith/OE7W6HQGD3ILMUCSAUMCXVCFHU/action/replication_record"}},"created_at":"2026-07-05T09:53:27.377831+00:00","updated_at":"2026-07-05T09:53:27.377831+00:00"}