{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XFOAE7IPNPJZCZUMIDQTPWIRBK","short_pith_number":"pith:XFOAE7IP","canonical_record":{"source":{"id":"1710.02300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T08:02:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a717e70ff8bbaf5ebbdbecf0ab2842d0ec2a50d822cdc67b0ef729941096731f","abstract_canon_sha256":"a0018d995ad514f04cf027be1bb18fe87d86615254e6441da88d07af5472225f"},"schema_version":"1.0"},"canonical_sha256":"b95c027d0f6bd391668c40e137d9110aa651fc2548fc0d7a0e7fceb1f3091c7b","source":{"kind":"arxiv","id":"1710.02300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02300","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02300v1","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02300","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"pith_short_12","alias_value":"XFOAE7IPNPJZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XFOAE7IPNPJZCZUM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XFOAE7IP","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XFOAE7IPNPJZCZUMIDQTPWIRBK","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T08:02:35Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"a717e70ff8bbaf5ebbdbecf0ab2842d0ec2a50d822cdc67b0ef729941096731f","abstract_canon_sha256":"a0018d995ad514f04cf027be1bb18fe87d86615254e6441da88d07af5472225f"},"schema_version":"1.0"},"canonical_sha256":"b95c027d0f6bd391668c40e137d9110aa651fc2548fc0d7a0e7fceb1f3091c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:33.863160Z","signature_b64":"kHvVvUFFYNni4hBzAadLhBwtHRuP55ctmFgSAb6PA9MtuUfHMxW8kiVBlkhg9uUZIr0dRN2kEwf3UtnDzMihCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b95c027d0f6bd391668c40e137d9110aa651fc2548fc0d7a0e7fceb1f3091c7b","last_reissued_at":"2026-05-18T00:33:33.862645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:33.862645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02300","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:33:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2rXbBhKS8XYsxigqqnigzieWUqVn/eHJuHVK2vSTkrGrfN6RiDG/vImkI2X4PdqEvu+wb1vS1v1npIRCC5dKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:46.558974Z"},"content_sha256":"f58070d34bd44699d59290ce9681071b03fb1abead5d84a9235c8f1445b345da","schema_version":"1.0","event_id":"sha256:f58070d34bd44699d59290ce9681071b03fb1abead5d84a9235c8f1445b345da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XFOAE7IPNPJZCZUMIDQTPWIRBK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering vectors by spaces: Regular matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","submitted_at":"2017-10-06T08:02:35Z","abstract_excerpt":"Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on regular matroids. We consider the problem of covering a set of vectors of a given finite dimensional linear space (vector space) by a subspace generated by a set of vectors of minimum size. Specifically, in the Space Cover problem, we are given a matrix M and a subset of its columns T; the task is to find a minimum set F of columns of M disjoint with T such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02300","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:33:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAsfc0SZ0ogGDVSJ4dYBQFVnWFkv/dvcrgB0kSPCC/2PzR67fb2sN3JBCUkjiecsPuPDSCCOPiupo1MNXuM0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:58:46.559678Z"},"content_sha256":"d134fbf7b45425224b0c0b460957c2a28332cc38d1f3b1a9ea0132d9158db99c","schema_version":"1.0","event_id":"sha256:d134fbf7b45425224b0c0b460957c2a28332cc38d1f3b1a9ea0132d9158db99c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/bundle.json","state_url":"https://pith.science/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/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-25T11:58:46Z","links":{"resolver":"https://pith.science/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK","bundle":"https://pith.science/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/bundle.json","state":"https://pith.science/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFOAE7IPNPJZCZUMIDQTPWIRBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XFOAE7IPNPJZCZUMIDQTPWIRBK","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":"a0018d995ad514f04cf027be1bb18fe87d86615254e6441da88d07af5472225f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T08:02:35Z","title_canon_sha256":"a717e70ff8bbaf5ebbdbecf0ab2842d0ec2a50d822cdc67b0ef729941096731f"},"schema_version":"1.0","source":{"id":"1710.02300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02300","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02300v1","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02300","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"pith_short_12","alias_value":"XFOAE7IPNPJZ","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XFOAE7IPNPJZCZUM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XFOAE7IP","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:d134fbf7b45425224b0c0b460957c2a28332cc38d1f3b1a9ea0132d9158db99c","target":"graph","created_at":"2026-05-18T00:33:33Z","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":"Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on regular matroids. We consider the problem of covering a set of vectors of a given finite dimensional linear space (vector space) by a subspace generated by a set of vectors of minimum size. Specifically, in the Space Cover problem, we are given a matrix M and a subset of its columns T; the task is to find a minimum set F of columns of M disjoint with T such ","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Petr A. Golovach, Saket Saurabh","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T08:02:35Z","title":"Covering vectors by spaces: Regular matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02300","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:f58070d34bd44699d59290ce9681071b03fb1abead5d84a9235c8f1445b345da","target":"record","created_at":"2026-05-18T00:33:33Z","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":"a0018d995ad514f04cf027be1bb18fe87d86615254e6441da88d07af5472225f","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-06T08:02:35Z","title_canon_sha256":"a717e70ff8bbaf5ebbdbecf0ab2842d0ec2a50d822cdc67b0ef729941096731f"},"schema_version":"1.0","source":{"id":"1710.02300","kind":"arxiv","version":1}},"canonical_sha256":"b95c027d0f6bd391668c40e137d9110aa651fc2548fc0d7a0e7fceb1f3091c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b95c027d0f6bd391668c40e137d9110aa651fc2548fc0d7a0e7fceb1f3091c7b","first_computed_at":"2026-05-18T00:33:33.862645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:33.862645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kHvVvUFFYNni4hBzAadLhBwtHRuP55ctmFgSAb6PA9MtuUfHMxW8kiVBlkhg9uUZIr0dRN2kEwf3UtnDzMihCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:33.863160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f58070d34bd44699d59290ce9681071b03fb1abead5d84a9235c8f1445b345da","sha256:d134fbf7b45425224b0c0b460957c2a28332cc38d1f3b1a9ea0132d9158db99c"],"state_sha256":"fe8e1379cacd6ecf5f0815087858fc3fea67b9b942c3e40895a3d164a37bd5ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgcVGKMAA77WNloaYz+aUgn6PmMsBNqhe+ALA6DeKvQ/J6PSDxBMto5u64ZDYkG6ZV9TCyYrN+6QdP7oXjLGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:58:46.563418Z","bundle_sha256":"8fba3d95dff7e719066e0e1844667d96a185800ce8eb13ec038ea146b7b51217"}}