{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VCBIJOXYVL6UMSK44XTG7R4XLN","short_pith_number":"pith:VCBIJOXY","schema_version":"1.0","canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","source":{"kind":"arxiv","id":"2607.14848","version":1},"attestation_state":"computed","paper":{"title":"On Matrix Product Factorization in Association Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allen W. Herman, Bobby Miraftab","submitted_at":"2026-07-16T11:16:08Z","abstract_excerpt":"We study matrix product factorizations (MPFs) in symmetric association schemes: identities $A_SA_T=A_U$ where $A_S,A_T,A_U$ are loopless unions of basic relations and the ordinary matrix product is again a $0$-$1$ adjacency matrix. We give equivalent structural and spectral criteria for MPFs, derive valency and rank restrictions, and analyze several standard families. For $2$-class schemes, the only nontrivial loopless MPF comes from the scheme of the $5$-cycle. For $P$-polynomial schemes, the distance-regular recurrence gives strong restrictions on products $A_1A_i$. We also prove a universal"},"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":"2607.14848","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"e25d5ad199dfe9bab838fa0a15eb586029217911826aa204c4498983724bdb6d","abstract_canon_sha256":"243ab504a897caf571fe7f7d05aba8609667168ee897f3ce856fcd4959bd1c00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:21:34.357823Z","signature_b64":"0swTae/a9w8qdEWN4Cb5oNtGNKTDiroxJBKld58HoS4rmjxmZKr9cj9wE9ezbaMBxEpWnwagm3O8saPVJ+d+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","last_reissued_at":"2026-07-17T01:21:34.356984Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:21:34.356984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Matrix Product Factorization in Association Schemes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allen W. Herman, Bobby Miraftab","submitted_at":"2026-07-16T11:16:08Z","abstract_excerpt":"We study matrix product factorizations (MPFs) in symmetric association schemes: identities $A_SA_T=A_U$ where $A_S,A_T,A_U$ are loopless unions of basic relations and the ordinary matrix product is again a $0$-$1$ adjacency matrix. We give equivalent structural and spectral criteria for MPFs, derive valency and rank restrictions, and analyze several standard families. For $2$-class schemes, the only nontrivial loopless MPF comes from the scheme of the $5$-cycle. For $P$-polynomial schemes, the distance-regular recurrence gives strong restrictions on products $A_1A_i$. We also prove a universal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14848","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/2607.14848/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":"2607.14848","created_at":"2026-07-17T01:21:34.357427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.14848v1","created_at":"2026-07-17T01:21:34.357427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14848","created_at":"2026-07-17T01:21:34.357427+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCBIJOXYVL6U","created_at":"2026-07-17T01:21:34.357427+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCBIJOXYVL6UMSK4","created_at":"2026-07-17T01:21:34.357427+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCBIJOXY","created_at":"2026-07-17T01:21:34.357427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.27407","citing_title":"On $\\varepsilon$-Matrix Product Factorization of graphs","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN","json":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN.json","graph_json":"https://pith.science/api/pith-number/VCBIJOXYVL6UMSK44XTG7R4XLN/graph.json","events_json":"https://pith.science/api/pith-number/VCBIJOXYVL6UMSK44XTG7R4XLN/events.json","paper":"https://pith.science/paper/VCBIJOXY"},"agent_actions":{"view_html":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN","download_json":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN.json","view_paper":"https://pith.science/paper/VCBIJOXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.14848&json=true","fetch_graph":"https://pith.science/api/pith-number/VCBIJOXYVL6UMSK44XTG7R4XLN/graph.json","fetch_events":"https://pith.science/api/pith-number/VCBIJOXYVL6UMSK44XTG7R4XLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/action/storage_attestation","attest_author":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/action/author_attestation","sign_citation":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/action/citation_signature","submit_replication":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/action/replication_record"}},"created_at":"2026-07-17T01:21:34.357427+00:00","updated_at":"2026-07-17T01:21:34.357427+00:00"}