{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A7JC55FTBFFUNDTH5JUV6AFMM5","short_pith_number":"pith:A7JC55FT","canonical_record":{"source":{"id":"1611.04535","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T19:22:21Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"aec40914f1d05e7406f2c40495f28c9cb1b4e5bbd02afcdc6fb4248b4e4ba30f","abstract_canon_sha256":"6016663d619479e872963bc0a6a027de5ada508c273a7b84ec0dfeebcd5c7096"},"schema_version":"1.0"},"canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","source":{"kind":"arxiv","id":"1611.04535","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04535","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04535v4","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04535","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"A7JC55FTBFFU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7JC55FTBFFUNDTH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7JC55FT","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A7JC55FTBFFUNDTH5JUV6AFMM5","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04535","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T19:22:21Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"aec40914f1d05e7406f2c40495f28c9cb1b4e5bbd02afcdc6fb4248b4e4ba30f","abstract_canon_sha256":"6016663d619479e872963bc0a6a027de5ada508c273a7b84ec0dfeebcd5c7096"},"schema_version":"1.0"},"canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:19.945073Z","signature_b64":"e0s1V2DhIX+T635vmATjHBBfC0X2ydh/0F8bp70FyypCSDCFHsEgcuYBlVL1535kBJ+0CubZhdnlVhba3/gUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","last_reissued_at":"2026-05-18T00:03:19.944512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:19.944512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04535","source_version":4,"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-18T00:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5FdOKsnV1B79+lEMEi+NmynCy/IRtv2SNiICSATGnnHby5AzN+oWu9714rYzgcowaWyohdCyb+kkD4E8GwEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:07.567332Z"},"content_sha256":"d5f87c2ccbd4b9889789418d884a4e254b0687233f017f6bda79c018c10a2577","schema_version":"1.0","event_id":"sha256:d5f87c2ccbd4b9889789418d884a4e254b0687233f017f6bda79c018c10a2577"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A7JC55FTBFFUNDTH5JUV6AFMM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DS","authors_text":"Colin White, Ellen Vitercik, Maria-Florina Balcan, Vaishnavh Nagarajan","submitted_at":"2016-11-14T19:22:21Z","abstract_excerpt":"Max-cut, clustering, and many other partitioning problems that are of significant importance to machine learning and other scientific fields are NP-hard, a reality that has motivated researchers to develop a wealth of approximation algorithms and heuristics. Although the best algorithm to use typically depends on the specific application domain, a worst-case analysis is often used to compare algorithms. This may be misleading if worst-case instances occur infrequently, and thus there is a demand for optimization methods which return the algorithm configuration best suited for the given applica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04535","kind":"arxiv","version":4},"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-18T00:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNHaUuse/sRFHuB7M9X44PYRvmuAohGVzRkxKp/Jwj5v+PG38uORT0/+c/manam5WooOpWmyklNTfsvoEW8OCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:07.567922Z"},"content_sha256":"88540a27e2a73984bd4a7d83436960179f0f2b5be2b213853f8ae5af6aab6f1a","schema_version":"1.0","event_id":"sha256:88540a27e2a73984bd4a7d83436960179f0f2b5be2b213853f8ae5af6aab6f1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/bundle.json","state_url":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/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-04T17:19:07Z","links":{"resolver":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5","bundle":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/bundle.json","state":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A7JC55FTBFFUNDTH5JUV6AFMM5","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":"6016663d619479e872963bc0a6a027de5ada508c273a7b84ec0dfeebcd5c7096","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T19:22:21Z","title_canon_sha256":"aec40914f1d05e7406f2c40495f28c9cb1b4e5bbd02afcdc6fb4248b4e4ba30f"},"schema_version":"1.0","source":{"id":"1611.04535","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04535","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04535v4","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04535","created_at":"2026-05-18T00:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"A7JC55FTBFFU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A7JC55FTBFFUNDTH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A7JC55FT","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:88540a27e2a73984bd4a7d83436960179f0f2b5be2b213853f8ae5af6aab6f1a","target":"graph","created_at":"2026-05-18T00:03:19Z","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":"Max-cut, clustering, and many other partitioning problems that are of significant importance to machine learning and other scientific fields are NP-hard, a reality that has motivated researchers to develop a wealth of approximation algorithms and heuristics. Although the best algorithm to use typically depends on the specific application domain, a worst-case analysis is often used to compare algorithms. This may be misleading if worst-case instances occur infrequently, and thus there is a demand for optimization methods which return the algorithm configuration best suited for the given applica","authors_text":"Colin White, Ellen Vitercik, Maria-Florina Balcan, Vaishnavh Nagarajan","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T19:22:21Z","title":"Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04535","kind":"arxiv","version":4},"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:d5f87c2ccbd4b9889789418d884a4e254b0687233f017f6bda79c018c10a2577","target":"record","created_at":"2026-05-18T00:03:19Z","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":"6016663d619479e872963bc0a6a027de5ada508c273a7b84ec0dfeebcd5c7096","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-14T19:22:21Z","title_canon_sha256":"aec40914f1d05e7406f2c40495f28c9cb1b4e5bbd02afcdc6fb4248b4e4ba30f"},"schema_version":"1.0","source":{"id":"1611.04535","kind":"arxiv","version":4}},"canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","first_computed_at":"2026-05-18T00:03:19.944512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:19.944512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e0s1V2DhIX+T635vmATjHBBfC0X2ydh/0F8bp70FyypCSDCFHsEgcuYBlVL1535kBJ+0CubZhdnlVhba3/gUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:19.945073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04535","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5f87c2ccbd4b9889789418d884a4e254b0687233f017f6bda79c018c10a2577","sha256:88540a27e2a73984bd4a7d83436960179f0f2b5be2b213853f8ae5af6aab6f1a"],"state_sha256":"e490a4094859b15777adc850202d883335cf055a2b13392ba1c6b0a9895f17c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxAVlreBt0yOmep7ei+GqmUrykv6THgyDewdlaBHihalJyJOTPul3KIbRVFwpbrOMcvDun0U+gjnxGiu9iy6Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:19:07.570808Z","bundle_sha256":"c8d0b1f03d64feba64975540bc352c107640586b7d9896306335462b3eaf60ce"}}