{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YJXRMPN3NTKR7YJRHBL6NIOAQ4","short_pith_number":"pith:YJXRMPN3","canonical_record":{"source":{"id":"1411.4444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T11:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"3021aa818cb7221c161ac5b8f781842ee819b3ab78bda68cf5b148c48dd7272f","abstract_canon_sha256":"c3f676c9ef2ea93e575e7ae8aed10aa725832c8136f8a62b9c1d27f4d80fe8d9"},"schema_version":"1.0"},"canonical_sha256":"c26f163dbb6cd51fe1313857e6a1c0873f30cbd0871cd2f24966bcbbec3ac762","source":{"kind":"arxiv","id":"1411.4444","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4444","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4444v3","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4444","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"YJXRMPN3NTKR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJXRMPN3NTKR7YJR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJXRMPN3","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YJXRMPN3NTKR7YJRHBL6NIOAQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4444","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T11:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"3021aa818cb7221c161ac5b8f781842ee819b3ab78bda68cf5b148c48dd7272f","abstract_canon_sha256":"c3f676c9ef2ea93e575e7ae8aed10aa725832c8136f8a62b9c1d27f4d80fe8d9"},"schema_version":"1.0"},"canonical_sha256":"c26f163dbb6cd51fe1313857e6a1c0873f30cbd0871cd2f24966bcbbec3ac762","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:48.720222Z","signature_b64":"BeK4+cBTi/wyEhKo3gcUkCovv6NBuPbjsM5h6ueEoDsvrGeaAeOPeDDaOnphrWdlKwhaaClMWnd0BKkUiVQ0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c26f163dbb6cd51fe1313857e6a1c0873f30cbd0871cd2f24966bcbbec3ac762","last_reissued_at":"2026-05-18T01:22:48.719699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:48.719699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4444","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfUrC5XJ7p9+/Vcbaqqib7YVnzDjzuUt8uYqt3/BEVsG4JsjThGv270PZ0+SWfpAU8sm0khBp4Dn9pIGC6WrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:22:54.554922Z"},"content_sha256":"de924cecc7d8eac45f40b47e89f590187ffe2592549cbe7da7b24f0c376b9f5c","schema_version":"1.0","event_id":"sha256:de924cecc7d8eac45f40b47e89f590187ffe2592549cbe7da7b24f0c376b9f5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YJXRMPN3NTKR7YJRHBL6NIOAQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hiroshi Hirai","submitted_at":"2014-11-17T11:51:54Z","abstract_excerpt":"In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a local-to-global optimality criterion, the steepest descend algorithm by successive $k$-submodular function minimizations, the persistency property, and the proximity theorem. Our theory is motivated by minimum cost free multiflow problem. To this problem, Goldberg and Karzanov gave two combinatorial weakly polynomial time algorithms based on capacity and cost scalings,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4444","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v384TvX73ntp4bCI4Xaov83XoskjPdZXUFs3LSk5jcgVYyPG5EQe2SOITLgbDkYibaI8Swd20LQW2wJwo7lVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:22:54.555600Z"},"content_sha256":"8f354381863248bf5bc4e1999f1467abd89eb66d2b8c01116cd79c4793f26986","schema_version":"1.0","event_id":"sha256:8f354381863248bf5bc4e1999f1467abd89eb66d2b8c01116cd79c4793f26986"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/bundle.json","state_url":"https://pith.science/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T14:22:54Z","links":{"resolver":"https://pith.science/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4","bundle":"https://pith.science/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/bundle.json","state":"https://pith.science/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJXRMPN3NTKR7YJRHBL6NIOAQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YJXRMPN3NTKR7YJRHBL6NIOAQ4","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":"c3f676c9ef2ea93e575e7ae8aed10aa725832c8136f8a62b9c1d27f4d80fe8d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T11:51:54Z","title_canon_sha256":"3021aa818cb7221c161ac5b8f781842ee819b3ab78bda68cf5b148c48dd7272f"},"schema_version":"1.0","source":{"id":"1411.4444","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4444","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4444v3","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4444","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"YJXRMPN3NTKR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YJXRMPN3NTKR7YJR","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YJXRMPN3","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:8f354381863248bf5bc4e1999f1467abd89eb66d2b8c01116cd79c4793f26986","target":"graph","created_at":"2026-05-18T01:22:48Z","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 develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a local-to-global optimality criterion, the steepest descend algorithm by successive $k$-submodular function minimizations, the persistency property, and the proximity theorem. Our theory is motivated by minimum cost free multiflow problem. To this problem, Goldberg and Karzanov gave two combinatorial weakly polynomial time algorithms based on capacity and cost scalings,","authors_text":"Hiroshi Hirai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T11:51:54Z","title":"L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4444","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:de924cecc7d8eac45f40b47e89f590187ffe2592549cbe7da7b24f0c376b9f5c","target":"record","created_at":"2026-05-18T01:22:48Z","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":"c3f676c9ef2ea93e575e7ae8aed10aa725832c8136f8a62b9c1d27f4d80fe8d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-17T11:51:54Z","title_canon_sha256":"3021aa818cb7221c161ac5b8f781842ee819b3ab78bda68cf5b148c48dd7272f"},"schema_version":"1.0","source":{"id":"1411.4444","kind":"arxiv","version":3}},"canonical_sha256":"c26f163dbb6cd51fe1313857e6a1c0873f30cbd0871cd2f24966bcbbec3ac762","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c26f163dbb6cd51fe1313857e6a1c0873f30cbd0871cd2f24966bcbbec3ac762","first_computed_at":"2026-05-18T01:22:48.719699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:48.719699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BeK4+cBTi/wyEhKo3gcUkCovv6NBuPbjsM5h6ueEoDsvrGeaAeOPeDDaOnphrWdlKwhaaClMWnd0BKkUiVQ0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:48.720222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4444","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de924cecc7d8eac45f40b47e89f590187ffe2592549cbe7da7b24f0c376b9f5c","sha256:8f354381863248bf5bc4e1999f1467abd89eb66d2b8c01116cd79c4793f26986"],"state_sha256":"906f6fbd17ff68fa10a5de04838208a6aca6d35e45cc967d41abc939571ea637"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekS6EUpUpGbWFjGVvy7103wOAkyMKRGcv3DFSv+raw3R4IbnE6eGXIF36KEjJQdfSCfUzOgVM6EXdVsIoxNxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:22:54.558484Z","bundle_sha256":"ba81425dfaf1aea3524301f5d5b981a05303f5b8460e8bce781a5863a21a252c"}}