{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A7JC55FTBFFUNDTH5JUV6AFMM5","short_pith_number":"pith:A7JC55FT","schema_version":"1.0","canonical_sha256":"07d22ef4b3094b468e67ea695f00ac677b3e25119b5108311547e1721b7c6ba3","source":{"kind":"arxiv","id":"1611.04535","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.04535","created_at":"2026-05-18T00:03:19.944608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04535v4","created_at":"2026-05-18T00:03:19.944608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04535","created_at":"2026-05-18T00:03:19.944608+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7JC55FTBFFU","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7JC55FTBFFUNDTH","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7JC55FT","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5","json":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5.json","graph_json":"https://pith.science/api/pith-number/A7JC55FTBFFUNDTH5JUV6AFMM5/graph.json","events_json":"https://pith.science/api/pith-number/A7JC55FTBFFUNDTH5JUV6AFMM5/events.json","paper":"https://pith.science/paper/A7JC55FT"},"agent_actions":{"view_html":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5","download_json":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5.json","view_paper":"https://pith.science/paper/A7JC55FT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04535&json=true","fetch_graph":"https://pith.science/api/pith-number/A7JC55FTBFFUNDTH5JUV6AFMM5/graph.json","fetch_events":"https://pith.science/api/pith-number/A7JC55FTBFFUNDTH5JUV6AFMM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/action/storage_attestation","attest_author":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/action/author_attestation","sign_citation":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/action/citation_signature","submit_replication":"https://pith.science/pith/A7JC55FTBFFUNDTH5JUV6AFMM5/action/replication_record"}},"created_at":"2026-05-18T00:03:19.944608+00:00","updated_at":"2026-05-18T00:03:19.944608+00:00"}