{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TRWQVVHBYTUNQU2M34ZSGAO7B5","short_pith_number":"pith:TRWQVVHB","canonical_record":{"source":{"id":"1805.01823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T15:29:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"318e4a7dc1399bba2a936e9f23f9eae74c7d1d1dbf0ab7776d65287bd7eb5dde","abstract_canon_sha256":"c42502176ab4e7c44f5c53f4a412bb957ac903150fb3507b4ae715775aca82f9"},"schema_version":"1.0"},"canonical_sha256":"9c6d0ad4e1c4e8d8534cdf332301df0f739410e84349ab4c5164c50aa450ede8","source":{"kind":"arxiv","id":"1805.01823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01823","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01823v1","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01823","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"TRWQVVHBYTUN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TRWQVVHBYTUNQU2M","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TRWQVVHB","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TRWQVVHBYTUNQU2M34ZSGAO7B5","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T15:29:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"318e4a7dc1399bba2a936e9f23f9eae74c7d1d1dbf0ab7776d65287bd7eb5dde","abstract_canon_sha256":"c42502176ab4e7c44f5c53f4a412bb957ac903150fb3507b4ae715775aca82f9"},"schema_version":"1.0"},"canonical_sha256":"9c6d0ad4e1c4e8d8534cdf332301df0f739410e84349ab4c5164c50aa450ede8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:46.579349Z","signature_b64":"Rj92AuQ1T0u4s14+xWgLpe2ho1OK9Dx8NqlsEjpV6yQp9GYuPmqYkK6xpv0G4Apnp/jcgUFYoSQhMB5INMo5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c6d0ad4e1c4e8d8534cdf332301df0f739410e84349ab4c5164c50aa450ede8","last_reissued_at":"2026-05-18T00:16:46.578905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:46.578905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01823","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-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpABRB1Q+EmGvZwKtfwVLH8+4MMV/iliK06eXCiFq/bD++DX60i0UYAGKj7cuyRy0lcc7WKr3TWECbouSlLaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:26:55.483588Z"},"content_sha256":"fd252df52893e7a14e4bfc2fec989ce64e77661fd8b3ec06e9d0d86b6af98fc8","schema_version":"1.0","event_id":"sha256:fd252df52893e7a14e4bfc2fec989ce64e77661fd8b3ec06e9d0d86b6af98fc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TRWQVVHBYTUNQU2M34ZSGAO7B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Perspective on FO Model Checking of Dense Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.LO","authors_text":"Daniel Lokshtanov, Jakub Gajarsk\\'y, Jan Obdr\\v{z}\\'alek, M.S. Ramanujan, Petr Hlin\\v{e}n\\'y","submitted_at":"2018-05-04T15:29:16Z","abstract_excerpt":"We study the first-order (FO) model checking problem of dense graphs, namely those which have FO interpretations in (or are FO transductions of) some sparse graph classes. We give a structural characterization of the graph classes which are FO interpretable in graphs of bounded degree. This characterization allows us to efficiently compute such an FO interpretation for an input graph. As a consequence, we obtain an FPT algorithm for successor-invariant FO model checking of any graph class which is FO interpretable in (or an FO transduction of) a graph class of bounded degree. The approach we u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01823","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-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uA5mewr1qDGcZalR2LxU5NV3SL0Cif6YG+HlUvGSgWj5rcdvJyKPQSRnDOwYmcepf5q54ipdf+KpSCpAbm07AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:26:55.483921Z"},"content_sha256":"40a458d3624d98af7ee1cf12f09cdaf23ced64497a93bca8a425b919920c7256","schema_version":"1.0","event_id":"sha256:40a458d3624d98af7ee1cf12f09cdaf23ced64497a93bca8a425b919920c7256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/bundle.json","state_url":"https://pith.science/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/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-06-02T12:26:55Z","links":{"resolver":"https://pith.science/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5","bundle":"https://pith.science/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/bundle.json","state":"https://pith.science/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TRWQVVHBYTUNQU2M34ZSGAO7B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TRWQVVHBYTUNQU2M34ZSGAO7B5","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":"c42502176ab4e7c44f5c53f4a412bb957ac903150fb3507b4ae715775aca82f9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T15:29:16Z","title_canon_sha256":"318e4a7dc1399bba2a936e9f23f9eae74c7d1d1dbf0ab7776d65287bd7eb5dde"},"schema_version":"1.0","source":{"id":"1805.01823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01823","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01823v1","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01823","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"TRWQVVHBYTUN","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TRWQVVHBYTUNQU2M","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TRWQVVHB","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:40a458d3624d98af7ee1cf12f09cdaf23ced64497a93bca8a425b919920c7256","target":"graph","created_at":"2026-05-18T00:16:46Z","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 study the first-order (FO) model checking problem of dense graphs, namely those which have FO interpretations in (or are FO transductions of) some sparse graph classes. We give a structural characterization of the graph classes which are FO interpretable in graphs of bounded degree. This characterization allows us to efficiently compute such an FO interpretation for an input graph. As a consequence, we obtain an FPT algorithm for successor-invariant FO model checking of any graph class which is FO interpretable in (or an FO transduction of) a graph class of bounded degree. The approach we u","authors_text":"Daniel Lokshtanov, Jakub Gajarsk\\'y, Jan Obdr\\v{z}\\'alek, M.S. Ramanujan, Petr Hlin\\v{e}n\\'y","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T15:29:16Z","title":"A New Perspective on FO Model Checking of Dense Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01823","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:fd252df52893e7a14e4bfc2fec989ce64e77661fd8b3ec06e9d0d86b6af98fc8","target":"record","created_at":"2026-05-18T00:16:46Z","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":"c42502176ab4e7c44f5c53f4a412bb957ac903150fb3507b4ae715775aca82f9","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-05-04T15:29:16Z","title_canon_sha256":"318e4a7dc1399bba2a936e9f23f9eae74c7d1d1dbf0ab7776d65287bd7eb5dde"},"schema_version":"1.0","source":{"id":"1805.01823","kind":"arxiv","version":1}},"canonical_sha256":"9c6d0ad4e1c4e8d8534cdf332301df0f739410e84349ab4c5164c50aa450ede8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c6d0ad4e1c4e8d8534cdf332301df0f739410e84349ab4c5164c50aa450ede8","first_computed_at":"2026-05-18T00:16:46.578905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:46.578905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rj92AuQ1T0u4s14+xWgLpe2ho1OK9Dx8NqlsEjpV6yQp9GYuPmqYkK6xpv0G4Apnp/jcgUFYoSQhMB5INMo5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:46.579349Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd252df52893e7a14e4bfc2fec989ce64e77661fd8b3ec06e9d0d86b6af98fc8","sha256:40a458d3624d98af7ee1cf12f09cdaf23ced64497a93bca8a425b919920c7256"],"state_sha256":"6547c53365eeaab0ae1943d38e96a73920c1e8dcebe65f2051e0a031182d2738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BalFR+sQlKrGpKecg3mrDEnFOlDxFc12gFxkA/FCS4fcujzJ7k81cyGxudC4NEUAMlgC4V6tOL2Cadjw0GbgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:26:55.485869Z","bundle_sha256":"c16180744931a360c96ee136cc56aa78c08880ec5a2fc7724a7b223d9c3a1462"}}