{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CF4AO3V2TWECLUQBFLYCKXZV2M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c76da6efab205b5d415a4b3e9eaaff4a05ce23391d925d9077d60cc1d09689a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-10T04:18:30Z","title_canon_sha256":"d22d1c67c1628567cfb2c2765f7a45968b59b4ad61de0dd0ed52dd435db68041"},"schema_version":"1.0","source":{"id":"1809.03126","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03126","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03126v3","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03126","created_at":"2026-05-18T00:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"CF4AO3V2TWEC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CF4AO3V2TWECLUQB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CF4AO3V2","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:dc196b390cfadd8d0162524c134c5e4a5221494c51e58fc111dd240638bb2579","target":"graph","created_at":"2026-05-18T00:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Akiyoshi Shioura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-10T04:18:30Z","title":"M-convex Function Minimization Under L1-Distance Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03126","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bf928f7d03579c4de84492f77a771fd94ad6445dda1127f6cfe6ffd07342950a","target":"record","created_at":"2026-05-18T00:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c76da6efab205b5d415a4b3e9eaaff4a05ce23391d925d9077d60cc1d09689a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-10T04:18:30Z","title_canon_sha256":"d22d1c67c1628567cfb2c2765f7a45968b59b4ad61de0dd0ed52dd435db68041"},"schema_version":"1.0","source":{"id":"1809.03126","kind":"arxiv","version":3}},"canonical_sha256":"1178076eba9d8825d2012af0255f35d33cba1eac81004ee8dc8d44142030adac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1178076eba9d8825d2012af0255f35d33cba1eac81004ee8dc8d44142030adac","first_computed_at":"2026-05-18T00:05:55.639999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:55.639999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+E2K9W5Y+rUJG6rCLT1VcCe80rJWOjTMRfW0vVPftBrnq+vgRXDo767i8Iygpd3c25aLMbB4v2c47JH5yMlfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:55.640706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03126","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf928f7d03579c4de84492f77a771fd94ad6445dda1127f6cfe6ffd07342950a","sha256:dc196b390cfadd8d0162524c134c5e4a5221494c51e58fc111dd240638bb2579"],"state_sha256":"fe6d5582070cb19b586aec92a366f54197c66065867e72b9ae2d9e0212475124"}