{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GN7WR4UI3YXFQOLR4A3IHQSSAZ","short_pith_number":"pith:GN7WR4UI","canonical_record":{"source":{"id":"1810.02389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-04T18:40:46Z","cross_cats_sorted":["cs.LO","math.CO","math.LO"],"title_canon_sha256":"8ae7505b3138d93508cf20770981cd9a0c5df2ba46bbe26df6abb70f39b99dfc","abstract_canon_sha256":"67c0129287b48eb6bf4e652f10ef8c57cc515d5f24e37d14550223841298a064"},"schema_version":"1.0"},"canonical_sha256":"337f68f288de2e583971e03683c252064d3e4f7b5d8245d8638b4dd6d44e827a","source":{"kind":"arxiv","id":"1810.02389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02389","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02389v1","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02389","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"GN7WR4UI3YXF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN7WR4UI3YXFQOLR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN7WR4UI","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GN7WR4UI3YXFQOLR4A3IHQSSAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-04T18:40:46Z","cross_cats_sorted":["cs.LO","math.CO","math.LO"],"title_canon_sha256":"8ae7505b3138d93508cf20770981cd9a0c5df2ba46bbe26df6abb70f39b99dfc","abstract_canon_sha256":"67c0129287b48eb6bf4e652f10ef8c57cc515d5f24e37d14550223841298a064"},"schema_version":"1.0"},"canonical_sha256":"337f68f288de2e583971e03683c252064d3e4f7b5d8245d8638b4dd6d44e827a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:02.028448Z","signature_b64":"6s5h8Dqr6E9hkzX/ukt4bREEK/1+zOc5IM+49Qh2gGCltSAtjJbrbmRrt0cX5Vu9lXVO5mS/f7CADTwqkReyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337f68f288de2e583971e03683c252064d3e4f7b5d8245d8638b4dd6d44e827a","last_reissued_at":"2026-05-18T00:04:02.027835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:02.027835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02389","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:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3knPo9yyN4yQxBtlTX1lDR0ljwI2YYHoDexUNWDWAkZrSrN4TeCL3scOhOlXnJKgS/N1kA8CB4V1vZI3fQBUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:24:50.745985Z"},"content_sha256":"fa004242fc7a523e9bd3a6c9968890bf9397eaea4a84e1fefa8fd399a4b1b5a4","schema_version":"1.0","event_id":"sha256:fa004242fc7a523e9bd3a6c9968890bf9397eaea4a84e1fefa8fd399a4b1b5a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GN7WR4UI3YXFQOLR4A3IHQSSAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-order interpretations of bounded expansion classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CO","math.LO"],"primary_cat":"cs.DM","authors_text":"Jakub Gajarsk\\'y, Jaroslav Ne\\v{s}et\\v{r}il, Micha{\\l} Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz, Stephan Kreutzer, Szymon Toru\\'nczyk","submitted_at":"2018-10-04T18:40:46Z","abstract_excerpt":"The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over such graph classes. With the aim of generalizing such results to dense graphs, we introduce classes of graphs with structurally bounded expansion, defined as first-order interpretations of classes of bounded expansion. As a first step towards their algorithmic treatment, we provide their characterization analogous to the characterization of classes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02389","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:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+WGlvxmmAYrdBYaEoqDIbDbg0u2Tmjb2aDUsiSHhvt3PMrVW5xgScMM8+KmE7kIzGBgexiFZvegaIJYinR0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:24:50.746685Z"},"content_sha256":"8ef72289855791a858e987b75809637ddb7a3697af41467f36a5ae94efc01601","schema_version":"1.0","event_id":"sha256:8ef72289855791a858e987b75809637ddb7a3697af41467f36a5ae94efc01601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/bundle.json","state_url":"https://pith.science/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/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-27T09:24:50Z","links":{"resolver":"https://pith.science/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ","bundle":"https://pith.science/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/bundle.json","state":"https://pith.science/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GN7WR4UI3YXFQOLR4A3IHQSSAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GN7WR4UI3YXFQOLR4A3IHQSSAZ","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":"67c0129287b48eb6bf4e652f10ef8c57cc515d5f24e37d14550223841298a064","cross_cats_sorted":["cs.LO","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-04T18:40:46Z","title_canon_sha256":"8ae7505b3138d93508cf20770981cd9a0c5df2ba46bbe26df6abb70f39b99dfc"},"schema_version":"1.0","source":{"id":"1810.02389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02389","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02389v1","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02389","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"GN7WR4UI3YXF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GN7WR4UI3YXFQOLR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GN7WR4UI","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:8ef72289855791a858e987b75809637ddb7a3697af41467f36a5ae94efc01601","target":"graph","created_at":"2026-05-18T00:04: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":"The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter tractable over such graph classes. With the aim of generalizing such results to dense graphs, we introduce classes of graphs with structurally bounded expansion, defined as first-order interpretations of classes of bounded expansion. As a first step towards their algorithmic treatment, we provide their characterization analogous to the characterization of classes","authors_text":"Jakub Gajarsk\\'y, Jaroslav Ne\\v{s}et\\v{r}il, Micha{\\l} Pilipczuk, Patrice Ossona de Mendez, Sebastian Siebertz, Stephan Kreutzer, Szymon Toru\\'nczyk","cross_cats":["cs.LO","math.CO","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-04T18:40:46Z","title":"First-order interpretations of bounded expansion classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02389","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:fa004242fc7a523e9bd3a6c9968890bf9397eaea4a84e1fefa8fd399a4b1b5a4","target":"record","created_at":"2026-05-18T00:04: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":"67c0129287b48eb6bf4e652f10ef8c57cc515d5f24e37d14550223841298a064","cross_cats_sorted":["cs.LO","math.CO","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-10-04T18:40:46Z","title_canon_sha256":"8ae7505b3138d93508cf20770981cd9a0c5df2ba46bbe26df6abb70f39b99dfc"},"schema_version":"1.0","source":{"id":"1810.02389","kind":"arxiv","version":1}},"canonical_sha256":"337f68f288de2e583971e03683c252064d3e4f7b5d8245d8638b4dd6d44e827a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"337f68f288de2e583971e03683c252064d3e4f7b5d8245d8638b4dd6d44e827a","first_computed_at":"2026-05-18T00:04:02.027835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:02.027835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6s5h8Dqr6E9hkzX/ukt4bREEK/1+zOc5IM+49Qh2gGCltSAtjJbrbmRrt0cX5Vu9lXVO5mS/f7CADTwqkReyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:02.028448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa004242fc7a523e9bd3a6c9968890bf9397eaea4a84e1fefa8fd399a4b1b5a4","sha256:8ef72289855791a858e987b75809637ddb7a3697af41467f36a5ae94efc01601"],"state_sha256":"1ce36f54909ed8440d4d2642b38697421ab7252905e663b596a88a3878c7d975"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmWFWKMXD1r9AvjuOcwnXS7AzF+4Vr+cQ6MAyGOrsrzZqEemmhvJMWmkwM8s9mipqE0xt818GGZQn2lyGvUSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:24:50.750931Z","bundle_sha256":"e43a951758eb3155912dd081ebb291582036f5c9ca66a877cae6ffef5e2795a2"}}