{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YZZVAWST2F4YU2RRHWJ7HHMV7Q","short_pith_number":"pith:YZZVAWST","canonical_record":{"source":{"id":"2507.09377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-12T18:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"f28fce7b12975fcf288ce9984215aec082de5cdf872bce686759a2ccfa428ac6","abstract_canon_sha256":"cab711dd31e9f8b334f8d49d0ace782b1cd569d7098a01beb891d2beca8170a2"},"schema_version":"1.0"},"canonical_sha256":"c673505a53d1798a6a313d93f39d95fc17f768c26c2b9edd52e2573c27bda790","source":{"kind":"arxiv","id":"2507.09377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09377","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09377v1","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09377","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"YZZVAWST2F4Y","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"YZZVAWST2F4YU2RR","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"YZZVAWST","created_at":"2026-07-05T11:36:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YZZVAWST2F4YU2RRHWJ7HHMV7Q","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-12T18:49:32Z","cross_cats_sorted":[],"title_canon_sha256":"f28fce7b12975fcf288ce9984215aec082de5cdf872bce686759a2ccfa428ac6","abstract_canon_sha256":"cab711dd31e9f8b334f8d49d0ace782b1cd569d7098a01beb891d2beca8170a2"},"schema_version":"1.0"},"canonical_sha256":"c673505a53d1798a6a313d93f39d95fc17f768c26c2b9edd52e2573c27bda790","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:07.944044Z","signature_b64":"Mq6+UlUz5ipctA7fhHP5CpMVwVZm/ItIPAWbp3Lubk9reZ4Ok+tWV55YP4Ps+TCxgeWcWk4SJQInyXYspuEjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c673505a53d1798a6a313d93f39d95fc17f768c26c2b9edd52e2573c27bda790","last_reissued_at":"2026-07-05T11:36:07.943703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:07.943703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09377","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-07-05T11:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NYc5MtFaPcmYas+dHWPDAqICtBqMgWib/NWebYIazUnvYHpsqUe5wKsdbFpDkNnTgixL3PU2LpRVxgQ+NPA0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:52:24.408243Z"},"content_sha256":"c6487c182c4656a4eebcf3c369cd17a24c9e506db6c869051673f297d98d0f12","schema_version":"1.0","event_id":"sha256:c6487c182c4656a4eebcf3c369cd17a24c9e506db6c869051673f297d98d0f12"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YZZVAWST2F4YU2RRHWJ7HHMV7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mumuksh Tayal","submitted_at":"2025-07-12T18:49:32Z","abstract_excerpt":"The Minimum Vertex Cover problem, a classical NP-complete problem, presents significant challenges for exact solution on large graphs. Fixed-Parameter Tractability (FPT) offers a powerful paradigm to address such problems by exploiting a parameter of the input, typically related to the size of the desired solution. This paper presents an implementation and empirical evaluation of an FPT algorithm for the Minimum Vertex Cover problem parameterized by the size of the vertex cover, $k$. The algorithm utilizes a branching strategy based on selecting adjacent vertices and recursively solving subpro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09377","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.09377/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zv2cxWb1k9hqDZ5uE0h3gcy052V/dDcfSf1H/zi4L+57I10h/wqlTeSkJ0Tz1762P1h1qahOtrhH1UjzjRvUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:52:24.408743Z"},"content_sha256":"a29fa4bbd8508e69dc5fe7456d22c999fd37a3185e8ee66eb4ea02660abd24d3","schema_version":"1.0","event_id":"sha256:a29fa4bbd8508e69dc5fe7456d22c999fd37a3185e8ee66eb4ea02660abd24d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/bundle.json","state_url":"https://pith.science/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/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-08-09T05:52:24Z","links":{"resolver":"https://pith.science/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q","bundle":"https://pith.science/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/bundle.json","state":"https://pith.science/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZZVAWST2F4YU2RRHWJ7HHMV7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YZZVAWST2F4YU2RRHWJ7HHMV7Q","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":"cab711dd31e9f8b334f8d49d0ace782b1cd569d7098a01beb891d2beca8170a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-12T18:49:32Z","title_canon_sha256":"f28fce7b12975fcf288ce9984215aec082de5cdf872bce686759a2ccfa428ac6"},"schema_version":"1.0","source":{"id":"2507.09377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09377","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09377v1","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09377","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"YZZVAWST2F4Y","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_16","alias_value":"YZZVAWST2F4YU2RR","created_at":"2026-07-05T11:36:07Z"},{"alias_kind":"pith_short_8","alias_value":"YZZVAWST","created_at":"2026-07-05T11:36:07Z"}],"graph_snapshots":[{"event_id":"sha256:a29fa4bbd8508e69dc5fe7456d22c999fd37a3185e8ee66eb4ea02660abd24d3","target":"graph","created_at":"2026-07-05T11:36: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.09377/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Minimum Vertex Cover problem, a classical NP-complete problem, presents significant challenges for exact solution on large graphs. Fixed-Parameter Tractability (FPT) offers a powerful paradigm to address such problems by exploiting a parameter of the input, typically related to the size of the desired solution. This paper presents an implementation and empirical evaluation of an FPT algorithm for the Minimum Vertex Cover problem parameterized by the size of the vertex cover, $k$. The algorithm utilizes a branching strategy based on selecting adjacent vertices and recursively solving subpro","authors_text":"Mumuksh Tayal","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-12T18:49:32Z","title":"A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09377","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:c6487c182c4656a4eebcf3c369cd17a24c9e506db6c869051673f297d98d0f12","target":"record","created_at":"2026-07-05T11:36: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":"cab711dd31e9f8b334f8d49d0ace782b1cd569d7098a01beb891d2beca8170a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-12T18:49:32Z","title_canon_sha256":"f28fce7b12975fcf288ce9984215aec082de5cdf872bce686759a2ccfa428ac6"},"schema_version":"1.0","source":{"id":"2507.09377","kind":"arxiv","version":1}},"canonical_sha256":"c673505a53d1798a6a313d93f39d95fc17f768c26c2b9edd52e2573c27bda790","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c673505a53d1798a6a313d93f39d95fc17f768c26c2b9edd52e2573c27bda790","first_computed_at":"2026-07-05T11:36:07.943703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:07.943703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mq6+UlUz5ipctA7fhHP5CpMVwVZm/ItIPAWbp3Lubk9reZ4Ok+tWV55YP4Ps+TCxgeWcWk4SJQInyXYspuEjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:07.944044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6487c182c4656a4eebcf3c369cd17a24c9e506db6c869051673f297d98d0f12","sha256:a29fa4bbd8508e69dc5fe7456d22c999fd37a3185e8ee66eb4ea02660abd24d3"],"state_sha256":"8676ef63433a009792286bb69ec707c3f3c2e8eee84071150825cb3ea9779087"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBsSdVTa8pC7IXlLye7wbfFYkQusaZWslsGZ5FxdG02WEu08zv4R7EdiKVE7OQefbEOttel40h645fwOxI+2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:52:24.412583Z","bundle_sha256":"f2f2af930cb4e611e64396ba2294b5d17189417ebada3cc7311af9d9b6739fcb"}}