{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AM6QWPS65YW4A5OOU7PRKIHVRA","short_pith_number":"pith:AM6QWPS6","canonical_record":{"source":{"id":"1805.03488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T12:49:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"656faba881da7f559b3604c8558129569c4e2bc656d714d15a673bb72a2a6cc8","abstract_canon_sha256":"2485695f622f812821f062d096245061e8812d20a7a30397341988070bee8e00"},"schema_version":"1.0"},"canonical_sha256":"033d0b3e5eee2dc075cea7df1520f5881d7ed44871ec4964e58b46830d01f96a","source":{"kind":"arxiv","id":"1805.03488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03488","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03488v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03488","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"AM6QWPS65YW4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AM6QWPS65YW4A5OO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AM6QWPS6","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AM6QWPS65YW4A5OOU7PRKIHVRA","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T12:49:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"656faba881da7f559b3604c8558129569c4e2bc656d714d15a673bb72a2a6cc8","abstract_canon_sha256":"2485695f622f812821f062d096245061e8812d20a7a30397341988070bee8e00"},"schema_version":"1.0"},"canonical_sha256":"033d0b3e5eee2dc075cea7df1520f5881d7ed44871ec4964e58b46830d01f96a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.095976Z","signature_b64":"VbWJ5I8guQxRed9behO8cyFkefPvyyys4Nt5nHm7+1dApBr4PDJqxMxjhqazXwSEuAo9fVFqevWYCPSkjfgsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"033d0b3e5eee2dc075cea7df1520f5881d7ed44871ec4964e58b46830d01f96a","last_reissued_at":"2026-05-18T00:16:20.095507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.095507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03488","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0b5Smst7bZWrbQgNMGslDL3sAR29+qXABtKRqRjC9A10VaKCKNu4GtOx11fqqIYG3GWZ5cYEuvjWBlGFiOzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:43:59.073272Z"},"content_sha256":"0ee58469b4317461ef49b56019e260cfea65688a2f374524d5b9145430bb290b","schema_version":"1.0","event_id":"sha256:0ee58469b4317461ef49b56019e260cfea65688a2f374524d5b9145430bb290b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AM6QWPS65YW4A5OOU7PRKIHVRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized circuit complexity of model checking first-order logic on sparse structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","submitted_at":"2018-05-09T12:49:23Z","abstract_excerpt":"We prove that for every class $C$ of graphs with effectively bounded expansion, given a first-order sentence $\\varphi$ and an $n$-element structure $\\mathbb{A}$ whose Gaifman graph belongs to $C$, the question whether $\\varphi$ holds in $\\mathbb{A}$ can be decided by a family of AC-circuits of size $f(\\varphi)\\cdot n^c$ and depth $f(\\varphi)+c\\log n$, where $f$ is a computable function and $c$ is a universal constant. This places the model-checking problem for classes of bounded expansion in the parameterized circuit complexity class $para-AC^1$. On the route to our result we prove that the ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03488","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDKBJWkDxk9RA9fD8F9fGQJzOigm0+ViU8id0bjJJmCnzAGofDvF2Ny0uS7zWjX0ixcvZq2fAIMoJ3/9NpX1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:43:59.073698Z"},"content_sha256":"8524bf00bfe5454b4d566e3c67b06858ec159970622e58fc90740b844e0027b0","schema_version":"1.0","event_id":"sha256:8524bf00bfe5454b4d566e3c67b06858ec159970622e58fc90740b844e0027b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/bundle.json","state_url":"https://pith.science/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/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-27T04:43:59Z","links":{"resolver":"https://pith.science/pith/AM6QWPS65YW4A5OOU7PRKIHVRA","bundle":"https://pith.science/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/bundle.json","state":"https://pith.science/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AM6QWPS65YW4A5OOU7PRKIHVRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AM6QWPS65YW4A5OOU7PRKIHVRA","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":"2485695f622f812821f062d096245061e8812d20a7a30397341988070bee8e00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T12:49:23Z","title_canon_sha256":"656faba881da7f559b3604c8558129569c4e2bc656d714d15a673bb72a2a6cc8"},"schema_version":"1.0","source":{"id":"1805.03488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03488","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03488v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03488","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"AM6QWPS65YW4","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AM6QWPS65YW4A5OO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AM6QWPS6","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:8524bf00bfe5454b4d566e3c67b06858ec159970622e58fc90740b844e0027b0","target":"graph","created_at":"2026-05-18T00:16:20Z","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 prove that for every class $C$ of graphs with effectively bounded expansion, given a first-order sentence $\\varphi$ and an $n$-element structure $\\mathbb{A}$ whose Gaifman graph belongs to $C$, the question whether $\\varphi$ holds in $\\mathbb{A}$ can be decided by a family of AC-circuits of size $f(\\varphi)\\cdot n^c$ and depth $f(\\varphi)+c\\log n$, where $f$ is a computable function and $c$ is a universal constant. This places the model-checking problem for classes of bounded expansion in the parameterized circuit complexity class $para-AC^1$. On the route to our result we prove that the ba","authors_text":"Micha{\\l} Pilipczuk, Sebastian Siebertz, Szymon Toru\\'nczyk","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T12:49:23Z","title":"Parameterized circuit complexity of model checking first-order logic on sparse structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03488","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:0ee58469b4317461ef49b56019e260cfea65688a2f374524d5b9145430bb290b","target":"record","created_at":"2026-05-18T00:16:20Z","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":"2485695f622f812821f062d096245061e8812d20a7a30397341988070bee8e00","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-09T12:49:23Z","title_canon_sha256":"656faba881da7f559b3604c8558129569c4e2bc656d714d15a673bb72a2a6cc8"},"schema_version":"1.0","source":{"id":"1805.03488","kind":"arxiv","version":1}},"canonical_sha256":"033d0b3e5eee2dc075cea7df1520f5881d7ed44871ec4964e58b46830d01f96a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"033d0b3e5eee2dc075cea7df1520f5881d7ed44871ec4964e58b46830d01f96a","first_computed_at":"2026-05-18T00:16:20.095507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:20.095507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VbWJ5I8guQxRed9behO8cyFkefPvyyys4Nt5nHm7+1dApBr4PDJqxMxjhqazXwSEuAo9fVFqevWYCPSkjfgsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:20.095976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee58469b4317461ef49b56019e260cfea65688a2f374524d5b9145430bb290b","sha256:8524bf00bfe5454b4d566e3c67b06858ec159970622e58fc90740b844e0027b0"],"state_sha256":"6c43f5a02949196f7aed165f9bf42ab1f2df5480be623a5857c9ec0ad323e8d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3CzE9Ju184NWgt9RbcwCyzWFulbhM1ZkwfNt5bt0pgWyt9bNfZjG7ijqMQ/z+ISN0IhCJAlyZhcIH74qlYcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:43:59.076021Z","bundle_sha256":"b07ebba2f24498e160f39722d95a08d3286f4294eb3b97db25b7ab8ae9597554"}}