{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E4XAVPXFKH2EPRWMGGI33CCWOW","short_pith_number":"pith:E4XAVPXF","schema_version":"1.0","canonical_sha256":"272e0abee551f447c6cc3191bd88567584ce73ef81b5476ad9c04a82704e57f7","source":{"kind":"arxiv","id":"1703.10705","version":2},"attestation_state":"computed","paper":{"title":"Scaling, Proximity, and Optimization of Integrally Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Akihisa Tamura, Fabio Tardella, Kazuo Murota, Satoko Moriguchi","submitted_at":"2017-03-30T23:02:52Z","abstract_excerpt":"In discrete convex analysis, the scaling and proximity properties for the class of L$^\\natural$-convex functions were established more than a decade ago and have been used to design efficient minimization algorithms. For the larger class of integrally convex functions of $n$ variables, we show here that the scaling property only holds when $n \\leq 2$, while a proximity theorem can be established for any $n$, but only with a superexponential bound. This is, however, sufficient to extend the classical logarithmic complexity result for minimizing a discrete convex function of one variable to the "},"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":"1703.10705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-30T23:02:52Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d25ca6b95d430cb9f6a2b8357e4a3f5e1b4c532236c38e902264b18fe3d79c54","abstract_canon_sha256":"eaa5d9c93c2ea91cc04fb133584acab77767835a5bb6c2d572ce234f059c0fb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:16.037449Z","signature_b64":"UBWYXta7jQlCbVFolECMNpsa8e0l5uc5lTDXRQoQVDyZQW6nM5WWkrp5JwB6ooScVQJ/y0yc8Ux+C2GRtSQJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"272e0abee551f447c6cc3191bd88567584ce73ef81b5476ad9c04a82704e57f7","last_reissued_at":"2026-05-18T00:28:16.036674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:16.036674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling, Proximity, and Optimization of Integrally Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Akihisa Tamura, Fabio Tardella, Kazuo Murota, Satoko Moriguchi","submitted_at":"2017-03-30T23:02:52Z","abstract_excerpt":"In discrete convex analysis, the scaling and proximity properties for the class of L$^\\natural$-convex functions were established more than a decade ago and have been used to design efficient minimization algorithms. For the larger class of integrally convex functions of $n$ variables, we show here that the scaling property only holds when $n \\leq 2$, while a proximity theorem can be established for any $n$, but only with a superexponential bound. This is, however, sufficient to extend the classical logarithmic complexity result for minimizing a discrete convex function of one variable to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10705","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":"1703.10705","created_at":"2026-05-18T00:28:16.036817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10705v2","created_at":"2026-05-18T00:28:16.036817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10705","created_at":"2026-05-18T00:28:16.036817+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4XAVPXFKH2E","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4XAVPXFKH2EPRWM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4XAVPXF","created_at":"2026-05-18T12:31:12.930513+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/E4XAVPXFKH2EPRWMGGI33CCWOW","json":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW.json","graph_json":"https://pith.science/api/pith-number/E4XAVPXFKH2EPRWMGGI33CCWOW/graph.json","events_json":"https://pith.science/api/pith-number/E4XAVPXFKH2EPRWMGGI33CCWOW/events.json","paper":"https://pith.science/paper/E4XAVPXF"},"agent_actions":{"view_html":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW","download_json":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW.json","view_paper":"https://pith.science/paper/E4XAVPXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10705&json=true","fetch_graph":"https://pith.science/api/pith-number/E4XAVPXFKH2EPRWMGGI33CCWOW/graph.json","fetch_events":"https://pith.science/api/pith-number/E4XAVPXFKH2EPRWMGGI33CCWOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW/action/storage_attestation","attest_author":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW/action/author_attestation","sign_citation":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW/action/citation_signature","submit_replication":"https://pith.science/pith/E4XAVPXFKH2EPRWMGGI33CCWOW/action/replication_record"}},"created_at":"2026-05-18T00:28:16.036817+00:00","updated_at":"2026-05-18T00:28:16.036817+00:00"}