{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FK273O25L22CA2J5NS7C3R3OSP","short_pith_number":"pith:FK273O25","canonical_record":{"source":{"id":"2507.12607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T19:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"ad9352fc08ee1a0c994641d760ec6783a07e2cd9d4bb4b53755c8c5f2b845a69","abstract_canon_sha256":"7c21db499df348fb8a93a6793c75e151383ac0d647b19408510d09d1a24341f5"},"schema_version":"1.0"},"canonical_sha256":"2ab5fdbb5d5eb420693d6cbe2dc76e93cbb52d1ff09e9667bcabaed50e1e441e","source":{"kind":"arxiv","id":"2507.12607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12607","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12607v1","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12607","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"FK273O25L22C","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_16","alias_value":"FK273O25L22CA2J5","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_8","alias_value":"FK273O25","created_at":"2026-07-05T11:38:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FK273O25L22CA2J5NS7C3R3OSP","target":"record","payload":{"canonical_record":{"source":{"id":"2507.12607","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T19:54:48Z","cross_cats_sorted":[],"title_canon_sha256":"ad9352fc08ee1a0c994641d760ec6783a07e2cd9d4bb4b53755c8c5f2b845a69","abstract_canon_sha256":"7c21db499df348fb8a93a6793c75e151383ac0d647b19408510d09d1a24341f5"},"schema_version":"1.0"},"canonical_sha256":"2ab5fdbb5d5eb420693d6cbe2dc76e93cbb52d1ff09e9667bcabaed50e1e441e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:35.544967Z","signature_b64":"PBq/uOIQQ4qVR+In//uh0ax+yxfmZD1wsaam/Ea6vbMuF9iPKxNbiMm5m7GBoBgAf5vma/Gaz7h0+P7fbEk/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ab5fdbb5d5eb420693d6cbe2dc76e93cbb52d1ff09e9667bcabaed50e1e441e","last_reissued_at":"2026-07-05T11:38:35.544444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:35.544444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.12607","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"43lgbRFer8r+WRo8Wsbe5t14tZtlVcPR2hNgl0HzvOlZTNLc4gbaxBHdcyq2RgBTjm15scvkwErF3X7AdREgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:26:07.068611Z"},"content_sha256":"6a95eb1ee42bc595402de5b4252e8d3ffe0d8de6fe197d940c5f2505c103154d","schema_version":"1.0","event_id":"sha256:6a95eb1ee42bc595402de5b4252e8d3ffe0d8de6fe197d940c5f2505c103154d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FK273O25L22CA2J5NS7C3R3OSP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Cut with Multiple Cardinality Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Vakilian, Madhusudhan Reddy Pittu, Yury Makarychev","submitted_at":"2025-07-16T19:54:48Z","abstract_excerpt":"We study the classic Max-Cut problem under multiple cardinality constraints, which we refer to as the Constrained Max-Cut problem. Given a graph $G=(V, E)$, a partition of the vertices into $c$ disjoint parts $V_1, \\ldots, V_c$, and cardinality parameters $k_1, \\ldots, k_c$, the goal is to select a set $S \\subseteq V$ such that $|S \\cap V_i| = k_i$ for each $i \\in [c]$, maximizing the total weight of edges crossing $S$ (i.e., edges with exactly one endpoint in $S$).\n  By designing an approximate kernel for Constrained Max-Cut and building on the correlation rounding technique of Raghavendra an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12607","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.12607/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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQK25RSwhESoNIsrUQwg+45Xdte8Z4YAwvDR6I6yBfOd3ZHcWvLd1wiRYEejGLf3GdHGJoeZj4p3PXI7PkXGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:26:07.069108Z"},"content_sha256":"d58d4757366343b7ffa7828b04ffecdd217ee7306a81dee436d7b024c5bf3ffe","schema_version":"1.0","event_id":"sha256:d58d4757366343b7ffa7828b04ffecdd217ee7306a81dee436d7b024c5bf3ffe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FK273O25L22CA2J5NS7C3R3OSP/bundle.json","state_url":"https://pith.science/pith/FK273O25L22CA2J5NS7C3R3OSP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FK273O25L22CA2J5NS7C3R3OSP/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-07T09:26:07Z","links":{"resolver":"https://pith.science/pith/FK273O25L22CA2J5NS7C3R3OSP","bundle":"https://pith.science/pith/FK273O25L22CA2J5NS7C3R3OSP/bundle.json","state":"https://pith.science/pith/FK273O25L22CA2J5NS7C3R3OSP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FK273O25L22CA2J5NS7C3R3OSP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FK273O25L22CA2J5NS7C3R3OSP","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":"7c21db499df348fb8a93a6793c75e151383ac0d647b19408510d09d1a24341f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T19:54:48Z","title_canon_sha256":"ad9352fc08ee1a0c994641d760ec6783a07e2cd9d4bb4b53755c8c5f2b845a69"},"schema_version":"1.0","source":{"id":"2507.12607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.12607","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"2507.12607v1","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.12607","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"FK273O25L22C","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_16","alias_value":"FK273O25L22CA2J5","created_at":"2026-07-05T11:38:35Z"},{"alias_kind":"pith_short_8","alias_value":"FK273O25","created_at":"2026-07-05T11:38:35Z"}],"graph_snapshots":[{"event_id":"sha256:d58d4757366343b7ffa7828b04ffecdd217ee7306a81dee436d7b024c5bf3ffe","target":"graph","created_at":"2026-07-05T11:38:35Z","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.12607/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the classic Max-Cut problem under multiple cardinality constraints, which we refer to as the Constrained Max-Cut problem. Given a graph $G=(V, E)$, a partition of the vertices into $c$ disjoint parts $V_1, \\ldots, V_c$, and cardinality parameters $k_1, \\ldots, k_c$, the goal is to select a set $S \\subseteq V$ such that $|S \\cap V_i| = k_i$ for each $i \\in [c]$, maximizing the total weight of edges crossing $S$ (i.e., edges with exactly one endpoint in $S$).\n  By designing an approximate kernel for Constrained Max-Cut and building on the correlation rounding technique of Raghavendra an","authors_text":"Ali Vakilian, Madhusudhan Reddy Pittu, Yury Makarychev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T19:54:48Z","title":"Max-Cut with Multiple Cardinality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.12607","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:6a95eb1ee42bc595402de5b4252e8d3ffe0d8de6fe197d940c5f2505c103154d","target":"record","created_at":"2026-07-05T11:38:35Z","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":"7c21db499df348fb8a93a6793c75e151383ac0d647b19408510d09d1a24341f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-16T19:54:48Z","title_canon_sha256":"ad9352fc08ee1a0c994641d760ec6783a07e2cd9d4bb4b53755c8c5f2b845a69"},"schema_version":"1.0","source":{"id":"2507.12607","kind":"arxiv","version":1}},"canonical_sha256":"2ab5fdbb5d5eb420693d6cbe2dc76e93cbb52d1ff09e9667bcabaed50e1e441e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ab5fdbb5d5eb420693d6cbe2dc76e93cbb52d1ff09e9667bcabaed50e1e441e","first_computed_at":"2026-07-05T11:38:35.544444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:38:35.544444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBq/uOIQQ4qVR+In//uh0ax+yxfmZD1wsaam/Ea6vbMuF9iPKxNbiMm5m7GBoBgAf5vma/Gaz7h0+P7fbEk/BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:38:35.544967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.12607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a95eb1ee42bc595402de5b4252e8d3ffe0d8de6fe197d940c5f2505c103154d","sha256:d58d4757366343b7ffa7828b04ffecdd217ee7306a81dee436d7b024c5bf3ffe"],"state_sha256":"27f167e73ce5ad0bbe71ece91732d5bb26415033f6bdfe42931bf95e3a98037d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FD79zEGy7bWUyuY91ZQ+UCQSyJnBrdKf8OPr3Q95ryuOFW5E1H4jv7/cDCXHt0+3Klj7vMDVfnEN/caN6uQsAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T09:26:07.073846Z","bundle_sha256":"b899ebc6c8ecfdceb0e7d8d748b4619589e546ffa48edfdb56dea047c0540256"}}