{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CF4AO3V2TWECLUQBFLYCKXZV2M","short_pith_number":"pith:CF4AO3V2","schema_version":"1.0","canonical_sha256":"1178076eba9d8825d2012af0255f35d33cba1eac81004ee8dc8d44142030adac","source":{"kind":"arxiv","id":"1809.03126","version":3},"attestation_state":"computed","paper":{"title":"M-convex Function Minimization Under L1-Distance Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiyoshi Shioura","submitted_at":"2018-09-10T04:18:30Z","abstract_excerpt":"In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the constraint is given by an upper bound for L1-distance between a feasible solution and a given \"center.\" This is motivated by a nonlinear integer programming problem for re-allocation of dock capacity in a bike sharing system discussed by Freund et al. (2017). The main aim of this paper is to better understand the combinatorial structure of the dock re-allocation problem through the connection with M-convexity, and show its polynomial-time solvability using this connection. For th"},"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":"1809.03126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-10T04:18:30Z","cross_cats_sorted":[],"title_canon_sha256":"d22d1c67c1628567cfb2c2765f7a45968b59b4ad61de0dd0ed52dd435db68041","abstract_canon_sha256":"c76da6efab205b5d415a4b3e9eaaff4a05ce23391d925d9077d60cc1d09689a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:55.640706Z","signature_b64":"+E2K9W5Y+rUJG6rCLT1VcCe80rJWOjTMRfW0vVPftBrnq+vgRXDo767i8Iygpd3c25aLMbB4v2c47JH5yMlfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1178076eba9d8825d2012af0255f35d33cba1eac81004ee8dc8d44142030adac","last_reissued_at":"2026-05-18T00:05:55.639999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:55.639999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M-convex Function Minimization Under L1-Distance Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akiyoshi Shioura","submitted_at":"2018-09-10T04:18:30Z","abstract_excerpt":"In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the constraint is given by an upper bound for L1-distance between a feasible solution and a given \"center.\" This is motivated by a nonlinear integer programming problem for re-allocation of dock capacity in a bike sharing system discussed by Freund et al. (2017). The main aim of this paper is to better understand the combinatorial structure of the dock re-allocation problem through the connection with M-convexity, and show its polynomial-time solvability using this connection. For th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03126","kind":"arxiv","version":3},"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":"1809.03126","created_at":"2026-05-18T00:05:55.640104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03126v3","created_at":"2026-05-18T00:05:55.640104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03126","created_at":"2026-05-18T00:05:55.640104+00:00"},{"alias_kind":"pith_short_12","alias_value":"CF4AO3V2TWEC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CF4AO3V2TWECLUQB","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CF4AO3V2","created_at":"2026-05-18T12:32:16.446611+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/CF4AO3V2TWECLUQBFLYCKXZV2M","json":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M.json","graph_json":"https://pith.science/api/pith-number/CF4AO3V2TWECLUQBFLYCKXZV2M/graph.json","events_json":"https://pith.science/api/pith-number/CF4AO3V2TWECLUQBFLYCKXZV2M/events.json","paper":"https://pith.science/paper/CF4AO3V2"},"agent_actions":{"view_html":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M","download_json":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M.json","view_paper":"https://pith.science/paper/CF4AO3V2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03126&json=true","fetch_graph":"https://pith.science/api/pith-number/CF4AO3V2TWECLUQBFLYCKXZV2M/graph.json","fetch_events":"https://pith.science/api/pith-number/CF4AO3V2TWECLUQBFLYCKXZV2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M/action/storage_attestation","attest_author":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M/action/author_attestation","sign_citation":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M/action/citation_signature","submit_replication":"https://pith.science/pith/CF4AO3V2TWECLUQBFLYCKXZV2M/action/replication_record"}},"created_at":"2026-05-18T00:05:55.640104+00:00","updated_at":"2026-05-18T00:05:55.640104+00:00"}