{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TZPH52UE3L4IYB7JCK2SSGFJHO","short_pith_number":"pith:TZPH52UE","schema_version":"1.0","canonical_sha256":"9e5e7eea84daf88c07e912b52918a93b85f216b0121dda62e9dfc24483c74520","source":{"kind":"arxiv","id":"1404.3553","version":1},"attestation_state":"computed","paper":{"title":"Maximum order of triangle-free graphs with a given rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","submitted_at":"2014-04-14T12:24:32Z","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."},"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":"1404.3553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-14T12:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"63543628ea33ad218a607c6ffff72f1f47931d7c2d7e92c2de0207ef807e4c4d","abstract_canon_sha256":"c0954197ea741fadbb5ee9a4f75c9a98e14e290e94015b8e0214d610722b3afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:14.991765Z","signature_b64":"XtYg46X5Xvr9bJT78XKesVxX/H77GmAhikh/StWoV5TEK0nM3y87OnlgPRt9B9KCib6wudP5KpeApmKxKGtrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e5e7eea84daf88c07e912b52918a93b85f216b0121dda62e9dfc24483c74520","last_reissued_at":"2026-05-18T02:54:14.991303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:14.991303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum order of triangle-free graphs with a given rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, E. Ghorbani","submitted_at":"2014-04-14T12:24:32Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3553","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":"1404.3553","created_at":"2026-05-18T02:54:14.991391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3553v1","created_at":"2026-05-18T02:54:14.991391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3553","created_at":"2026-05-18T02:54:14.991391+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZPH52UE3L4I","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZPH52UE3L4IYB7J","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZPH52UE","created_at":"2026-05-18T12:28:52.271510+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/TZPH52UE3L4IYB7JCK2SSGFJHO","json":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO.json","graph_json":"https://pith.science/api/pith-number/TZPH52UE3L4IYB7JCK2SSGFJHO/graph.json","events_json":"https://pith.science/api/pith-number/TZPH52UE3L4IYB7JCK2SSGFJHO/events.json","paper":"https://pith.science/paper/TZPH52UE"},"agent_actions":{"view_html":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO","download_json":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO.json","view_paper":"https://pith.science/paper/TZPH52UE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3553&json=true","fetch_graph":"https://pith.science/api/pith-number/TZPH52UE3L4IYB7JCK2SSGFJHO/graph.json","fetch_events":"https://pith.science/api/pith-number/TZPH52UE3L4IYB7JCK2SSGFJHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO/action/storage_attestation","attest_author":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO/action/author_attestation","sign_citation":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO/action/citation_signature","submit_replication":"https://pith.science/pith/TZPH52UE3L4IYB7JCK2SSGFJHO/action/replication_record"}},"created_at":"2026-05-18T02:54:14.991391+00:00","updated_at":"2026-05-18T02:54:14.991391+00:00"}