{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JEVWNMV75TXMDGTHNIDLNCOEFI","short_pith_number":"pith:JEVWNMV7","schema_version":"1.0","canonical_sha256":"492b66b2bfeceec19a676a06b689c42a2be5843c0b8ae989ccaf3a0212004456","source":{"kind":"arxiv","id":"1509.08575","version":2},"attestation_state":"computed","paper":{"title":"On uncrossing games for skew-supermodular functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Hirai","submitted_at":"2015-09-29T03:03:26Z","abstract_excerpt":"In this note, we consider the uncrossing game for a skew-supermodular function $f$, which is a two-player game with players, Red and Blue, and abstracts the uncrossing procedure in the cut-covering linear program associated with $f$. Extending the earlier results by Karzanov for $\\{0,1\\}$-valued skew-supermodular functions, we present an improved polynomial time strategy for Red to win, and give a strongly polynomial time uncrossing procedure for dual solutions of the cut-covering LP as its consequence. We also mention its implication on the optimality of laminar solutions."},"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":"1509.08575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-29T03:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"a5058f6795084e0ea9d47b25b71c0ce48cadb27984d788edfcb01d0cb9e0d89f","abstract_canon_sha256":"4aa7fd2012ec0c3db76cd66627b63915139ab10dbd7ced1471e73788348d49a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:47.993646Z","signature_b64":"xcgm8lbWhGbS7piWmDJObwbzEg/mM9YHyxADRf5g3mJ+CQk0aVkf3w+S3dEALj54AJAB11pmjsKl9tiQ7sU3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"492b66b2bfeceec19a676a06b689c42a2be5843c0b8ae989ccaf3a0212004456","last_reissued_at":"2026-05-18T01:22:47.993060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:47.993060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On uncrossing games for skew-supermodular functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Hirai","submitted_at":"2015-09-29T03:03:26Z","abstract_excerpt":"In this note, we consider the uncrossing game for a skew-supermodular function $f$, which is a two-player game with players, Red and Blue, and abstracts the uncrossing procedure in the cut-covering linear program associated with $f$. Extending the earlier results by Karzanov for $\\{0,1\\}$-valued skew-supermodular functions, we present an improved polynomial time strategy for Red to win, and give a strongly polynomial time uncrossing procedure for dual solutions of the cut-covering LP as its consequence. We also mention its implication on the optimality of laminar solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08575","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":"1509.08575","created_at":"2026-05-18T01:22:47.993149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08575v2","created_at":"2026-05-18T01:22:47.993149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08575","created_at":"2026-05-18T01:22:47.993149+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEVWNMV75TXM","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEVWNMV75TXMDGTH","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEVWNMV7","created_at":"2026-05-18T12:29:27.538025+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/JEVWNMV75TXMDGTHNIDLNCOEFI","json":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI.json","graph_json":"https://pith.science/api/pith-number/JEVWNMV75TXMDGTHNIDLNCOEFI/graph.json","events_json":"https://pith.science/api/pith-number/JEVWNMV75TXMDGTHNIDLNCOEFI/events.json","paper":"https://pith.science/paper/JEVWNMV7"},"agent_actions":{"view_html":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI","download_json":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI.json","view_paper":"https://pith.science/paper/JEVWNMV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08575&json=true","fetch_graph":"https://pith.science/api/pith-number/JEVWNMV75TXMDGTHNIDLNCOEFI/graph.json","fetch_events":"https://pith.science/api/pith-number/JEVWNMV75TXMDGTHNIDLNCOEFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI/action/storage_attestation","attest_author":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI/action/author_attestation","sign_citation":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI/action/citation_signature","submit_replication":"https://pith.science/pith/JEVWNMV75TXMDGTHNIDLNCOEFI/action/replication_record"}},"created_at":"2026-05-18T01:22:47.993149+00:00","updated_at":"2026-05-18T01:22:47.993149+00:00"}