{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RIUEV6V2KWSEQ6LNYKCUHSDGWL","short_pith_number":"pith:RIUEV6V2","canonical_record":{"source":{"id":"1902.06957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T09:15:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f829cdbf219faa7b21c5020c60bf955c4d454c99a264a6b4cad4bddbb6724179","abstract_canon_sha256":"404a228f04a4ae396fbe4a1583618458e52e889594857ec353cc06cd2517dd60"},"schema_version":"1.0"},"canonical_sha256":"8a284afaba55a448796dc28543c866b2cf9bbe9283328604709f7aa183533cf6","source":{"kind":"arxiv","id":"1902.06957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06957","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06957v1","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06957","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"RIUEV6V2KWSE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIUEV6V2KWSEQ6LN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIUEV6V2","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RIUEV6V2KWSEQ6LNYKCUHSDGWL","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T09:15:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f829cdbf219faa7b21c5020c60bf955c4d454c99a264a6b4cad4bddbb6724179","abstract_canon_sha256":"404a228f04a4ae396fbe4a1583618458e52e889594857ec353cc06cd2517dd60"},"schema_version":"1.0"},"canonical_sha256":"8a284afaba55a448796dc28543c866b2cf9bbe9283328604709f7aa183533cf6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:40.345960Z","signature_b64":"6GNB/I36xEa+5H2Q5F5eQXT6gCsf6y8PS9PnZRK+lQPyxgKV5cdLGhr15GBWb0lt1UaPtD7e2Go1jaU6jK30Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a284afaba55a448796dc28543c866b2cf9bbe9283328604709f7aa183533cf6","last_reissued_at":"2026-05-17T23:53:40.345446Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:40.345446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06957","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-17T23:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CSSlTMKjoAPRGYyriCwbsbStVKmudXMovlF+NbkPb5NNlDa2FEwXPKM1SsyIGKcHjdxP6lYCOW8l95IAQJXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:42:00.629336Z"},"content_sha256":"5f97de0240bc2c349bf653faadeca8e0da793e399fc0899939d4ba9c01c39140","schema_version":"1.0","event_id":"sha256:5f97de0240bc2c349bf653faadeca8e0da793e399fc0899939d4ba9c01c39140"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RIUEV6V2KWSEQ6LNYKCUHSDGWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh","submitted_at":"2019-02-19T09:15:13Z","abstract_excerpt":"Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P, where I is the incidence matrix of some graph and P is a binary matrix of rank at most r. Such matroids naturally appear in a number of theoretical and applied settings. The main motivation behind our work is an attempt to understand which parameterized algorithms for various problems on graphs could be lifted to perturbed graphic matroids.\n  We study the param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06957","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-17T23:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQhE+bhwQA5gP8qAuIkyWCDmS1Yo9JFvBF9ebJBjsFNxBSWV5uyppUyzPcSfbjD3108r3RHbGZA9Ah9B38DIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:42:00.629679Z"},"content_sha256":"1f961fb80a4a0eecba61a04da422ccf8df9c529c7e4909ea91299bfd4b9f0080","schema_version":"1.0","event_id":"sha256:1f961fb80a4a0eecba61a04da422ccf8df9c529c7e4909ea91299bfd4b9f0080"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/bundle.json","state_url":"https://pith.science/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/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-02T03:42:00Z","links":{"resolver":"https://pith.science/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL","bundle":"https://pith.science/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/bundle.json","state":"https://pith.science/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RIUEV6V2KWSEQ6LNYKCUHSDGWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RIUEV6V2KWSEQ6LNYKCUHSDGWL","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":"404a228f04a4ae396fbe4a1583618458e52e889594857ec353cc06cd2517dd60","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T09:15:13Z","title_canon_sha256":"f829cdbf219faa7b21c5020c60bf955c4d454c99a264a6b4cad4bddbb6724179"},"schema_version":"1.0","source":{"id":"1902.06957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06957","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06957v1","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06957","created_at":"2026-05-17T23:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"RIUEV6V2KWSE","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RIUEV6V2KWSEQ6LN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RIUEV6V2","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1f961fb80a4a0eecba61a04da422ccf8df9c529c7e4909ea91299bfd4b9f0080","target":"graph","created_at":"2026-05-17T23:53:40Z","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":"Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P, where I is the incidence matrix of some graph and P is a binary matrix of rank at most r. Such matroids naturally appear in a number of theoretical and applied settings. The main motivation behind our work is an attempt to understand which parameterized algorithms for various problems on graphs could be lifted to perturbed graphic matroids.\n  We study the param","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T09:15:13Z","title":"Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06957","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:5f97de0240bc2c349bf653faadeca8e0da793e399fc0899939d4ba9c01c39140","target":"record","created_at":"2026-05-17T23:53:40Z","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":"404a228f04a4ae396fbe4a1583618458e52e889594857ec353cc06cd2517dd60","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T09:15:13Z","title_canon_sha256":"f829cdbf219faa7b21c5020c60bf955c4d454c99a264a6b4cad4bddbb6724179"},"schema_version":"1.0","source":{"id":"1902.06957","kind":"arxiv","version":1}},"canonical_sha256":"8a284afaba55a448796dc28543c866b2cf9bbe9283328604709f7aa183533cf6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a284afaba55a448796dc28543c866b2cf9bbe9283328604709f7aa183533cf6","first_computed_at":"2026-05-17T23:53:40.345446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:40.345446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6GNB/I36xEa+5H2Q5F5eQXT6gCsf6y8PS9PnZRK+lQPyxgKV5cdLGhr15GBWb0lt1UaPtD7e2Go1jaU6jK30Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:40.345960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f97de0240bc2c349bf653faadeca8e0da793e399fc0899939d4ba9c01c39140","sha256:1f961fb80a4a0eecba61a04da422ccf8df9c529c7e4909ea91299bfd4b9f0080"],"state_sha256":"1801fd191915b438d228ed377c8ade4e3d334aca202efc0e27ce729972826ad0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFnVywsAfWjwmcY9+8ZxnmuMdMKJ+HnuuUzbmPcS+m+3kFPRjOBHo0WBHv/9E+rb7lo7Fa8hEWV3ALeJEYLPBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:42:00.631551Z","bundle_sha256":"8fb33407904a7007452eaa59a2a0a3d33f4f839d13afa8ee8ac6e54f4af82651"}}