{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2EZX6EGAJSCCV3PKLNXMHNL7PC","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":"27230e232ea9dc928103877fc860034e380c5d4a42cfd8397257e8ec3487e4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2011-12-07T22:22:44Z","title_canon_sha256":"93df2db8584a2e7d6c4948fffc65cf8ba953daf25adf68fcdf3df94aa6108248"},"schema_version":"1.0","source":{"id":"1112.1718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1718","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1718v1","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1718","created_at":"2026-05-18T04:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"2EZX6EGAJSCC","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2EZX6EGAJSCCV3PK","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2EZX6EGA","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:699ef5bfee35e623d33616e140844b80282ab9a722d3ad08f2d4768ea9786953","target":"graph","created_at":"2026-05-18T04:06:45Z","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":"In this paper we introduce a new parameter for a graph called the {\\it minimum universal rank}. This parameter is similar to the minimum rank of a graph. For a graph $G$ the minimum universal rank of $G$ is the minimum rank over all matrices of the form \\[ U(\\alpha, \\beta, \\gamma, \\delta) = \\alpha A + \\beta I + \\gamma J + \\delta D \\] where $A$ is the adjacency matrix of $G$, $J$ is the all ones matrix and $D$ is the matrix with the degrees of the vertices in the main diagonal, and $\\alpha\\neq 0, \\beta, \\gamma, \\delta$ are scalars. Bounds for general graphs based on known graph parameters are g","authors_text":"Bahman Ahmadi, Fatemeh Alinaghipour, Karen Meagher, Shahla Nasserasr, Shaun M. Fallat, Yi-Zheng Fan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2011-12-07T22:22:44Z","title":"The minimum rank of universal adjacency matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1718","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:4dc37d7b1b3d5a21698604ebe0e3494094fa407ccc6de5088d6f55e754d767d0","target":"record","created_at":"2026-05-18T04:06:45Z","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":"27230e232ea9dc928103877fc860034e380c5d4a42cfd8397257e8ec3487e4f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2011-12-07T22:22:44Z","title_canon_sha256":"93df2db8584a2e7d6c4948fffc65cf8ba953daf25adf68fcdf3df94aa6108248"},"schema_version":"1.0","source":{"id":"1112.1718","kind":"arxiv","version":1}},"canonical_sha256":"d1337f10c04c842aedea5b6ec3b57f78bea355b065dc20f6993defe7adae5e75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1337f10c04c842aedea5b6ec3b57f78bea355b065dc20f6993defe7adae5e75","first_computed_at":"2026-05-18T04:06:45.808520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:45.808520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p53rrUA5YNPEwYs7xpETkMHUT3ZQjLDrdAts6iIoSc310NysaxGd7Rx26wwnJke+7CRDJtDNRjrpJbYv8ET0Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:45.809164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc37d7b1b3d5a21698604ebe0e3494094fa407ccc6de5088d6f55e754d767d0","sha256:699ef5bfee35e623d33616e140844b80282ab9a722d3ad08f2d4768ea9786953"],"state_sha256":"9279ab4e5783b661ddcdddfa300d1cb165f49714e5c9a1ba7cd858086dbc9850"}