{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:RTLOLY66L2PUYYZI7K4JKN6XJ3","short_pith_number":"pith:RTLOLY66","canonical_record":{"source":{"id":"math/0311041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T19:07:42Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"01e1f6dba11d08b9ce991bee0e540c7a93db32553e644dd1e46f4a107b1ae730","abstract_canon_sha256":"fbac4e97aa0ef6b3170fe9aca193bce6ad4001df4c641a39d10f9f3d17f1197b"},"schema_version":"1.0"},"canonical_sha256":"8cd6e5e3de5e9f4c6328fab89537d74ecd61fb73211ffc506356c3d73de99f8b","source":{"kind":"arxiv","id":"math/0311041","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:RTLOLY66L2PUYYZI7K4JKN6XJ3","target":"record","payload":{"canonical_record":{"source":{"id":"math/0311041","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2003-11-04T19:07:42Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"01e1f6dba11d08b9ce991bee0e540c7a93db32553e644dd1e46f4a107b1ae730","abstract_canon_sha256":"fbac4e97aa0ef6b3170fe9aca193bce6ad4001df4c641a39d10f9f3d17f1197b"},"schema_version":"1.0"},"canonical_sha256":"8cd6e5e3de5e9f4c6328fab89537d74ecd61fb73211ffc506356c3d73de99f8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:28.542287Z","signature_b64":"iGJBcOVloOaMJBFs2raFO9r3X+D1in2QsXPTOv1M4Aeo6fdcfkmj9jNEmBtJ/bewxwIiBN8ouMYl9CLJ48koDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd6e5e3de5e9f4c6328fab89537d74ecd61fb73211ffc506356c3d73de99f8b","last_reissued_at":"2026-05-18T01:05:28.541739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:28.541739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0311041","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUSUtHTqfyjnASB+0AlY7T+nEahXB31BYfDLFJhrtHa8dbKL7DBKxc3BxMKegbj1+ZJPt5KbjDzScSzi7aENCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:05.877681Z"},"content_sha256":"4b3decac65ddd174cb7930ae27eab5b3a22f05eedd3c0557beedd4e4d3e55f4a","schema_version":"1.0","event_id":"sha256:4b3decac65ddd174cb7930ae27eab5b3a22f05eedd3c0557beedd4e4d3e55f4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:RTLOLY66L2PUYYZI7K4JKN6XJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The First Order Definability of Graphs: Upper Bounds for Quantifier Rank","license":"","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Helmut Veith, Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2003-11-04T19:07:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0311041","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:05:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66eBT8f+OFZac5toO3QHeYMCBpQdpFM60CVxD+4SmBgY3yJ5gAe/zvf7ZvdhRnASxAVTloIwmtxJO84nisSXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:05.878335Z"},"content_sha256":"999cfe6b5bbdf2ced878d49b50d51d12a1e8be63ce1752a5089944b0a429036b","schema_version":"1.0","event_id":"sha256:999cfe6b5bbdf2ced878d49b50d51d12a1e8be63ce1752a5089944b0a429036b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/bundle.json","state_url":"https://pith.science/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T12:15:05Z","links":{"resolver":"https://pith.science/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3","bundle":"https://pith.science/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/bundle.json","state":"https://pith.science/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTLOLY66L2PUYYZI7K4JKN6XJ3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jp7R4xMASFECC7piCDtAkVTUXyU2N9AapLcmLKuxL0Ld5+QdHyGDb/z0TBln2fjsmJOG27At8Rvsccza2EykDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:05.881388Z","bundle_sha256":"70fd3b19bea8dff3419498def88e48fc5634eed050588aecec824ec5e096b43c"}}