{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PJMP7J6JPBXDRPJBVYYXVEGIRA","short_pith_number":"pith:PJMP7J6J","canonical_record":{"source":{"id":"2308.15546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T18:11:03Z","cross_cats_sorted":[],"title_canon_sha256":"9ec5180b2ae985b86c53568028d219b41d7a42d76fdb1c5f63e8e3e5e8620f48","abstract_canon_sha256":"7c0f370764b44188f8a4512e33e4784d6d557ac26522559130637e9ddf645f39"},"schema_version":"1.0"},"canonical_sha256":"7a58ffa7c9786e38bd21ae317a90c888115dfd6a242838b804fcbb3f76ea60cc","source":{"kind":"arxiv","id":"2308.15546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15546","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15546v1","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15546","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"PJMP7J6JPBXD","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_16","alias_value":"PJMP7J6JPBXDRPJB","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_8","alias_value":"PJMP7J6J","created_at":"2026-07-05T06:46:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PJMP7J6JPBXDRPJBVYYXVEGIRA","target":"record","payload":{"canonical_record":{"source":{"id":"2308.15546","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T18:11:03Z","cross_cats_sorted":[],"title_canon_sha256":"9ec5180b2ae985b86c53568028d219b41d7a42d76fdb1c5f63e8e3e5e8620f48","abstract_canon_sha256":"7c0f370764b44188f8a4512e33e4784d6d557ac26522559130637e9ddf645f39"},"schema_version":"1.0"},"canonical_sha256":"7a58ffa7c9786e38bd21ae317a90c888115dfd6a242838b804fcbb3f76ea60cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:46:09.028882Z","signature_b64":"TcW+Y4lrKWFcq+0kqYwnzgCt0F+q1YTjlm2CwxiHYz7GlUobxitDgkofb3MGaLADSgI+SeKnGg/hpU5hAlMVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a58ffa7c9786e38bd21ae317a90c888115dfd6a242838b804fcbb3f76ea60cc","last_reissued_at":"2026-07-05T06:46:09.028453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:46:09.028453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.15546","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-05T06:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qaje/xxq1OSC5DlBGg5kxzPzCRrDztS3MopKI33yjtVBxMHXbMJrFBb8YVlcrs756Vt0tC9Yq3/2G2reUiKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:05:32.114684Z"},"content_sha256":"e34e77892ebb8be87eb87d3a3913f573775c677a10acabf90dbc2b00aef0bf28","schema_version":"1.0","event_id":"sha256:e34e77892ebb8be87eb87d3a3913f573775c677a10acabf90dbc2b00aef0bf28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PJMP7J6JPBXDRPJBVYYXVEGIRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana","submitted_at":"2023-08-29T18:11:03Z","abstract_excerpt":"We study the \\textsc{$\\alpha$-Fixed Cardinality Graph Partitioning ($\\alpha$-FCGP)} problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph $G$, two numbers $k,p$ and $0\\leq\\alpha\\leq 1$, the question is whether there is a set $S\\subseteq V$ of size $k$ with a specified coverage function $cov_{\\alpha}(S)$ at least $p$ (or at most $p$ for the minimization version). The coverage function $cov_{\\alpha}(\\cdot)$ counts edges with exactly one endpoint in $S$ with weight $\\alpha$ and edges with both endpoints in $S$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15546","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/2308.15546/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-05T06:46:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JD6X2U4eg42hKoZeCcdBOykPdBDNF2LdMfVVqMfkxpzaTblp7yn+/9mafkjh23HBt9tRYM3OgX7qdoBFCQMcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T10:05:32.115253Z"},"content_sha256":"f06d7c7e00bf2021f8cf8853e80480dd244f6c892de2dd9a02bd5c1a3d51462d","schema_version":"1.0","event_id":"sha256:f06d7c7e00bf2021f8cf8853e80480dd244f6c892de2dd9a02bd5c1a3d51462d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/bundle.json","state_url":"https://pith.science/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/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-14T10:05:32Z","links":{"resolver":"https://pith.science/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA","bundle":"https://pith.science/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/bundle.json","state":"https://pith.science/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJMP7J6JPBXDRPJBVYYXVEGIRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PJMP7J6JPBXDRPJBVYYXVEGIRA","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":"7c0f370764b44188f8a4512e33e4784d6d557ac26522559130637e9ddf645f39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T18:11:03Z","title_canon_sha256":"9ec5180b2ae985b86c53568028d219b41d7a42d76fdb1c5f63e8e3e5e8620f48"},"schema_version":"1.0","source":{"id":"2308.15546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15546","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15546v1","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15546","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_12","alias_value":"PJMP7J6JPBXD","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_16","alias_value":"PJMP7J6JPBXDRPJB","created_at":"2026-07-05T06:46:09Z"},{"alias_kind":"pith_short_8","alias_value":"PJMP7J6J","created_at":"2026-07-05T06:46:09Z"}],"graph_snapshots":[{"event_id":"sha256:f06d7c7e00bf2021f8cf8853e80480dd244f6c892de2dd9a02bd5c1a3d51462d","target":"graph","created_at":"2026-07-05T06:46:09Z","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/2308.15546/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the \\textsc{$\\alpha$-Fixed Cardinality Graph Partitioning ($\\alpha$-FCGP)} problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph $G$, two numbers $k,p$ and $0\\leq\\alpha\\leq 1$, the question is whether there is a set $S\\subseteq V$ of size $k$ with a specified coverage function $cov_{\\alpha}(S)$ at least $p$ (or at most $p$ for the minimization version). The coverage function $cov_{\\alpha}(\\cdot)$ counts edges with exactly one endpoint in $S$ with weight $\\alpha$ and edges with both endpoints in $S$ ","authors_text":"Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T18:11:03Z","title":"FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15546","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:e34e77892ebb8be87eb87d3a3913f573775c677a10acabf90dbc2b00aef0bf28","target":"record","created_at":"2026-07-05T06:46:09Z","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":"7c0f370764b44188f8a4512e33e4784d6d557ac26522559130637e9ddf645f39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-08-29T18:11:03Z","title_canon_sha256":"9ec5180b2ae985b86c53568028d219b41d7a42d76fdb1c5f63e8e3e5e8620f48"},"schema_version":"1.0","source":{"id":"2308.15546","kind":"arxiv","version":1}},"canonical_sha256":"7a58ffa7c9786e38bd21ae317a90c888115dfd6a242838b804fcbb3f76ea60cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a58ffa7c9786e38bd21ae317a90c888115dfd6a242838b804fcbb3f76ea60cc","first_computed_at":"2026-07-05T06:46:09.028453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:46:09.028453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TcW+Y4lrKWFcq+0kqYwnzgCt0F+q1YTjlm2CwxiHYz7GlUobxitDgkofb3MGaLADSgI+SeKnGg/hpU5hAlMVAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:46:09.028882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e34e77892ebb8be87eb87d3a3913f573775c677a10acabf90dbc2b00aef0bf28","sha256:f06d7c7e00bf2021f8cf8853e80480dd244f6c892de2dd9a02bd5c1a3d51462d"],"state_sha256":"b0a8255247af7d76e4f6de47f35757923113cbdf66a834090cef81444a968053"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"35gsk4S3MxMkRgtl4rBWzrdhwck9RdlbzY2YEAMVg4WBzptUi27OPGlN/0X2dIrm0IcSYs3XWiy2UkCY4D+eAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T10:05:32.120600Z","bundle_sha256":"3f84de3fb419c37286e4347bc38360525441ab6da26d24db0d6898f58acbe04f"}}