{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3HFF2KZ6K3CUW6P52RXHNE6HZ5","short_pith_number":"pith:3HFF2KZ6","schema_version":"1.0","canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","source":{"kind":"arxiv","id":"1003.4865","version":4},"attestation_state":"computed","paper":{"title":"Logical complexity of graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.LO"],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2010-03-25T11:48:59Z","abstract_excerpt":"We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$ up to isomorphism. The logical width $W(G)$ is the minimum number of variables occurring in such a sentence. The logical length $L(G)$ is the length of a shortest defining sentence. We survey known estimates for these graph parameters and discuss their relations to other topics (such as the efficiency of the Weisfeiler-Lehman algorithm in isomorphism testing"},"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":"1003.4865","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-25T11:48:59Z","cross_cats_sorted":["cs.CC","cs.LO","math.LO"],"title_canon_sha256":"4b4e5c5c76718731a3852e9cc7599225b8a0a103b75e09fabba1aa15fe16e47f","abstract_canon_sha256":"3f73f4f5de759e0bb317ed4ed90808453cbd5273f9138fd2da649bfe4518986a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.077902Z","signature_b64":"8RHYccwHBPZjLr75semYrUnzUsq/iG+SXloTrqrPChHBDYDO7KFr7iwgjW/Zz/ei+Ydt8BvxuNCxSNnhhtFFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","last_reissued_at":"2026-05-18T03:27:02.077136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.077136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logical complexity of graphs: a survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.LO"],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Oleg Verbitsky","submitted_at":"2010-03-25T11:48:59Z","abstract_excerpt":"We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth $D(G)$ of a graph $G$ is equal to the minimum quantifier depth of a sentence defining $G$ up to isomorphism. The logical width $W(G)$ is the minimum number of variables occurring in such a sentence. The logical length $L(G)$ is the length of a shortest defining sentence. We survey known estimates for these graph parameters and discuss their relations to other topics (such as the efficiency of the Weisfeiler-Lehman algorithm in isomorphism testing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4865","kind":"arxiv","version":4},"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":"1003.4865","created_at":"2026-05-18T03:27:02.077328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.4865v4","created_at":"2026-05-18T03:27:02.077328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4865","created_at":"2026-05-18T03:27:02.077328+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HFF2KZ6K3CU","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HFF2KZ6K3CUW6P5","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HFF2KZ6","created_at":"2026-05-18T12:26:03.138858+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/3HFF2KZ6K3CUW6P52RXHNE6HZ5","json":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5.json","graph_json":"https://pith.science/api/pith-number/3HFF2KZ6K3CUW6P52RXHNE6HZ5/graph.json","events_json":"https://pith.science/api/pith-number/3HFF2KZ6K3CUW6P52RXHNE6HZ5/events.json","paper":"https://pith.science/paper/3HFF2KZ6"},"agent_actions":{"view_html":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5","download_json":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5.json","view_paper":"https://pith.science/paper/3HFF2KZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.4865&json=true","fetch_graph":"https://pith.science/api/pith-number/3HFF2KZ6K3CUW6P52RXHNE6HZ5/graph.json","fetch_events":"https://pith.science/api/pith-number/3HFF2KZ6K3CUW6P52RXHNE6HZ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/action/storage_attestation","attest_author":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/action/author_attestation","sign_citation":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/action/citation_signature","submit_replication":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/action/replication_record"}},"created_at":"2026-05-18T03:27:02.077328+00:00","updated_at":"2026-05-18T03:27:02.077328+00:00"}