{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FRLWVJKW6FJUM7J7WGCR3UBJ5H","short_pith_number":"pith:FRLWVJKW","canonical_record":{"source":{"id":"1605.01198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-04T09:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"4547661c82ab4f0b180da21d738b6a3912c9af81683f6ad3fe1951b5ff57c5e2","abstract_canon_sha256":"e580cda068e685ebf3d385206d6d7b508c8951e9e0903803f4d9528af362700c"},"schema_version":"1.0"},"canonical_sha256":"2c576aa556f153467d3fb1851dd029e9f66adc519921d3f359d4ecf6b7b928b3","source":{"kind":"arxiv","id":"1605.01198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01198","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01198v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01198","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"FRLWVJKW6FJU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRLWVJKW6FJUM7J7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRLWVJKW","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FRLWVJKW6FJUM7J7WGCR3UBJ5H","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-04T09:44:03Z","cross_cats_sorted":[],"title_canon_sha256":"4547661c82ab4f0b180da21d738b6a3912c9af81683f6ad3fe1951b5ff57c5e2","abstract_canon_sha256":"e580cda068e685ebf3d385206d6d7b508c8951e9e0903803f4d9528af362700c"},"schema_version":"1.0"},"canonical_sha256":"2c576aa556f153467d3fb1851dd029e9f66adc519921d3f359d4ecf6b7b928b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:37.541465Z","signature_b64":"8ioKID4IetQpJoZfEuNuHHPc1oACY4kV9loq9KLjtfUPTj43gX89gamzpelEs45kZ2LvmRDpWK9NA991t3WaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c576aa556f153467d3fb1851dd029e9f66adc519921d3f359d4ecf6b7b928b3","last_reissued_at":"2026-05-18T01:15:37.540747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:37.540747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01198","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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXn1EFZGWB3AF4JsfTLJMzgzkeCc0eexdHzkBlqBaa1gVFJHXhi5UoWq+V6Q+283a5VihK/WO3s8U+vIWJXcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:49.890097Z"},"content_sha256":"001e1331d0f633ef59f8bbe53606720ce351c4330b7a2558dc0b94719bd6490b","schema_version":"1.0","event_id":"sha256:001e1331d0f633ef59f8bbe53606720ce351c4330b7a2558dc0b94719bd6490b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FRLWVJKW6FJUM7J7WGCR3UBJ5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ken-ichi Kawarabayashi, Kord Eickmeyer","submitted_at":"2016-05-04T09:44:03Z","abstract_excerpt":"We show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topological subgraph. Furthermore, we show that model-checking for order-invariant first-order logic is tractable on coloured posets of bounded width, parameterised by both the size of the input formula and the width of the poset.\n  Our result for successor-invariant FO extends previous results for this logic on planar graphs (Engelmann et al., LICS 2012) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01198","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-18T01:15:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ne6t0Az0kle3vVQsVRY9BLE4vZvKyl/liZJS24NxORO3SY2obAzd41M9XvJPYnCuvtFzte4ocyLRdxxm9W/OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:35:49.890459Z"},"content_sha256":"8f72023d217be1b35c9b36034f0d78203724ed7e2d5325563b3f45269d74e65b","schema_version":"1.0","event_id":"sha256:8f72023d217be1b35c9b36034f0d78203724ed7e2d5325563b3f45269d74e65b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/bundle.json","state_url":"https://pith.science/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/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-03T06:35:49Z","links":{"resolver":"https://pith.science/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H","bundle":"https://pith.science/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/bundle.json","state":"https://pith.science/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRLWVJKW6FJUM7J7WGCR3UBJ5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FRLWVJKW6FJUM7J7WGCR3UBJ5H","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":"e580cda068e685ebf3d385206d6d7b508c8951e9e0903803f4d9528af362700c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-04T09:44:03Z","title_canon_sha256":"4547661c82ab4f0b180da21d738b6a3912c9af81683f6ad3fe1951b5ff57c5e2"},"schema_version":"1.0","source":{"id":"1605.01198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01198","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01198v1","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01198","created_at":"2026-05-18T01:15:37Z"},{"alias_kind":"pith_short_12","alias_value":"FRLWVJKW6FJU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRLWVJKW6FJUM7J7","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRLWVJKW","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:8f72023d217be1b35c9b36034f0d78203724ed7e2d5325563b3f45269d74e65b","target":"graph","created_at":"2026-05-18T01:15:37Z","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 show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topological subgraph. Furthermore, we show that model-checking for order-invariant first-order logic is tractable on coloured posets of bounded width, parameterised by both the size of the input formula and the width of the poset.\n  Our result for successor-invariant FO extends previous results for this logic on planar graphs (Engelmann et al., LICS 2012) ","authors_text":"Ken-ichi Kawarabayashi, Kord Eickmeyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-04T09:44:03Z","title":"Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01198","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:001e1331d0f633ef59f8bbe53606720ce351c4330b7a2558dc0b94719bd6490b","target":"record","created_at":"2026-05-18T01:15:37Z","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":"e580cda068e685ebf3d385206d6d7b508c8951e9e0903803f4d9528af362700c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-04T09:44:03Z","title_canon_sha256":"4547661c82ab4f0b180da21d738b6a3912c9af81683f6ad3fe1951b5ff57c5e2"},"schema_version":"1.0","source":{"id":"1605.01198","kind":"arxiv","version":1}},"canonical_sha256":"2c576aa556f153467d3fb1851dd029e9f66adc519921d3f359d4ecf6b7b928b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c576aa556f153467d3fb1851dd029e9f66adc519921d3f359d4ecf6b7b928b3","first_computed_at":"2026-05-18T01:15:37.540747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:37.540747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ioKID4IetQpJoZfEuNuHHPc1oACY4kV9loq9KLjtfUPTj43gX89gamzpelEs45kZ2LvmRDpWK9NA991t3WaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:37.541465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:001e1331d0f633ef59f8bbe53606720ce351c4330b7a2558dc0b94719bd6490b","sha256:8f72023d217be1b35c9b36034f0d78203724ed7e2d5325563b3f45269d74e65b"],"state_sha256":"8db818a823c5d50120a21056ee3893d95c15db142ee22c1bf93a35e42dfa018a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"So0n4G7MAUImEKo+cOdeW5mHv0gRjLMfCDOiAGbn8AUetAwLzXkoKz8PNMc2Em/Pb2cle5ppLtHallq/lPErAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:35:49.892429Z","bundle_sha256":"9c4f2b4d28e5f8a7da50639e3e801c397b0ec6d2fbbba25a886f5165e69155b2"}}