{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I67IUQFRPPIIL4UHIBW4S275QA","short_pith_number":"pith:I67IUQFR","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"},"canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","source":{"kind":"arxiv","id":"1405.4960","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4960","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4960v3","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4960","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"I67IUQFRPPII","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I67IUQFRPPIIL4UH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I67IUQFR","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I67IUQFRPPIIL4UHIBW4S275QA","target":"record","payload":{"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"},"canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","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"},"source_kind":"arxiv","source_id":"1405.4960","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":"NM7wJC3A9Cr1OPuKcfmdaH+K7uzbiNC6UenYcTCdDXcogslpi7LV38c74uTjlusbiKo+FOprYLboDGFUvCXuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:29:21.321328Z"},"content_sha256":"2c543a9dd37688911897febc11a82ed1458578c76bdc86f1d62cbe374762f84b","schema_version":"1.0","event_id":"sha256:2c543a9dd37688911897febc11a82ed1458578c76bdc86f1d62cbe374762f84b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I67IUQFRPPIIL4UHIBW4S275QA","target":"graph","payload":{"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"},"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":"TJJWo8CM04pamy+FmcS6Bz/I7z7dt5+XazvoLET/0AyPBKin6j/YQKDOE9ejj+HGHlWspcLoR2Bn+lpjYal2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:29:21.321791Z"},"content_sha256":"056cd6b20556621f419e06d8615ddb80f1e7204096b96c8f27bd00bdc72958fe","schema_version":"1.0","event_id":"sha256:056cd6b20556621f419e06d8615ddb80f1e7204096b96c8f27bd00bdc72958fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/bundle.json","state_url":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I67IUQFRPPIIL4UHIBW4S275QA/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-27T00:29:21Z","links":{"resolver":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA","bundle":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/bundle.json","state":"https://pith.science/pith/I67IUQFRPPIIL4UHIBW4S275QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I67IUQFRPPIIL4UHIBW4S275QA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I67IUQFRPPIIL4UHIBW4S275QA","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":"418c2a5162771690567d826cf43bb12637e13669f404add7d0fb50e57cc4930e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-20T06:10:35Z","title_canon_sha256":"3e10daac13a25317521667d93dac453a96f8cde94b0aaf0a7f4bf09a4c08683e"},"schema_version":"1.0","source":{"id":"1405.4960","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4960","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4960v3","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4960","created_at":"2026-05-18T01:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"I67IUQFRPPII","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I67IUQFRPPIIL4UH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I67IUQFR","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:056cd6b20556621f419e06d8615ddb80f1e7204096b96c8f27bd00bdc72958fe","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":"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","authors_text":"Hiroshi Hirai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-20T06:10:35Z","title":"Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4960","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:2c543a9dd37688911897febc11a82ed1458578c76bdc86f1d62cbe374762f84b","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":"418c2a5162771690567d826cf43bb12637e13669f404add7d0fb50e57cc4930e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-20T06:10:35Z","title_canon_sha256":"3e10daac13a25317521667d93dac453a96f8cde94b0aaf0a7f4bf09a4c08683e"},"schema_version":"1.0","source":{"id":"1405.4960","kind":"arxiv","version":3}},"canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47be8a40b17bd085f287406dc96bfd80004a9e002b8a4be01d226c0c4bdbaa16","first_computed_at":"2026-05-18T01:22:48.910658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:48.910658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsAcnK50XKFuEY9iGQaHsBN5wB4ZqkGOcW2madmJGuBYSv3S3OgXl6qHYFrpQctjJKBxTOg2+2cgZvClcSUtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:48.911231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4960","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c543a9dd37688911897febc11a82ed1458578c76bdc86f1d62cbe374762f84b","sha256:056cd6b20556621f419e06d8615ddb80f1e7204096b96c8f27bd00bdc72958fe"],"state_sha256":"c8855f4693bb3844f4a481042d1925b09253fce54c796c6e9023074216a834a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8l6hLoWd7pd9ygR/FVQ4OtwR8fDgce9vJH39U3p3iGNvvgam0mkB1qtNgrWoGhI4WsWOrNRAK1Oaf+fiXNdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:29:21.324206Z","bundle_sha256":"1392641f42e6e2808f96100719148d981c7a16b2d7cc6a28a2c6e00deea70b1d"}}