{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZTUNGS6SO3O6DP76PGNPV253ML","short_pith_number":"pith:ZTUNGS6S","canonical_record":{"source":{"id":"1306.5571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-24T10:53:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"2bf5e108d56f0c7ccbbdc243783343d5f49770d74bc2dd1a96041e4dffaf8dc7","abstract_canon_sha256":"2df17e3f4b0d8b93b5a765714582bd61c7befb96115a606556af6ca5008b0ce7"},"schema_version":"1.0"},"canonical_sha256":"cce8d34bd276dde1bffe799afaebbb62dfa0afb7145794e560e84233ce610566","source":{"kind":"arxiv","id":"1306.5571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5571","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5571v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5571","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZTUNGS6SO3O6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTUNGS6SO3O6DP76","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTUNGS6S","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZTUNGS6SO3O6DP76PGNPV253ML","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-24T10:53:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"2bf5e108d56f0c7ccbbdc243783343d5f49770d74bc2dd1a96041e4dffaf8dc7","abstract_canon_sha256":"2df17e3f4b0d8b93b5a765714582bd61c7befb96115a606556af6ca5008b0ce7"},"schema_version":"1.0"},"canonical_sha256":"cce8d34bd276dde1bffe799afaebbb62dfa0afb7145794e560e84233ce610566","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:07.540939Z","signature_b64":"cKLdBctYSdhZdjyvTLg7okTkA3SnThAanDkxqScF08ndZ8GKGK0fqEHAUdY06ndqMd6ksE5CJxffyV2ScEsVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cce8d34bd276dde1bffe799afaebbb62dfa0afb7145794e560e84233ce610566","last_reissued_at":"2026-05-18T03:20:07.540141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:07.540141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5571","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-18T03:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oYLQTjIHjDc4Nyh8BT6qknZ+BgUXlov6r7uoHLuvTw5oOhXCS+V/UbsiHFpgvVndznO5BRfKuH87vej9Ucs5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:56:47.067234Z"},"content_sha256":"b0f30b98485d4dd78439c165ade2b8155bd7440508f80751fe940e46aa76441b","schema_version":"1.0","event_id":"sha256:b0f30b98485d4dd78439c165ade2b8155bd7440508f80751fe940e46aa76441b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZTUNGS6SO3O6DP76PGNPV253ML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expanding the expressive power of Monadic Second-Order logic on restricted graph classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DS","authors_text":"Jan Obdr\\v{z}\\'alek, Robert Ganian","submitted_at":"2013-06-24T10:53:00Z","abstract_excerpt":"We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known Monadic Second-Order logic by the addition of cardinality constraints, can be solved in FPT time parameterized by vertex cover. The second meta-theorem shows that the MSO partitioning problems introduced by Rao can also be solved in FPT time with the same parameter. The significance of our contribution stems from the fact that these formalisms can describe pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5571","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-18T03:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3LtzpzPAceQb7iXhbn6ybNJE/OFEcl3JUw2p1cGlnfFvUkIscp9s54+GWNW0y+UzCRAY4yJHaH6+XHzDZSxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:56:47.067789Z"},"content_sha256":"2eb8f93364eef5759fc2141200cf37b509a9786d052c8a00845e2f5a9a84c270","schema_version":"1.0","event_id":"sha256:2eb8f93364eef5759fc2141200cf37b509a9786d052c8a00845e2f5a9a84c270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTUNGS6SO3O6DP76PGNPV253ML/bundle.json","state_url":"https://pith.science/pith/ZTUNGS6SO3O6DP76PGNPV253ML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTUNGS6SO3O6DP76PGNPV253ML/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-02T05:56:47Z","links":{"resolver":"https://pith.science/pith/ZTUNGS6SO3O6DP76PGNPV253ML","bundle":"https://pith.science/pith/ZTUNGS6SO3O6DP76PGNPV253ML/bundle.json","state":"https://pith.science/pith/ZTUNGS6SO3O6DP76PGNPV253ML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTUNGS6SO3O6DP76PGNPV253ML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZTUNGS6SO3O6DP76PGNPV253ML","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":"2df17e3f4b0d8b93b5a765714582bd61c7befb96115a606556af6ca5008b0ce7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-24T10:53:00Z","title_canon_sha256":"2bf5e108d56f0c7ccbbdc243783343d5f49770d74bc2dd1a96041e4dffaf8dc7"},"schema_version":"1.0","source":{"id":"1306.5571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5571","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5571v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5571","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"ZTUNGS6SO3O6","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZTUNGS6SO3O6DP76","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZTUNGS6S","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:2eb8f93364eef5759fc2141200cf37b509a9786d052c8a00845e2f5a9a84c270","target":"graph","created_at":"2026-05-18T03:20:07Z","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 combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first shows that cardMSO1, an extension of the well-known Monadic Second-Order logic by the addition of cardinality constraints, can be solved in FPT time parameterized by vertex cover. The second meta-theorem shows that the MSO partitioning problems introduced by Rao can also be solved in FPT time with the same parameter. The significance of our contribution stems from the fact that these formalisms can describe pr","authors_text":"Jan Obdr\\v{z}\\'alek, Robert Ganian","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-24T10:53:00Z","title":"Expanding the expressive power of Monadic Second-Order logic on restricted graph classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5571","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:b0f30b98485d4dd78439c165ade2b8155bd7440508f80751fe940e46aa76441b","target":"record","created_at":"2026-05-18T03:20:07Z","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":"2df17e3f4b0d8b93b5a765714582bd61c7befb96115a606556af6ca5008b0ce7","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-24T10:53:00Z","title_canon_sha256":"2bf5e108d56f0c7ccbbdc243783343d5f49770d74bc2dd1a96041e4dffaf8dc7"},"schema_version":"1.0","source":{"id":"1306.5571","kind":"arxiv","version":1}},"canonical_sha256":"cce8d34bd276dde1bffe799afaebbb62dfa0afb7145794e560e84233ce610566","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cce8d34bd276dde1bffe799afaebbb62dfa0afb7145794e560e84233ce610566","first_computed_at":"2026-05-18T03:20:07.540141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:07.540141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKLdBctYSdhZdjyvTLg7okTkA3SnThAanDkxqScF08ndZ8GKGK0fqEHAUdY06ndqMd6ksE5CJxffyV2ScEsVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:07.540939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f30b98485d4dd78439c165ade2b8155bd7440508f80751fe940e46aa76441b","sha256:2eb8f93364eef5759fc2141200cf37b509a9786d052c8a00845e2f5a9a84c270"],"state_sha256":"9efa331ff18d6ef058f9c5a555435980d58a8eca94e928117e795dae4a868882"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hKFmPQ/dkrWRi+ASiif1fxniHJGNGzst1RtXSVfY485bSe9TEjaaHKGOndIP+SJ5zenk3ShXIu54hfbCXEIaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:56:47.070251Z","bundle_sha256":"86884e8cd9b68cddae152f80c796e4eddee56b263b6510663503b39c972f4a57"}}