{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q4OC5C2WUOIIC7ISNEOMEFYYRM","short_pith_number":"pith:Q4OC5C2W","canonical_record":{"source":{"id":"1607.08067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T12:53:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cf067181eb2188ee57009edd9cc037104c9d1787fa0d65729f8e147cea3fefcc","abstract_canon_sha256":"fc2576b88f46a01c5bf0436da2af67483278ee01714d14811056bfcb12082a44"},"schema_version":"1.0"},"canonical_sha256":"871c2e8b56a390817d12691cc217188b1cc1a6622ba4a448e7180cbdff0810fe","source":{"kind":"arxiv","id":"1607.08067","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08067","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08067v4","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08067","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q4OC5C2WUOII","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4OC5C2WUOIIC7IS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4OC5C2W","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q4OC5C2WUOIIC7ISNEOMEFYYRM","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08067","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T12:53:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cf067181eb2188ee57009edd9cc037104c9d1787fa0d65729f8e147cea3fefcc","abstract_canon_sha256":"fc2576b88f46a01c5bf0436da2af67483278ee01714d14811056bfcb12082a44"},"schema_version":"1.0"},"canonical_sha256":"871c2e8b56a390817d12691cc217188b1cc1a6622ba4a448e7180cbdff0810fe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:44.152187Z","signature_b64":"EpJWlzQqM7sanl1CLlxmVfK2LS5aXVqpjxMo4jTowdHxsKN6yzJwSpPzhINoWox0MNXkI4TjwegYusxerrIAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"871c2e8b56a390817d12691cc217188b1cc1a6622ba4a448e7180cbdff0810fe","last_reissued_at":"2026-05-18T00:35:44.151439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:44.151439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08067","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-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZXjFQaLo1hQIWV+GPO2D1Sqx2gkuxoK3PlCx7KDVcWrL0Z+QfQhRN7lJYSxSQMV6EhY3gi3Vz2IMcLz8AGy5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:54.660361Z"},"content_sha256":"7b8e60aa695a74e47bcea34e2002321ef8aa764469658b097f63d79d7eeaa5ec","schema_version":"1.0","event_id":"sha256:7b8e60aa695a74e47bcea34e2002321ef8aa764469658b097f63d79d7eeaa5ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q4OC5C2WUOIIC7ISNEOMEFYYRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Descriptive Complexity of Subgraph Isomorphism without Numerics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Maksim Zhukovskii, Oleg Verbitsky","submitted_at":"2016-07-27T12:53:57Z","abstract_excerpt":"Let $F$ be a connected graph with $\\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\\ell$, simply because no first-order formula of smaller quantifier depth can distinguish between the complete graphs $K_\\ell$ and $K_{\\ell-1}$. We show that, for some $F$, the existence of an $F$ subgraph in \\emph{sufficiently large} connected graphs is definable with quantifier depth $\\ell-3$. On the other hand, this is never possible with quantifier depth better than $\\ell/2$. If we, however, consider definitions over conne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08067","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-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQBypujy60OQrZQauLvn4mFLjSzoKdr0waT5+N7pxCFHS6cf2lJ9kWCrsGeMrh4O69C+5EcfkY7sWgsazQVxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:09:54.661055Z"},"content_sha256":"c64068564ad2bf7b24020633964d247187318bb960d4bdbbc29538f7b988b624","schema_version":"1.0","event_id":"sha256:c64068564ad2bf7b24020633964d247187318bb960d4bdbbc29538f7b988b624"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/bundle.json","state_url":"https://pith.science/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/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-25T23:09:54Z","links":{"resolver":"https://pith.science/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM","bundle":"https://pith.science/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/bundle.json","state":"https://pith.science/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4OC5C2WUOIIC7ISNEOMEFYYRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q4OC5C2WUOIIC7ISNEOMEFYYRM","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":"fc2576b88f46a01c5bf0436da2af67483278ee01714d14811056bfcb12082a44","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T12:53:57Z","title_canon_sha256":"cf067181eb2188ee57009edd9cc037104c9d1787fa0d65729f8e147cea3fefcc"},"schema_version":"1.0","source":{"id":"1607.08067","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08067","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08067v4","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08067","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q4OC5C2WUOII","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q4OC5C2WUOIIC7IS","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q4OC5C2W","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:c64068564ad2bf7b24020633964d247187318bb960d4bdbbc29538f7b988b624","target":"graph","created_at":"2026-05-18T00:35:44Z","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":"Let $F$ be a connected graph with $\\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\\ell$, simply because no first-order formula of smaller quantifier depth can distinguish between the complete graphs $K_\\ell$ and $K_{\\ell-1}$. We show that, for some $F$, the existence of an $F$ subgraph in \\emph{sufficiently large} connected graphs is definable with quantifier depth $\\ell-3$. On the other hand, this is never possible with quantifier depth better than $\\ell/2$. If we, however, consider definitions over conne","authors_text":"Maksim Zhukovskii, Oleg Verbitsky","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T12:53:57Z","title":"The Descriptive Complexity of Subgraph Isomorphism without Numerics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08067","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:7b8e60aa695a74e47bcea34e2002321ef8aa764469658b097f63d79d7eeaa5ec","target":"record","created_at":"2026-05-18T00:35:44Z","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":"fc2576b88f46a01c5bf0436da2af67483278ee01714d14811056bfcb12082a44","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-27T12:53:57Z","title_canon_sha256":"cf067181eb2188ee57009edd9cc037104c9d1787fa0d65729f8e147cea3fefcc"},"schema_version":"1.0","source":{"id":"1607.08067","kind":"arxiv","version":4}},"canonical_sha256":"871c2e8b56a390817d12691cc217188b1cc1a6622ba4a448e7180cbdff0810fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"871c2e8b56a390817d12691cc217188b1cc1a6622ba4a448e7180cbdff0810fe","first_computed_at":"2026-05-18T00:35:44.151439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:44.151439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EpJWlzQqM7sanl1CLlxmVfK2LS5aXVqpjxMo4jTowdHxsKN6yzJwSpPzhINoWox0MNXkI4TjwegYusxerrIAAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:44.152187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08067","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b8e60aa695a74e47bcea34e2002321ef8aa764469658b097f63d79d7eeaa5ec","sha256:c64068564ad2bf7b24020633964d247187318bb960d4bdbbc29538f7b988b624"],"state_sha256":"b303bd7f2c71209ef755db2ceef4581a8e0cfdeb680fd5137337aa12f7bbd93b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlNv6JwKDIoFXKYbnABj9gG5G47dFAOVq9Tu7fEic2tQibK1HkWrI6wH7HrjqRJcRKoTa+j7LyXbJwr3vN/iCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:09:54.664797Z","bundle_sha256":"11f9df6156a8e8493dcfcc15d3cf39bf48d46d72fc5a62a32f4119af162b8e55"}}