{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G5HEOORNLFGN7EIZECV6URJ36Q","short_pith_number":"pith:G5HEOORN","schema_version":"1.0","canonical_sha256":"374e473a2d594cdf911920abea453bf40daf060967e235a5edcad8d8d45220a1","source":{"kind":"arxiv","id":"1302.3636","version":1},"attestation_state":"computed","paper":{"title":"A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Stephen G. Hartke","submitted_at":"2013-02-14T21:50:14Z","abstract_excerpt":"The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a linear programming formulation to show that verifying the conjecture for fixed values of k is a finite problem. To improve our search, we develop a zero-error randomized propagation algorithm. Using implementations of these algorithms, we verify a stronger form of the conjecture for all k at most seven."},"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":"1302.3636","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-14T21:50:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"931adce585678dd78a486b4fc6efb55ed887eaab8481c5373c3ef6de1b3f967b","abstract_canon_sha256":"5308e3112c1c7ea8d1ff839165efdcebfb1391bdea07d2a6f60c68b988388b17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.316587Z","signature_b64":"NFRjWOre7YvO0APB0U2vwuKWD7quwBnOgxwS9cM3KTg/gNJfq/XtpvtF58h2xjXhOp/BKP9N7S3ttaAMwTDrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"374e473a2d594cdf911920abea453bf40daf060967e235a5edcad8d8d45220a1","last_reissued_at":"2026-05-18T03:33:36.315712Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.315712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Derrick Stolee, Stephen G. Hartke","submitted_at":"2013-02-14T21:50:14Z","abstract_excerpt":"The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k, every multiset of n real numbers with nonnegative total sum has at least (n-1 choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut strategy using a linear programming formulation to show that verifying the conjecture for fixed values of k is a finite problem. To improve our search, we develop a zero-error randomized propagation algorithm. Using implementations of these algorithms, we verify a stronger form of the conjecture for all k at most seven."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3636","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3636","created_at":"2026-05-18T03:33:36.315841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3636v1","created_at":"2026-05-18T03:33:36.315841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3636","created_at":"2026-05-18T03:33:36.315841+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5HEOORNLFGN","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5HEOORNLFGN7EIZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5HEOORN","created_at":"2026-05-18T12:27:45.050594+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/G5HEOORNLFGN7EIZECV6URJ36Q","json":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q.json","graph_json":"https://pith.science/api/pith-number/G5HEOORNLFGN7EIZECV6URJ36Q/graph.json","events_json":"https://pith.science/api/pith-number/G5HEOORNLFGN7EIZECV6URJ36Q/events.json","paper":"https://pith.science/paper/G5HEOORN"},"agent_actions":{"view_html":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q","download_json":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q.json","view_paper":"https://pith.science/paper/G5HEOORN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3636&json=true","fetch_graph":"https://pith.science/api/pith-number/G5HEOORNLFGN7EIZECV6URJ36Q/graph.json","fetch_events":"https://pith.science/api/pith-number/G5HEOORNLFGN7EIZECV6URJ36Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q/action/storage_attestation","attest_author":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q/action/author_attestation","sign_citation":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q/action/citation_signature","submit_replication":"https://pith.science/pith/G5HEOORNLFGN7EIZECV6URJ36Q/action/replication_record"}},"created_at":"2026-05-18T03:33:36.315841+00:00","updated_at":"2026-05-18T03:33:36.315841+00:00"}