{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PGGR3ADJOWOMOYZPRNDMXPX3HO","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b"},"schema_version":"1.0","source":{"id":"2607.27407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27407v1","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27407","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_12","alias_value":"PGGR3ADJOWOM","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGGR3ADJOWOMOYZP","created_at":"2026-07-31T00:11:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGGR3ADJ","created_at":"2026-07-31T00:11:43Z"}],"graph_snapshots":[{"event_id":"sha256:992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3","target":"graph","created_at":"2026-07-31T00:11:43Z","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.27407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bobby Miraftab, Farzad Maghsoudi, Sho Suda","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title":"On $\\varepsilon$-Matrix Product Factorization of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27407","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:e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2","target":"record","created_at":"2026-07-31T00:11:43Z","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":"96f1d942a2ef859a791c3792323aad406f421ea1e8833befe2c3120aff5e7abf","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-29T19:25:10Z","title_canon_sha256":"3cb9cce3bace3351f6670b2098945da01925fb26f03fbd755d118e4e6178767b"},"schema_version":"1.0","source":{"id":"2607.27407","kind":"arxiv","version":1}},"canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"798d1d8069759cc7632f8b46cbbefb3b8ec810077bc5186c128f569f5ba597de","first_computed_at":"2026-07-31T00:11:43.810202Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T00:11:43.810202Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27407","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:0acdad59dd3ba2eb39348281fdb0412ae98c6867189d8e1c259fb7aa81d8cc6d","sha256:5a127c6b7c95de6afe0c5487354097bb877447a2bcbdd9099331cd4b432f9f3c","sha256:e2eadd2fb37914d8ecc7335edec11b8f894a47b76e47731c17a2dc66292688e4"]}],"invalid_events":[],"applied_event_ids":["sha256:e5c5bb114747b58e0df31cace4d44ee5d9bc2eb020d0b78e0f325e1a7f64e5a2","sha256:992243c18c4fa6cd208c7a2bd2217e0a5323d65974f53d460e5cfd99c66cc4f3"],"state_sha256":"e58309e32c31a9a5f3d5ac2c734826f84475c441a8fccd4ee591438742c16587"}