{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LLPGLKFD6OR7HHI7XWRYTTT3TE","short_pith_number":"pith:LLPGLKFD","canonical_record":{"source":{"id":"1403.0099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"a6c5ccddfd579bedc12894ff8099370190d276d22795f41b6190a6ec01cd5df2","abstract_canon_sha256":"da5bc5bb6b464d4d068d447c825012b917dd93d1cb58a995cc437ab1955a5f82"},"schema_version":"1.0"},"canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","source":{"kind":"arxiv","id":"1403.0099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0099","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0099v1","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0099","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"LLPGLKFD6OR7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LLPGLKFD6OR7HHI7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LLPGLKFD","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LLPGLKFD6OR7HHI7XWRYTTT3TE","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","cross_cats_sorted":[],"title_canon_sha256":"a6c5ccddfd579bedc12894ff8099370190d276d22795f41b6190a6ec01cd5df2","abstract_canon_sha256":"da5bc5bb6b464d4d068d447c825012b917dd93d1cb58a995cc437ab1955a5f82"},"schema_version":"1.0"},"canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:25.766942Z","signature_b64":"ERjtMfCpgf/FJHdwfrGN7SjwqmRXxLlzPs9oJ6KEzvNyTd0xe4w1y80QQshQFLCTJgtc7KP1c46q8w1o7IvqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","last_reissued_at":"2026-05-18T02:57:25.766369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:25.766369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0099","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-18T02:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3lntuNtst8R9ByQKrGu7cGvnuSOUdY9UxNHefuXvw4nC5dJwlM2z5F4b28OG527HbYHMtwGI+BSvEG9vkmyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:48:14.249047Z"},"content_sha256":"038eb46aab2db7ad9ac51a2413237109d9a5cd436f7a0a789785f5c3cb5bd9ce","schema_version":"1.0","event_id":"sha256:038eb46aab2db7ad9ac51a2413237109d9a5cd436f7a0a789785f5c3cb5bd9ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LLPGLKFD6OR7HHI7XWRYTTT3TE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Algorithms for Graph Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hadas Shachnai, Meirav Zehavi","submitted_at":"2014-03-01T15:45:12Z","abstract_excerpt":"We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\\subseteq V$ of size $k$, such that $\\alpha_1m_1 + \\alpha_2m_2$ is at most (or at least) $p$, where $\\alpha_1,\\alpha_2\\in\\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0099","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-18T02:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLorfSb/zHQbXaqaRY6Q97jN3ajoJnmEbd35FZvMZap1tIOBemMTIUBifE8MPmTMfXBBgE+ayBKmrq71ydMLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:48:14.249681Z"},"content_sha256":"33e4cddda080ed3e99afe3642869d70b5d9aae28ce04d1a408375899820bc8bc","schema_version":"1.0","event_id":"sha256:33e4cddda080ed3e99afe3642869d70b5d9aae28ce04d1a408375899820bc8bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/bundle.json","state_url":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/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-05T20:48:14Z","links":{"resolver":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE","bundle":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/bundle.json","state":"https://pith.science/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLPGLKFD6OR7HHI7XWRYTTT3TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LLPGLKFD6OR7HHI7XWRYTTT3TE","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":"da5bc5bb6b464d4d068d447c825012b917dd93d1cb58a995cc437ab1955a5f82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","title_canon_sha256":"a6c5ccddfd579bedc12894ff8099370190d276d22795f41b6190a6ec01cd5df2"},"schema_version":"1.0","source":{"id":"1403.0099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0099","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0099v1","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0099","created_at":"2026-05-18T02:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"LLPGLKFD6OR7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LLPGLKFD6OR7HHI7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LLPGLKFD","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:33e4cddda080ed3e99afe3642869d70b5d9aae28ce04d1a408375899820bc8bc","target":"graph","created_at":"2026-05-18T02:57:25Z","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 study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\\subseteq V$ of size $k$, such that $\\alpha_1m_1 + \\alpha_2m_2$ is at most (or at least) $p$, where $\\alpha_1,\\alpha_2\\in\\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-","authors_text":"Hadas Shachnai, Meirav Zehavi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","title":"Parameterized Algorithms for Graph Partitioning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0099","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:038eb46aab2db7ad9ac51a2413237109d9a5cd436f7a0a789785f5c3cb5bd9ce","target":"record","created_at":"2026-05-18T02:57:25Z","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":"da5bc5bb6b464d4d068d447c825012b917dd93d1cb58a995cc437ab1955a5f82","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-01T15:45:12Z","title_canon_sha256":"a6c5ccddfd579bedc12894ff8099370190d276d22795f41b6190a6ec01cd5df2"},"schema_version":"1.0","source":{"id":"1403.0099","kind":"arxiv","version":1}},"canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ade65a8a3f3a3f39d1fbda389ce7b9921089f1b725ce2410f21b739a71ab409","first_computed_at":"2026-05-18T02:57:25.766369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:25.766369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ERjtMfCpgf/FJHdwfrGN7SjwqmRXxLlzPs9oJ6KEzvNyTd0xe4w1y80QQshQFLCTJgtc7KP1c46q8w1o7IvqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:25.766942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:038eb46aab2db7ad9ac51a2413237109d9a5cd436f7a0a789785f5c3cb5bd9ce","sha256:33e4cddda080ed3e99afe3642869d70b5d9aae28ce04d1a408375899820bc8bc"],"state_sha256":"382d345db165d50d95e8abf7d907c8a48b0edcfc260a7321f130698178c9b9b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTFaP1sffPNEihPrU2ziNeZpl0MiS9v7ozeMdeNqW1JcxcANGhyPCxKY3so+gMa4HLB1m7ztpDl6dwIKrqfKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:48:14.252643Z","bundle_sha256":"4367b485a1f15b1db66e4f9e40f16919733dd132f18fef1ed9366077366b58fa"}}