{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:I67IUQFRPPIIL4UHIBW4S275QA","short_pith_number":"pith:I67IUQFR","schema_version":"1.0","canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","source":{"kind":"arxiv","id":"1405.4960","version":3},"attestation_state":"computed","paper":{"title":"Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Hiroshi Hirai","submitted_at":"2014-05-20T06:10:35Z","abstract_excerpt":"For a graph G and a set V containing the vertex set of G, a 0-extension of G is a metric d on V such that d extends the shortest path metric of G and for all x in V there exists a vertex s in G with d(x, s) = 0. The minimum 0-extension problem 0-Ext[G] on G is: given a set V containing V(G) and a nonnegative cost function c defined on the set of all pairs of V, find a 0-extension d of G with \\sum c(xy)d(x, y) minimum. The 0-extension problem generalizes a number of basic combinatorial optimization problems, such as minimum (s,t)-cut problem and multiway cut problem. Karzanov proved the polynom"},"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":"1405.4960","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-20T06:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"3e10daac13a25317521667d93dac453a96f8cde94b0aaf0a7f4bf09a4c08683e","abstract_canon_sha256":"418c2a5162771690567d826cf43bb12637e13669f404add7d0fb50e57cc4930e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:48.911231Z","signature_b64":"HsAcnK50XKFuEY9iGQaHsBN5wB4ZqkGOcW2madmJGuBYSv3S3OgXl6qHYFrpQctjJKBxTOg2+2cgZvClcSUtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","last_reissued_at":"2026-05-18T01:22:48.910658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:48.910658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Hiroshi Hirai","submitted_at":"2014-05-20T06:10:35Z","abstract_excerpt":"For a graph G and a set V containing the vertex set of G, a 0-extension of G is a metric d on V such that d extends the shortest path metric of G and for all x in V there exists a vertex s in G with d(x, s) = 0. The minimum 0-extension problem 0-Ext[G] on G is: given a set V containing V(G) and a nonnegative cost function c defined on the set of all pairs of V, find a 0-extension d of G with \\sum c(xy)d(x, y) minimum. The 0-extension problem generalizes a number of basic combinatorial optimization problems, such as minimum (s,t)-cut problem and multiway cut problem. Karzanov proved the polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4960","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":"1405.4960","created_at":"2026-05-18T01:22:48.910782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4960v3","created_at":"2026-05-18T01:22:48.910782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4960","created_at":"2026-05-18T01:22:48.910782+00:00"},{"alias_kind":"pith_short_12","alias_value":"I67IUQFRPPII","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"I67IUQFRPPIIL4UH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"I67IUQFR","created_at":"2026-05-18T12:28:33.132498+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/I67IUQFRPPIIL4UHIBW4S275QA","json":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA.json","graph_json":"https://pith.science/api/pith-number/I67IUQFRPPIIL4UHIBW4S275QA/graph.json","events_json":"https://pith.science/api/pith-number/I67IUQFRPPIIL4UHIBW4S275QA/events.json","paper":"https://pith.science/paper/I67IUQFR"},"agent_actions":{"view_html":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA","download_json":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA.json","view_paper":"https://pith.science/paper/I67IUQFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4960&json=true","fetch_graph":"https://pith.science/api/pith-number/I67IUQFRPPIIL4UHIBW4S275QA/graph.json","fetch_events":"https://pith.science/api/pith-number/I67IUQFRPPIIL4UHIBW4S275QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/action/storage_attestation","attest_author":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/action/author_attestation","sign_citation":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/action/citation_signature","submit_replication":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/action/replication_record"}},"created_at":"2026-05-18T01:22:48.910782+00:00","updated_at":"2026-05-18T01:22:48.910782+00:00"}