{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y2LWE6US27CSPKE5QF2S6CMRWP","short_pith_number":"pith:Y2LWE6US","schema_version":"1.0","canonical_sha256":"c697627a92d7c527a89d81752f0991b3fb60aa837fd7b65748180353b8cda33d","source":{"kind":"arxiv","id":"1312.0248","version":2},"attestation_state":"computed","paper":{"title":"Maximizing the number of nonnegative subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Harout Aydinian, Noga Alon","submitted_at":"2013-12-01T16:51:44Z","abstract_excerpt":"Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\\binom{n-1}{k-1} + \\binom{n-1}{k-2} + \\cdots + \\binom{n-1}{0}+1$, settling a problem of Tsukerman. We provide two proofs, the first establishes and applies a weighted version of Hall's Theorem and the second is based on an extension of the nonuniform Erd\\H{o}s-Ko-Rado Theorem."},"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":"1312.0248","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T16:51:44Z","cross_cats_sorted":[],"title_canon_sha256":"32bcb8c0ca96001fbe4830313c564607da266e2c336788661a509288281a03ca","abstract_canon_sha256":"956ee2822c953bb67b355b64ec5530605eb691b48777ea8c5c6c5409bb133040"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:51.218903Z","signature_b64":"UTNadt+wvC4t7hZiAF0y80fxi+iZSoJ527f+Q3m9BMkBwkGLwYHzOOBoAKNyZjpF0jhAW4teLaxx2kRUyvRBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c697627a92d7c527a89d81752f0991b3fb60aa837fd7b65748180353b8cda33d","last_reissued_at":"2026-05-18T03:00:51.218245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:51.218245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing the number of nonnegative subsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Harout Aydinian, Noga Alon","submitted_at":"2013-12-01T16:51:44Z","abstract_excerpt":"Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\\binom{n-1}{k-1} + \\binom{n-1}{k-2} + \\cdots + \\binom{n-1}{0}+1$, settling a problem of Tsukerman. We provide two proofs, the first establishes and applies a weighted version of Hall's Theorem and the second is based on an extension of the nonuniform Erd\\H{o}s-Ko-Rado Theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0248","kind":"arxiv","version":2},"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":"1312.0248","created_at":"2026-05-18T03:00:51.218353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0248v2","created_at":"2026-05-18T03:00:51.218353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0248","created_at":"2026-05-18T03:00:51.218353+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2LWE6US27CS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2LWE6US27CSPKE5","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2LWE6US","created_at":"2026-05-18T12:28:06.772260+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/Y2LWE6US27CSPKE5QF2S6CMRWP","json":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP.json","graph_json":"https://pith.science/api/pith-number/Y2LWE6US27CSPKE5QF2S6CMRWP/graph.json","events_json":"https://pith.science/api/pith-number/Y2LWE6US27CSPKE5QF2S6CMRWP/events.json","paper":"https://pith.science/paper/Y2LWE6US"},"agent_actions":{"view_html":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP","download_json":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP.json","view_paper":"https://pith.science/paper/Y2LWE6US","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0248&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2LWE6US27CSPKE5QF2S6CMRWP/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2LWE6US27CSPKE5QF2S6CMRWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP/action/storage_attestation","attest_author":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP/action/author_attestation","sign_citation":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP/action/citation_signature","submit_replication":"https://pith.science/pith/Y2LWE6US27CSPKE5QF2S6CMRWP/action/replication_record"}},"created_at":"2026-05-18T03:00:51.218353+00:00","updated_at":"2026-05-18T03:00:51.218353+00:00"}