{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VCBIJOXYVL6UMSK44XTG7R4XLN","short_pith_number":"pith:VCBIJOXY","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"},"canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","source":{"kind":"arxiv","id":"2607.14848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14848","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14848v1","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14848","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"VCBIJOXYVL6U","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_16","alias_value":"VCBIJOXYVL6UMSK4","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_8","alias_value":"VCBIJOXY","created_at":"2026-07-17T01:21:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VCBIJOXYVL6UMSK44XTG7R4XLN","target":"record","payload":{"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"},"canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","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"},"source_kind":"arxiv","source_id":"2607.14848","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-17T01:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbwpXepbNGLRI0QblhLBVPcBLanQj7C0gXKcg7IObrB211MmrAwFGUsYr49E0uJsYjiaOrlMsjBxaNHefk6QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:58:14.517065Z"},"content_sha256":"097df84159b7e46573d19a53cf314db1fe692b7dcc3ccb05662b1c6c8d8c7d9a","schema_version":"1.0","event_id":"sha256:097df84159b7e46573d19a53cf314db1fe692b7dcc3ccb05662b1c6c8d8c7d9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VCBIJOXYVL6UMSK44XTG7R4XLN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-17T01:21:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJdBvEGOHP3jfcqvzDwL6RT4bAJ1stgNBvp1GvlIxn9YYby9lVh7EcBa5gsEx8hnuqPAsBrSOoEGcif9WOBLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T17:58:14.517573Z"},"content_sha256":"957d1c4b39cee939e37423651a9254365c6e41ec3a9484780dbdd2a95cc4a281","schema_version":"1.0","event_id":"sha256:957d1c4b39cee939e37423651a9254365c6e41ec3a9484780dbdd2a95cc4a281"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/bundle.json","state_url":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T17:58:14Z","links":{"resolver":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN","bundle":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/bundle.json","state":"https://pith.science/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCBIJOXYVL6UMSK44XTG7R4XLN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VCBIJOXYVL6UMSK44XTG7R4XLN","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":"243ab504a897caf571fe7f7d05aba8609667168ee897f3ce856fcd4959bd1c00","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:16:08Z","title_canon_sha256":"e25d5ad199dfe9bab838fa0a15eb586029217911826aa204c4498983724bdb6d"},"schema_version":"1.0","source":{"id":"2607.14848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14848","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14848v1","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14848","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_12","alias_value":"VCBIJOXYVL6U","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_16","alias_value":"VCBIJOXYVL6UMSK4","created_at":"2026-07-17T01:21:34Z"},{"alias_kind":"pith_short_8","alias_value":"VCBIJOXY","created_at":"2026-07-17T01:21:34Z"}],"graph_snapshots":[{"event_id":"sha256:957d1c4b39cee939e37423651a9254365c6e41ec3a9484780dbdd2a95cc4a281","target":"graph","created_at":"2026-07-17T01:21:34Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.14848/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Allen W. Herman, Bobby Miraftab","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:16:08Z","title":"On Matrix Product Factorization in Association Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14848","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:097df84159b7e46573d19a53cf314db1fe692b7dcc3ccb05662b1c6c8d8c7d9a","target":"record","created_at":"2026-07-17T01:21:34Z","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":"243ab504a897caf571fe7f7d05aba8609667168ee897f3ce856fcd4959bd1c00","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T11:16:08Z","title_canon_sha256":"e25d5ad199dfe9bab838fa0a15eb586029217911826aa204c4498983724bdb6d"},"schema_version":"1.0","source":{"id":"2607.14848","kind":"arxiv","version":1}},"canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a88284baf8aafd46495ce5e66fc7975b7523f15fddf8ad5479048d229f88ff7c","first_computed_at":"2026-07-17T01:21:34.356984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:21:34.356984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0swTae/a9w8qdEWN4Cb5oNtGNKTDiroxJBKld58HoS4rmjxmZKr9cj9wE9ezbaMBxEpWnwagm3O8saPVJ+d+CQ==","signature_status":"signed_v1","signed_at":"2026-07-17T01:21:34.357823Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:097df84159b7e46573d19a53cf314db1fe692b7dcc3ccb05662b1c6c8d8c7d9a","sha256:957d1c4b39cee939e37423651a9254365c6e41ec3a9484780dbdd2a95cc4a281"],"state_sha256":"ea21b9577bbaa71a9b5265c98fcf2ef104797d2cd03833eb72793da4c722b01b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6ZbeV2rycCacT1Sfk287ItbVw5r9XJpuQWWqQjrytD/chSCQxIviFGdUi8s+jpmFBbJLs5r9T9HqjjHf3XSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T17:58:14.522701Z","bundle_sha256":"ea64540d66370789da12f7f923148d8e1f38bd34a6945d25ce6beedd71a17cd6"}}