{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y4Y4XITL6Y7DAHXZ65S5MGXA4Z","short_pith_number":"pith:Y4Y4XITL","schema_version":"1.0","canonical_sha256":"c731cba26bf63e301ef9f765d61ae0e6619d30925653fad74df68a15379e0322","source":{"kind":"arxiv","id":"1409.5987","version":1},"attestation_state":"computed","paper":{"title":"Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Jialin Zhang, Jia Zhang, Qizhi Fang, Xiaoming Sun","submitted_at":"2014-09-21T14:19:11Z","abstract_excerpt":"Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \\emph{Core}, \\emph{least-core} and \\emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardinality matching games (TCMG). A TCMG is defined on a graph $G=(V,E)$ and a threshold $T$, in which the player set is $V$ and the profit of a coalition $S\\subseteq V$ is 1 if the size of a maximum matching in $G[S]$ meets or exceeds $T$, and 0 otherwise. We first show that for a T"},"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":"1409.5987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-21T14:19:11Z","cross_cats_sorted":[],"title_canon_sha256":"1761e3c5eb379b3c5406e313c1de84fb988d48e81eff2d1610d6616dfe11b0fe","abstract_canon_sha256":"b36e246165af11bbdc3f39efb6106bcd836ad8814ecfcdf164748d23ff83cfd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:13.976950Z","signature_b64":"1QxIgCs76xgbss2uYjrUXj+5TUyY8WMg4Nrd5XzKemA6lVkRDnOmrvqd10novY0uFY+eJ2SjtRfOreP0oK8CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c731cba26bf63e301ef9f765d61ae0e6619d30925653fad74df68a15379e0322","last_reissued_at":"2026-05-18T02:42:13.976577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:13.976577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Li, Jialin Zhang, Jia Zhang, Qizhi Fang, Xiaoming Sun","submitted_at":"2014-09-21T14:19:11Z","abstract_excerpt":"Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \\emph{Core}, \\emph{least-core} and \\emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardinality matching games (TCMG). A TCMG is defined on a graph $G=(V,E)$ and a threshold $T$, in which the player set is $V$ and the profit of a coalition $S\\subseteq V$ is 1 if the size of a maximum matching in $G[S]$ meets or exceeds $T$, and 0 otherwise. We first show that for a T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5987","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":"1409.5987","created_at":"2026-05-18T02:42:13.976640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5987v1","created_at":"2026-05-18T02:42:13.976640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5987","created_at":"2026-05-18T02:42:13.976640+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4Y4XITL6Y7D","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4Y4XITL6Y7DAHXZ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4Y4XITL","created_at":"2026-05-18T12:28:57.508820+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/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z","json":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z.json","graph_json":"https://pith.science/api/pith-number/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/graph.json","events_json":"https://pith.science/api/pith-number/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/events.json","paper":"https://pith.science/paper/Y4Y4XITL"},"agent_actions":{"view_html":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z","download_json":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z.json","view_paper":"https://pith.science/paper/Y4Y4XITL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5987&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/action/storage_attestation","attest_author":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/action/author_attestation","sign_citation":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/action/citation_signature","submit_replication":"https://pith.science/pith/Y4Y4XITL6Y7DAHXZ65S5MGXA4Z/action/replication_record"}},"created_at":"2026-05-18T02:42:13.976640+00:00","updated_at":"2026-05-18T02:42:13.976640+00:00"}