{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2EZX6EGAJSCCV3PKLNXMHNL7PC","short_pith_number":"pith:2EZX6EGA","schema_version":"1.0","canonical_sha256":"d1337f10c04c842aedea5b6ec3b57f78bea355b065dc20f6993defe7adae5e75","source":{"kind":"arxiv","id":"1112.1718","version":1},"attestation_state":"computed","paper":{"title":"The minimum rank of universal adjacency matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Bahman Ahmadi, Fatemeh Alinaghipour, Karen Meagher, Shahla Nasserasr, Shaun M. Fallat, Yi-Zheng Fan","submitted_at":"2011-12-07T22:22:44Z","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"},"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":"1112.1718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.SP","submitted_at":"2011-12-07T22:22:44Z","cross_cats_sorted":[],"title_canon_sha256":"93df2db8584a2e7d6c4948fffc65cf8ba953daf25adf68fcdf3df94aa6108248","abstract_canon_sha256":"27230e232ea9dc928103877fc860034e380c5d4a42cfd8397257e8ec3487e4f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:45.809164Z","signature_b64":"p53rrUA5YNPEwYs7xpETkMHUT3ZQjLDrdAts6iIoSc310NysaxGd7Rx26wwnJke+7CRDJtDNRjrpJbYv8ET0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1337f10c04c842aedea5b6ec3b57f78bea355b065dc20f6993defe7adae5e75","last_reissued_at":"2026-05-18T04:06:45.808520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:45.808520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The minimum rank of universal adjacency matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.SP","authors_text":"Bahman Ahmadi, Fatemeh Alinaghipour, Karen Meagher, Shahla Nasserasr, Shaun M. Fallat, Yi-Zheng Fan","submitted_at":"2011-12-07T22:22:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1718","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":""},"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":"1112.1718","created_at":"2026-05-18T04:06:45.808609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1718v1","created_at":"2026-05-18T04:06:45.808609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1718","created_at":"2026-05-18T04:06:45.808609+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EZX6EGAJSCC","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EZX6EGAJSCCV3PK","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EZX6EGA","created_at":"2026-05-18T12:26:18.847500+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/2EZX6EGAJSCCV3PKLNXMHNL7PC","json":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC.json","graph_json":"https://pith.science/api/pith-number/2EZX6EGAJSCCV3PKLNXMHNL7PC/graph.json","events_json":"https://pith.science/api/pith-number/2EZX6EGAJSCCV3PKLNXMHNL7PC/events.json","paper":"https://pith.science/paper/2EZX6EGA"},"agent_actions":{"view_html":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC","download_json":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC.json","view_paper":"https://pith.science/paper/2EZX6EGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1718&json=true","fetch_graph":"https://pith.science/api/pith-number/2EZX6EGAJSCCV3PKLNXMHNL7PC/graph.json","fetch_events":"https://pith.science/api/pith-number/2EZX6EGAJSCCV3PKLNXMHNL7PC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC/action/storage_attestation","attest_author":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC/action/author_attestation","sign_citation":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC/action/citation_signature","submit_replication":"https://pith.science/pith/2EZX6EGAJSCCV3PKLNXMHNL7PC/action/replication_record"}},"created_at":"2026-05-18T04:06:45.808609+00:00","updated_at":"2026-05-18T04:06:45.808609+00:00"}