{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GJ2457HSDLZMIYAITELC5LESKJ","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":"f2afb656456493fb62430477ebd3fc89f08037c645339685442061fb4451031a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-15T06:02:30Z","title_canon_sha256":"5f00cd0cdd5cd6f8ebdc2b6c535632ce067834da48e26955e16c614024af6322"},"schema_version":"1.0","source":{"id":"1201.3060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.3060","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1201.3060v2","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3060","created_at":"2026-05-18T02:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"GJ2457HSDLZM","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJ2457HSDLZMIYAI","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJ2457HS","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:3c99dfca26b157f22b6870b2bc4a0d9d12136c3727a1fcf1402fb957e9c45151","target":"graph","created_at":"2026-05-18T02:53:15Z","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":"The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the number of vertices of every reduced graph of rank r is at most $m(r)=2^{(r+2)/2}-2$ if r is even and $m(r) = 5\\cdot2^{(r-3)/2}-2$ if r is odd. In this article, we prove that if the conjecture is not true, then there would be a counterexample of rank at most $46$. We also show that every reduced graph of rank r has at most $8m(r)+14$ vertices.","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-15T06:02:30Z","title":"On Order and Rank of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3060","kind":"arxiv","version":2},"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:151f678bcee554ba622c89474d59e28a9a2cb6a2d918cae80485324e2279f6f9","target":"record","created_at":"2026-05-18T02:53:15Z","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":"f2afb656456493fb62430477ebd3fc89f08037c645339685442061fb4451031a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-15T06:02:30Z","title_canon_sha256":"5f00cd0cdd5cd6f8ebdc2b6c535632ce067834da48e26955e16c614024af6322"},"schema_version":"1.0","source":{"id":"1201.3060","kind":"arxiv","version":2}},"canonical_sha256":"3275cefcf21af2c4600899162eac92524805f3197c5319d34a5c8b81e405d716","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3275cefcf21af2c4600899162eac92524805f3197c5319d34a5c8b81e405d716","first_computed_at":"2026-05-18T02:53:15.719775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:15.719775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PqjFmqlxgb8V8HV6+cgnd39u+IuEFESA7ftKfChukz5T+bMhF6LnHcNubnCcllPck5x3J/bIyLp1R+TvtH1jAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:15.720430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.3060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:151f678bcee554ba622c89474d59e28a9a2cb6a2d918cae80485324e2279f6f9","sha256:3c99dfca26b157f22b6870b2bc4a0d9d12136c3727a1fcf1402fb957e9c45151"],"state_sha256":"48981157a1be3d9a698f14607fd7648246a66c6710e30773cf19d6890a3ef36b"}