{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3HFF2KZ6K3CUW6P52RXHNE6HZ5","short_pith_number":"pith:3HFF2KZ6","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"},"canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","source":{"kind":"arxiv","id":"1003.4865","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4865","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4865v4","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4865","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"3HFF2KZ6K3CU","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3HFF2KZ6K3CUW6P5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3HFF2KZ6","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3HFF2KZ6K3CUW6P52RXHNE6HZ5","target":"record","payload":{"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"},"canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","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"},"source_kind":"arxiv","source_id":"1003.4865","source_version":4,"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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LwGkkpY0f1SZNWuHd2VJGdodVeoIDVUe2xQQlM1crn3++nt8E4CVfGLygChaQRDA7KsgkWQ+UPdbZLKOvpxHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:59:21.106293Z"},"content_sha256":"47dd5e9ad6bb4d1944bd604bb8fa54c0d54686e1c1f49447d70c00c1b364873c","schema_version":"1.0","event_id":"sha256:47dd5e9ad6bb4d1944bd604bb8fa54c0d54686e1c1f49447d70c00c1b364873c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3HFF2KZ6K3CUW6P52RXHNE6HZ5","target":"graph","payload":{"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"},"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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWcsHtp7qeLIOOIpmIRUQLEqLyZon809/DB/OGvx4NETTHmoemRByyQcB8CiDFpclkGwdW/9DVGobMceHWlUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:59:21.106956Z"},"content_sha256":"0bebd4d559042873f2cc340ecd2b351c2f4b3197bcc48c270ca792d462f3a696","schema_version":"1.0","event_id":"sha256:0bebd4d559042873f2cc340ecd2b351c2f4b3197bcc48c270ca792d462f3a696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/bundle.json","state_url":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/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-27T05:59:21Z","links":{"resolver":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5","bundle":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/bundle.json","state":"https://pith.science/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HFF2KZ6K3CUW6P52RXHNE6HZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3HFF2KZ6K3CUW6P52RXHNE6HZ5","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":"3f73f4f5de759e0bb317ed4ed90808453cbd5273f9138fd2da649bfe4518986a","cross_cats_sorted":["cs.CC","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-25T11:48:59Z","title_canon_sha256":"4b4e5c5c76718731a3852e9cc7599225b8a0a103b75e09fabba1aa15fe16e47f"},"schema_version":"1.0","source":{"id":"1003.4865","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.4865","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1003.4865v4","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.4865","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"3HFF2KZ6K3CU","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3HFF2KZ6K3CUW6P5","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3HFF2KZ6","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:0bebd4d559042873f2cc340ecd2b351c2f4b3197bcc48c270ca792d462f3a696","target":"graph","created_at":"2026-05-18T03:27:02Z","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 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","authors_text":"Oleg Pikhurko, Oleg Verbitsky","cross_cats":["cs.CC","cs.LO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-25T11:48:59Z","title":"Logical complexity of graphs: a survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.4865","kind":"arxiv","version":4},"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:47dd5e9ad6bb4d1944bd604bb8fa54c0d54686e1c1f49447d70c00c1b364873c","target":"record","created_at":"2026-05-18T03:27:02Z","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":"3f73f4f5de759e0bb317ed4ed90808453cbd5273f9138fd2da649bfe4518986a","cross_cats_sorted":["cs.CC","cs.LO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-03-25T11:48:59Z","title_canon_sha256":"4b4e5c5c76718731a3852e9cc7599225b8a0a103b75e09fabba1aa15fe16e47f"},"schema_version":"1.0","source":{"id":"1003.4865","kind":"arxiv","version":4}},"canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9ca5d2b3e56c54b79fdd46e7693c7cf498b47dc8c7b9595bb2ce03e94cb0196","first_computed_at":"2026-05-18T03:27:02.077136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.077136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8RHYccwHBPZjLr75semYrUnzUsq/iG+SXloTrqrPChHBDYDO7KFr7iwgjW/Zz/ei+Ydt8BvxuNCxSNnhhtFFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.077902Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.4865","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47dd5e9ad6bb4d1944bd604bb8fa54c0d54686e1c1f49447d70c00c1b364873c","sha256:0bebd4d559042873f2cc340ecd2b351c2f4b3197bcc48c270ca792d462f3a696"],"state_sha256":"a619d95d06daffe7a622a5f04fbcb7eacd78f69d4f0aaadf236b6a70eaa7c2b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0yHqX9H2USGCfqSOuxYw3+B2DSqr832AT5Z85rtUCRYjz7sb78nK4CXZNgd6ETMoaD3r6wNtIyNWCypK7+7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:59:21.109694Z","bundle_sha256":"ec7f8252e75180f512231c4db3bd86f30f7d63205cf704908676943a666438f2"}}