{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AUOBU7XXX3DHC5QUT66PPWTUIN","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":"058f34e97dabcd6c9b61dd61dde5409c8a77ff5a33a0e135999e6d13034447cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-19T05:39:20Z","title_canon_sha256":"37f8947437125131c53f75232c536fa78cdb54d06c05c6734d03ca3b0d1fbb88"},"schema_version":"1.0","source":{"id":"1702.05703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05703","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05703v1","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05703","created_at":"2026-05-18T00:50:25Z"},{"alias_kind":"pith_short_12","alias_value":"AUOBU7XXX3DH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AUOBU7XXX3DHC5QU","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AUOBU7XX","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:a7a34589e7b3300056ca72a32cc48a98e659a7d9d376f86bbd6d7cdd03028721","target":"graph","created_at":"2026-05-18T00:50:25Z","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"},"paper":{"abstract_excerpt":"Let ${\\mathbb{D}}^{m\\times n}$ be the set of $m\\times n$ matrices over a division ring $\\mathbb{D}$. Two matrices $A,B\\in {\\mathbb{D}}^{m\\times n}$ are adjacent if ${\\rm rank}(A-B)=1$. By the adjacency, ${\\mathbb{D}}^{m\\times n}$ is a connected graph. Suppose $\\mathbb{D}, \\mathbb{D}'$ are division rings and $m,n,m',n'\\geq2$ are integers. We determine additive graph homomorphisms from ${\\mathbb{D}}^{m\\times n}$ to ${\\mathbb{D}'}^{m'\\times n'}$. When $|\\mathbb{D}|\\geq 4$, we characterize the graph homomorphism $\\varphi: {\\mathbb{D}}^{n\\times n}\\rightarrow {\\mathbb{D}'}^{m'\\times n'}$ if $\\varphi","authors_text":"Kang Zhao, Li-Ping Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-19T05:39:20Z","title":"Graph homomorphisms on rectangular matrices over division rings II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05703","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:f5ea8a419dae20e92dd6399fdda401b5764e776aa219b126018114a0ddd34a67","target":"record","created_at":"2026-05-18T00:50:25Z","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":"058f34e97dabcd6c9b61dd61dde5409c8a77ff5a33a0e135999e6d13034447cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-19T05:39:20Z","title_canon_sha256":"37f8947437125131c53f75232c536fa78cdb54d06c05c6734d03ca3b0d1fbb88"},"schema_version":"1.0","source":{"id":"1702.05703","kind":"arxiv","version":1}},"canonical_sha256":"051c1a7ef7bec67176149fbcf7da74435a4e35b31fee1c6da85f1fcb70528584","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"051c1a7ef7bec67176149fbcf7da74435a4e35b31fee1c6da85f1fcb70528584","first_computed_at":"2026-05-18T00:50:25.594703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:25.594703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pGeMNz7bvBC7kml9BSFyyGpKcl6NoamWn35n+eM1nQ2yKc0JIciFbf4+moAGLTdOXeb73Vav7MVVri0GdGJCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:25.595413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5ea8a419dae20e92dd6399fdda401b5764e776aa219b126018114a0ddd34a67","sha256:a7a34589e7b3300056ca72a32cc48a98e659a7d9d376f86bbd6d7cdd03028721"],"state_sha256":"35361e6fe71c51b4b6b588be0a7cb18ac7a0f14657f15257550b309e8e37739e"}