{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","short_pith_number":"pith:PGGR3ADJ","schema_version":"1.0","canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","source":{"kind":"arxiv","id":"2607.27407","version":1},"attestation_state":"computed","paper":{"title":"On $\\varepsilon$-Matrix Product Factorization of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Farzad Maghsoudi, Sho Suda","submitted_at":"2026-07-29T19:25:10Z","abstract_excerpt":"We introduce an approximate version of matrix product factorization for graphs. A simple graph $G$ on $n$ vertices is said to admit an $\\varepsilon$-matrix product factorization if there exist simple graphs $H$ and $K$ on the same vertex set such that $A(H)A(K)$ and $A(G)$ disagree in at most $\\varepsilon n^{2}$ entries. This Hamming-type relaxation preserves, outside the error set, the exact interpretation of each edge as having a unique $H$-then-$K$ two-step witness. We establish equivalent matrix, and witness formulations, showing that the sets $N_H(w)\\times N_K(w)$ form an approximate disj"},"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.27407","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b","abstract_canon_sha256":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","last_reissued_at":"2026-07-31T00:11:43.810202Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T00:11:43.810202Z"},"graph_snapshot":{"paper":{"title":"On $\\varepsilon$-Matrix Product Factorization of graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Farzad Maghsoudi, Sho Suda","submitted_at":"2026-07-29T19:25:10Z","abstract_excerpt":"We introduce an approximate version of matrix product factorization for graphs. A simple graph $G$ on $n$ vertices is said to admit an $\\varepsilon$-matrix product factorization if there exist simple graphs $H$ and $K$ on the same vertex set such that $A(H)A(K)$ and $A(G)$ disagree in at most $\\varepsilon n^{2}$ entries. This Hamming-type relaxation preserves, outside the error set, the exact interpretation of each edge as having a unique $H$-then-$K$ two-step witness. We establish equivalent matrix, and witness formulations, showing that the sets $N_H(w)\\times N_K(w)$ form an approximate disj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27407","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.27407/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.27407","created_at":"2026-07-31T00:11:43.812595+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27407v1","created_at":"2026-07-31T00:11:43.812595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27407","created_at":"2026-07-31T00:11:43.812595+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGGR3ADJOWOM","created_at":"2026-07-31T00:11:43.812595+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGGR3ADJOWOMOYZP","created_at":"2026-07-31T00:11:43.812595+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGGR3ADJ","created_at":"2026-07-31T00:11:43.812595+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO","json":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO.json","graph_json":"https://pith.science/api/pith-number/PGGR3ADJOWOMOYZPRNDMXPX3HO/graph.json","events_json":"https://pith.science/api/pith-number/PGGR3ADJOWOMOYZPRNDMXPX3HO/events.json","paper":"https://pith.science/paper/PGGR3ADJ"},"agent_actions":{"view_html":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO","download_json":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO.json","view_paper":"https://pith.science/paper/PGGR3ADJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27407&json=true","fetch_graph":"https://pith.science/api/pith-number/PGGR3ADJOWOMOYZPRNDMXPX3HO/graph.json","fetch_events":"https://pith.science/api/pith-number/PGGR3ADJOWOMOYZPRNDMXPX3HO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/action/storage_attestation","attest_author":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/action/author_attestation","sign_citation":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/action/citation_signature","submit_replication":"https://pith.science/pith/PGGR3ADJOWOMOYZPRNDMXPX3HO/action/replication_record"}},"created_at":"2026-07-31T00:11:43.812595+00:00","updated_at":"2026-07-31T00:11:43.812595+00:00"}