{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TZPH52UE3L4IYB7JCK2SSGFJHO","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":"c0954197ea741fadbb5ee9a4f75c9a98e14e290e94015b8e0214d610722b3afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-14T12:24:32Z","title_canon_sha256":"63543628ea33ad218a607c6ffff72f1f47931d7c2d7e92c2de0207ef807e4c4d"},"schema_version":"1.0","source":{"id":"1404.3553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3553","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3553v1","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3553","created_at":"2026-05-18T02:54:14Z"},{"alias_kind":"pith_short_12","alias_value":"TZPH52UE3L4I","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TZPH52UE3L4IYB7J","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TZPH52UE","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:072787bdcd6e8eabe0578615f4515530ed1d4933882c481ab6b7773ad89e9c04","target":"graph","created_at":"2026-05-18T02:54:14Z","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. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-14T12:24:32Z","title":"Maximum order of triangle-free graphs with a given rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3553","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:1d1df00cd8412414d23b56d23c905cc1d1817a60a34754b12be5cb3e3ebeca89","target":"record","created_at":"2026-05-18T02:54:14Z","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":"c0954197ea741fadbb5ee9a4f75c9a98e14e290e94015b8e0214d610722b3afc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-14T12:24:32Z","title_canon_sha256":"63543628ea33ad218a607c6ffff72f1f47931d7c2d7e92c2de0207ef807e4c4d"},"schema_version":"1.0","source":{"id":"1404.3553","kind":"arxiv","version":1}},"canonical_sha256":"9e5e7eea84daf88c07e912b52918a93b85f216b0121dda62e9dfc24483c74520","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e5e7eea84daf88c07e912b52918a93b85f216b0121dda62e9dfc24483c74520","first_computed_at":"2026-05-18T02:54:14.991303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:14.991303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XtYg46X5Xvr9bJT78XKesVxX/H77GmAhikh/StWoV5TEK0nM3y87OnlgPRt9B9KCib6wudP5KpeApmKxKGtrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:14.991765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d1df00cd8412414d23b56d23c905cc1d1817a60a34754b12be5cb3e3ebeca89","sha256:072787bdcd6e8eabe0578615f4515530ed1d4933882c481ab6b7773ad89e9c04"],"state_sha256":"da193be6a1c4e3eacb55093a0593b6ade0e2aa10ef5abe4b7b9f9dfeda440f84"}