{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BTCVOQ7U7ZGCZVTFNHATRBJO2E","short_pith_number":"pith:BTCVOQ7U","schema_version":"1.0","canonical_sha256":"0cc55743f4fe4c2cd66569c138852ed12d21e9d1ec18f00ffa3186ec8e5e7b91","source":{"kind":"arxiv","id":"1808.05835","version":1},"attestation_state":"computed","paper":{"title":"The Manickam-Mikl\\'os-Singhi Parameter of Graphs and Degree Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian McMeeking, Joshua Mundinger, Neeraja Kulkarni, Zolt\\'an Kir\\'aly","submitted_at":"2018-08-17T12:10:41Z","abstract_excerpt":"Let $G$ be a simple graph. Consider all weightings of the vertices of $G$ with real numbers whose total sum is nonnegative. How many edges of $G$ have endpoints with a nonnegative sum? We consider the minimum number of such edges over all such weightings as a graph parameter. Computing this parameter has been shown to be NP-hard but we give a polynomial algorithm to compute the minimum of this parameter over realizations of a given degree sequence. We also completely determine the minimum and maximum value of this parameter for regular graphs."},"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":"1808.05835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-17T12:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"0aaa46773f05eea3011a69eca0094147bb85e317aaf039fac4e3245f14d624df","abstract_canon_sha256":"cea2aff4196d237e6a5580822e6208840869d01ade13a13a5f50c9e2a3610476"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:51.972715Z","signature_b64":"Q7YZqMvDE+Rxk+RRolRVNdWFDLtiWYHaBFcnSZaF5eFd35vx5PwPqmVfaKxzAZUYZXgcpnaeHNXnNq4tmm8tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cc55743f4fe4c2cd66569c138852ed12d21e9d1ec18f00ffa3186ec8e5e7b91","last_reissued_at":"2026-05-18T00:07:51.971896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:51.971896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Manickam-Mikl\\'os-Singhi Parameter of Graphs and Degree Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ian McMeeking, Joshua Mundinger, Neeraja Kulkarni, Zolt\\'an Kir\\'aly","submitted_at":"2018-08-17T12:10:41Z","abstract_excerpt":"Let $G$ be a simple graph. Consider all weightings of the vertices of $G$ with real numbers whose total sum is nonnegative. How many edges of $G$ have endpoints with a nonnegative sum? We consider the minimum number of such edges over all such weightings as a graph parameter. Computing this parameter has been shown to be NP-hard but we give a polynomial algorithm to compute the minimum of this parameter over realizations of a given degree sequence. We also completely determine the minimum and maximum value of this parameter for regular graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05835","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":"1808.05835","created_at":"2026-05-18T00:07:51.972023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05835v1","created_at":"2026-05-18T00:07:51.972023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05835","created_at":"2026-05-18T00:07:51.972023+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTCVOQ7U7ZGC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTCVOQ7U7ZGCZVTF","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTCVOQ7U","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22708","citing_title":"The Manickam-Mikl\\'os-Singhi Property in Graphs and Hypergraphs","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E","json":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E.json","graph_json":"https://pith.science/api/pith-number/BTCVOQ7U7ZGCZVTFNHATRBJO2E/graph.json","events_json":"https://pith.science/api/pith-number/BTCVOQ7U7ZGCZVTFNHATRBJO2E/events.json","paper":"https://pith.science/paper/BTCVOQ7U"},"agent_actions":{"view_html":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E","download_json":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E.json","view_paper":"https://pith.science/paper/BTCVOQ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05835&json=true","fetch_graph":"https://pith.science/api/pith-number/BTCVOQ7U7ZGCZVTFNHATRBJO2E/graph.json","fetch_events":"https://pith.science/api/pith-number/BTCVOQ7U7ZGCZVTFNHATRBJO2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E/action/storage_attestation","attest_author":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E/action/author_attestation","sign_citation":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E/action/citation_signature","submit_replication":"https://pith.science/pith/BTCVOQ7U7ZGCZVTFNHATRBJO2E/action/replication_record"}},"created_at":"2026-05-18T00:07:51.972023+00:00","updated_at":"2026-05-18T00:07:51.972023+00:00"}