{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UIEA7ZSF6KUDWM4ECWLNQNP52C","short_pith_number":"pith:UIEA7ZSF","canonical_record":{"source":{"id":"2605.11056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-11T15:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"31fe717a7445042025def55fa0de6c6c24fb303f1c2ae0a51176a2b350a84a0e","abstract_canon_sha256":"2f690fa798dc88731a17aa58ad0ea1ad4688f3679bb0618dcab62235fe4902db"},"schema_version":"1.0"},"canonical_sha256":"a2080fe645f2a83b33841596d835fdd08f0eecff33a253f4fdb34317c60569a0","source":{"kind":"arxiv","id":"2605.11056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11056","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11056v2","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11056","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"UIEA7ZSF6KUD","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_16","alias_value":"UIEA7ZSF6KUDWM4E","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_8","alias_value":"UIEA7ZSF","created_at":"2026-05-26T01:03:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UIEA7ZSF6KUDWM4ECWLNQNP52C","target":"record","payload":{"canonical_record":{"source":{"id":"2605.11056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-11T15:57:52Z","cross_cats_sorted":[],"title_canon_sha256":"31fe717a7445042025def55fa0de6c6c24fb303f1c2ae0a51176a2b350a84a0e","abstract_canon_sha256":"2f690fa798dc88731a17aa58ad0ea1ad4688f3679bb0618dcab62235fe4902db"},"schema_version":"1.0"},"canonical_sha256":"a2080fe645f2a83b33841596d835fdd08f0eecff33a253f4fdb34317c60569a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:33.345063Z","signature_b64":"5wbjVTEE6moyPqtFJhehsWdo0zZsSwVkuc0smv1effaGPuHDGcbDGB0VvhwjHec60fCWUERf9rGAme99MseeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2080fe645f2a83b33841596d835fdd08f0eecff33a253f4fdb34317c60569a0","last_reissued_at":"2026-05-26T01:03:33.344211Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:33.344211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.11056","source_version":2,"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-05-26T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGJwuP2GW9rxjk6xZtmsKFn2DezWB5WIJB8QaD8Zs9qMv9bWQDzfmVshrB+wEngRqzpDA/H/VoCcSfh5z6PIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:01:35.783383Z"},"content_sha256":"a333cbb1ddf6b7a1bf28205a60f74534b1289a2b000794345c316930c1293291","schema_version":"1.0","event_id":"sha256:a333cbb1ddf6b7a1bf28205a60f74534b1289a2b000794345c316930c1293291"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UIEA7ZSF6KUDWM4ECWLNQNP52C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diagonal parity and loop toggling for symmetric matrices over $\\mathbb F_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mohsen Aliabadi","submitted_at":"2026-05-11T15:57:52Z","abstract_excerpt":"Let $M$ be a symmetric matrix over $\\mathbb F_2$, and let $\\diag(M)$ be its diagonal vector. It is known that \\[\n  \\diag(M)\\in \\Img(M). \\] Thus the affine system $Mx=\\diag(M)$ is always solvable. We strengthen this existence statement to a parity rigidity theorem: every solution satisfies \\[\n  \\diag(M)^T x\\equiv \\rank(M)\\pmod 2 . \\] For graph matrices this gives a common extension of Sutner's odd-domination theorem and Batal's parity theorem from closed-neighborhood matrices $A(G)+I$ to arbitrary partially looped graph matrices $A(G)+D$.\n  We also study how rank and nullity change when loops a"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We include a self-contained proof that diag(M) ∈ Img(M), and we prove that every solution of Mx=diag(M) satisfies diag(M)^T x ≡ rank(M) mod 2. We also give a complete rank and nullity formula for rank-one diagonal perturbations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The matrix M is symmetric over F_2; without symmetry the inclusion diag(M) ∈ Img(M) need not hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For symmetric matrices M over F_2, diag(M) is always in the image of M and solutions satisfy a rank-parity relation, with explicit formulas for diagonal perturbations and tree-structured systems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"90a9a590d7853af5ab63a8849078b96eff0677ea07398cc3f94c187e18db79e4"},"source":{"id":"2605.11056","kind":"arxiv","version":2},"verdict":{"id":"2c16aefe-1862-44f5-b475-a7028d5a575b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T01:36:05.832952Z","strongest_claim":"We include a self-contained proof that diag(M) ∈ Img(M), and we prove that every solution of Mx=diag(M) satisfies diag(M)^T x ≡ rank(M) mod 2. We also give a complete rank and nullity formula for rank-one diagonal perturbations.","one_line_summary":"For symmetric matrices M over F_2, diag(M) is always in the image of M and solutions satisfy a rank-parity relation, with explicit formulas for diagonal perturbations and tree-structured systems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The matrix M is symmetric over F_2; without symmetry the inclusion diag(M) ∈ Img(M) need not hold.","pith_extraction_headline":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11056/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T05:22:00.402014Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T14:36:18.189004Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T11:01:16.767204Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T09:00:04.103088Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"cacb21052649e017e51a6af998ef8e3e5e1387ce0b6c788af400b42c00e0bcef"},"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":"2c16aefe-1862-44f5-b475-a7028d5a575b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-26T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nJmN3B4JW2husGZ7HtN3s68/jHNOTxC5Ozsv8IKQ063mCg3deRjYqmzURX4VbTZj89RnO67LPJK9nStQ1CTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:01:35.783917Z"},"content_sha256":"d4e84774c9f7ce4fd0bf173f3f49421c513051e52e5abe4f241b685c8c96fe4e","schema_version":"1.0","event_id":"sha256:d4e84774c9f7ce4fd0bf173f3f49421c513051e52e5abe4f241b685c8c96fe4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/bundle.json","state_url":"https://pith.science/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/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-07-05T08:01:35Z","links":{"resolver":"https://pith.science/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C","bundle":"https://pith.science/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/bundle.json","state":"https://pith.science/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIEA7ZSF6KUDWM4ECWLNQNP52C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UIEA7ZSF6KUDWM4ECWLNQNP52C","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":"2f690fa798dc88731a17aa58ad0ea1ad4688f3679bb0618dcab62235fe4902db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-11T15:57:52Z","title_canon_sha256":"31fe717a7445042025def55fa0de6c6c24fb303f1c2ae0a51176a2b350a84a0e"},"schema_version":"1.0","source":{"id":"2605.11056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.11056","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"2605.11056v2","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11056","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"UIEA7ZSF6KUD","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_16","alias_value":"UIEA7ZSF6KUDWM4E","created_at":"2026-05-26T01:03:33Z"},{"alias_kind":"pith_short_8","alias_value":"UIEA7ZSF","created_at":"2026-05-26T01:03:33Z"}],"graph_snapshots":[{"event_id":"sha256:d4e84774c9f7ce4fd0bf173f3f49421c513051e52e5abe4f241b685c8c96fe4e","target":"graph","created_at":"2026-05-26T01:03:33Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We include a self-contained proof that diag(M) ∈ Img(M), and we prove that every solution of Mx=diag(M) satisfies diag(M)^T x ≡ rank(M) mod 2. We also give a complete rank and nullity formula for rank-one diagonal perturbations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The matrix M is symmetric over F_2; without symmetry the inclusion diag(M) ∈ Img(M) need not hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For symmetric matrices M over F_2, diag(M) is always in the image of M and solutions satisfy a rank-parity relation, with explicit formulas for diagonal perturbations and tree-structured systems."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule."}],"snapshot_sha256":"90a9a590d7853af5ab63a8849078b96eff0677ea07398cc3f94c187e18db79e4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T05:22:00.402014Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T14:36:18.189004Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T11:01:16.767204Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T09:00:04.103088Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.11056/integrity.json","findings":[],"snapshot_sha256":"cacb21052649e017e51a6af998ef8e3e5e1387ce0b6c788af400b42c00e0bcef","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $M$ be a symmetric matrix over $\\mathbb F_2$, and let $\\diag(M)$ be its diagonal vector. It is known that \\[\n  \\diag(M)\\in \\Img(M). \\] Thus the affine system $Mx=\\diag(M)$ is always solvable. We strengthen this existence statement to a parity rigidity theorem: every solution satisfies \\[\n  \\diag(M)^T x\\equiv \\rank(M)\\pmod 2 . \\] For graph matrices this gives a common extension of Sutner's odd-domination theorem and Batal's parity theorem from closed-neighborhood matrices $A(G)+I$ to arbitrary partially looped graph matrices $A(G)+D$.\n  We also study how rank and nullity change when loops a","authors_text":"Mohsen Aliabadi","cross_cats":[],"headline":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-11T15:57:52Z","title":"Diagonal parity and loop toggling for symmetric matrices over $\\mathbb F_2$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.11056","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-13T01:36:05.832952Z","id":"2c16aefe-1862-44f5-b475-a7028d5a575b","model_set":{"reader":"grok-4.3"},"one_line_summary":"For symmetric matrices M over F_2, diag(M) is always in the image of M and solutions satisfy a rank-parity relation, with explicit formulas for diagonal perturbations and tree-structured systems.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Symmetric matrices over F₂ always have their diagonal vector in the column space, with solutions obeying a rank parity rule.","strongest_claim":"We include a self-contained proof that diag(M) ∈ Img(M), and we prove that every solution of Mx=diag(M) satisfies diag(M)^T x ≡ rank(M) mod 2. We also give a complete rank and nullity formula for rank-one diagonal perturbations.","weakest_assumption":"The matrix M is symmetric over F_2; without symmetry the inclusion diag(M) ∈ Img(M) need not hold."}},"verdict_id":"2c16aefe-1862-44f5-b475-a7028d5a575b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a333cbb1ddf6b7a1bf28205a60f74534b1289a2b000794345c316930c1293291","target":"record","created_at":"2026-05-26T01:03:33Z","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":"2f690fa798dc88731a17aa58ad0ea1ad4688f3679bb0618dcab62235fe4902db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-11T15:57:52Z","title_canon_sha256":"31fe717a7445042025def55fa0de6c6c24fb303f1c2ae0a51176a2b350a84a0e"},"schema_version":"1.0","source":{"id":"2605.11056","kind":"arxiv","version":2}},"canonical_sha256":"a2080fe645f2a83b33841596d835fdd08f0eecff33a253f4fdb34317c60569a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2080fe645f2a83b33841596d835fdd08f0eecff33a253f4fdb34317c60569a0","first_computed_at":"2026-05-26T01:03:33.344211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T01:03:33.344211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5wbjVTEE6moyPqtFJhehsWdo0zZsSwVkuc0smv1effaGPuHDGcbDGB0VvhwjHec60fCWUERf9rGAme99MseeAw==","signature_status":"signed_v1","signed_at":"2026-05-26T01:03:33.345063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.11056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a333cbb1ddf6b7a1bf28205a60f74534b1289a2b000794345c316930c1293291","sha256:d4e84774c9f7ce4fd0bf173f3f49421c513051e52e5abe4f241b685c8c96fe4e"],"state_sha256":"e47d8a77db362ab5bba58ce8d219fd8d7604155e024f5c8be49b805c390b902f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JBN8FJboDjxoREW7U2gV+CIbJ+pdhGniU6Rpg9Bz7Dn7m6U07D/NKoRDp31QbO2k1LIVYoeuTTlLdbYrrlBwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:01:35.786485Z","bundle_sha256":"c41759faae9f1dd545d62d76496c25c677fd43e796074bc8bbe32d9a0cfeed1d"}}