{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CSCTXWDLKPQ5AXSC6XOYNUC3IC","short_pith_number":"pith:CSCTXWDL","canonical_record":{"source":{"id":"1212.3471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T13:52:42Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"bd3bf65cf0036d2a28f5bf8141223cea1188ed2b6d2466933ffcc0aec70bc2fd","abstract_canon_sha256":"80cc4e5f5b29ebfbb2f0984b187567d602fe45af2f9b6caef2976bd7f0be404f"},"schema_version":"1.0"},"canonical_sha256":"14853bd86b53e1d05e42f5dd86d05b409decad0df83a0d128519241c8a6048a1","source":{"kind":"arxiv","id":"1212.3471","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3471","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3471v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3471","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"CSCTXWDLKPQ5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CSCTXWDLKPQ5AXSC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CSCTXWDL","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CSCTXWDLKPQ5AXSC6XOYNUC3IC","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3471","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T13:52:42Z","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"title_canon_sha256":"bd3bf65cf0036d2a28f5bf8141223cea1188ed2b6d2466933ffcc0aec70bc2fd","abstract_canon_sha256":"80cc4e5f5b29ebfbb2f0984b187567d602fe45af2f9b6caef2976bd7f0be404f"},"schema_version":"1.0"},"canonical_sha256":"14853bd86b53e1d05e42f5dd86d05b409decad0df83a0d128519241c8a6048a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:24.526961Z","signature_b64":"HUHPyDwaoTJlCyU6QF1CXjxqsO3rKnBI9YsU2TSAj/JQYY6WTP7wVw9IzZ2gvsq200Oh7ycaFebYaxh1cepjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14853bd86b53e1d05e42f5dd86d05b409decad0df83a0d128519241c8a6048a1","last_reissued_at":"2026-05-18T03:38:24.526203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:24.526203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3471","source_version":1,"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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4QRgh+BiNjyj5o5TUFXh4F4/mBiEODqaZeyajyz7nmSenWMGaovewPkS3aeJPoQZLkYoudC4/chEncOS0MpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:45:23.370441Z"},"content_sha256":"e2331ebea79b0bc0758f588edfab238c3e7ac6fbba372591375802ea244a3103","schema_version":"1.0","event_id":"sha256:e2331ebea79b0bc0758f588edfab238c3e7ac6fbba372591375802ea244a3103"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CSCTXWDLKPQ5AXSC6XOYNUC3IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Cuts and Partitions in Tree Metrics in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Andrzej Lingas, Dzmitry Sledneu, Marek Karpinski","submitted_at":"2012-12-14T13:52:42Z","abstract_excerpt":"We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We discuss also an extension of our method to the class of metrics induced by the bounded treewidth graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3471","kind":"arxiv","version":1},"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-18T03:38:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLzP+U9EqTius5cY1rEIqLYxN6bb0vcPNXndZATozF+lGSQbNsGbKIcEAWoSU5GhnfN6CMjfrLjT94RBIXiuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:45:23.371169Z"},"content_sha256":"653332f0b2abed3a03444e5d5b29bf17998ed277d213337432a54c8c4a91d920","schema_version":"1.0","event_id":"sha256:653332f0b2abed3a03444e5d5b29bf17998ed277d213337432a54c8c4a91d920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/bundle.json","state_url":"https://pith.science/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/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-28T21:45:23Z","links":{"resolver":"https://pith.science/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC","bundle":"https://pith.science/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/bundle.json","state":"https://pith.science/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSCTXWDLKPQ5AXSC6XOYNUC3IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CSCTXWDLKPQ5AXSC6XOYNUC3IC","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":"80cc4e5f5b29ebfbb2f0984b187567d602fe45af2f9b6caef2976bd7f0be404f","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T13:52:42Z","title_canon_sha256":"bd3bf65cf0036d2a28f5bf8141223cea1188ed2b6d2466933ffcc0aec70bc2fd"},"schema_version":"1.0","source":{"id":"1212.3471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3471","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3471v1","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3471","created_at":"2026-05-18T03:38:24Z"},{"alias_kind":"pith_short_12","alias_value":"CSCTXWDLKPQ5","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CSCTXWDLKPQ5AXSC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CSCTXWDL","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:653332f0b2abed3a03444e5d5b29bf17998ed277d213337432a54c8c4a91d920","target":"graph","created_at":"2026-05-18T03:38:24Z","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":"We present a polynomial time dynamic programming algorithm for optimal partitions in the shortest path metric induced by a tree. This resolves, among other things, the exact complexity status of the optimal partition problems in one dimensional geometric metric settings. Our method of solution could be also of independent interest in other applications. We discuss also an extension of our method to the class of metrics induced by the bounded treewidth graphs.","authors_text":"Andrzej Lingas, Dzmitry Sledneu, Marek Karpinski","cross_cats":["cs.CC","cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T13:52:42Z","title":"Optimal Cuts and Partitions in Tree Metrics in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3471","kind":"arxiv","version":1},"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:e2331ebea79b0bc0758f588edfab238c3e7ac6fbba372591375802ea244a3103","target":"record","created_at":"2026-05-18T03:38:24Z","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":"80cc4e5f5b29ebfbb2f0984b187567d602fe45af2f9b6caef2976bd7f0be404f","cross_cats_sorted":["cs.CC","cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T13:52:42Z","title_canon_sha256":"bd3bf65cf0036d2a28f5bf8141223cea1188ed2b6d2466933ffcc0aec70bc2fd"},"schema_version":"1.0","source":{"id":"1212.3471","kind":"arxiv","version":1}},"canonical_sha256":"14853bd86b53e1d05e42f5dd86d05b409decad0df83a0d128519241c8a6048a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14853bd86b53e1d05e42f5dd86d05b409decad0df83a0d128519241c8a6048a1","first_computed_at":"2026-05-18T03:38:24.526203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:24.526203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HUHPyDwaoTJlCyU6QF1CXjxqsO3rKnBI9YsU2TSAj/JQYY6WTP7wVw9IzZ2gvsq200Oh7ycaFebYaxh1cepjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:24.526961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2331ebea79b0bc0758f588edfab238c3e7ac6fbba372591375802ea244a3103","sha256:653332f0b2abed3a03444e5d5b29bf17998ed277d213337432a54c8c4a91d920"],"state_sha256":"b8e6aaa56c168bbfaa901c12b4ae5e23d4d7bbac0bfbce9b8f89d023668249f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GrLkogvrQKQh56DsWfk6y9yynSGhbwG+m8GHfMzT9bRi9iAwgoWn2hc7oqaPakAndwVX+hvWd/t/o7x9kEvaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:45:23.375362Z","bundle_sha256":"f61913e24115ab40ed8c71d50c125df596e73136ee05f45f6964dcb5070475ec"}}