{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:RTLOLY66L2PUYYZI7K4JKN6XJ3","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":"fbac4e97aa0ef6b3170fe9aca193bce6ad4001df4c641a39d10f9f3d17f1197b","cross_cats_sorted":["math.LO"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T19:07:42Z","title_canon_sha256":"01e1f6dba11d08b9ce991bee0e540c7a93db32553e644dd1e46f4a107b1ae730"},"schema_version":"1.0","source":{"id":"math/0311041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0311041","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"math/0311041v1","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0311041","created_at":"2026-05-18T01:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"RTLOLY66L2PU","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"RTLOLY66L2PUYYZI","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"RTLOLY66","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:999cfe6b5bbdf2ced878d49b50d51d12a1e8be63ce1752a5089944b0a429036b","target":"graph","created_at":"2026-05-18T01:05:28Z","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":"We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula.\n We prove that, if G and G' have the same order n, then D(G,G')\\le(n+3)/2, which is tight up to an additive constant of 1. The analogous questions are considered for directed graphs (more generally, for arbitrary structures with maximum relation arity 2) and for k-uniform hypergraphs.\n Also, we study defining formulas, where we require that A distinguishes G from any other non","authors_text":"Helmut Veith, Oleg Pikhurko, Oleg Verbitsky","cross_cats":["math.LO"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T19:07:42Z","title":"The First Order Definability of Graphs: Upper Bounds for Quantifier Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311041","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:4b3decac65ddd174cb7930ae27eab5b3a22f05eedd3c0557beedd4e4d3e55f4a","target":"record","created_at":"2026-05-18T01:05:28Z","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":"fbac4e97aa0ef6b3170fe9aca193bce6ad4001df4c641a39d10f9f3d17f1197b","cross_cats_sorted":["math.LO"],"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T19:07:42Z","title_canon_sha256":"01e1f6dba11d08b9ce991bee0e540c7a93db32553e644dd1e46f4a107b1ae730"},"schema_version":"1.0","source":{"id":"math/0311041","kind":"arxiv","version":1}},"canonical_sha256":"8cd6e5e3de5e9f4c6328fab89537d74ecd61fb73211ffc506356c3d73de99f8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cd6e5e3de5e9f4c6328fab89537d74ecd61fb73211ffc506356c3d73de99f8b","first_computed_at":"2026-05-18T01:05:28.541739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:28.541739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iGJBcOVloOaMJBFs2raFO9r3X+D1in2QsXPTOv1M4Aeo6fdcfkmj9jNEmBtJ/bewxwIiBN8ouMYl9CLJ48koDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:28.542287Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0311041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b3decac65ddd174cb7930ae27eab5b3a22f05eedd3c0557beedd4e4d3e55f4a","sha256:999cfe6b5bbdf2ced878d49b50d51d12a1e8be63ce1752a5089944b0a429036b"],"state_sha256":"78d7e7143f229b761cf094603dec119aca82ad656e9231048c14c3fbe99f51d4"}