{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SOVUUBKMD5EHPHJTZFE5E65H75","short_pith_number":"pith:SOVUUBKM","canonical_record":{"source":{"id":"1907.08304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T21:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"5a51a69016c9ef5ebb6cb8d637db3a8316a9c41895412fbba21c77e583daa96c","abstract_canon_sha256":"4364acfe8aa8042db2dd69661fdf1d357cec9763392783f3abc9be253bc7fa3d"},"schema_version":"1.0"},"canonical_sha256":"93ab4a054c1f48779d33c949d27ba7ff7feca7f1fda14c7916bfd336ce6cd2ef","source":{"kind":"arxiv","id":"1907.08304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08304","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08304v2","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08304","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"SOVUUBKMD5EH","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_16","alias_value":"SOVUUBKMD5EHPHJT","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_8","alias_value":"SOVUUBKM","created_at":"2026-07-05T00:25:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SOVUUBKMD5EHPHJTZFE5E65H75","target":"record","payload":{"canonical_record":{"source":{"id":"1907.08304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T21:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"5a51a69016c9ef5ebb6cb8d637db3a8316a9c41895412fbba21c77e583daa96c","abstract_canon_sha256":"4364acfe8aa8042db2dd69661fdf1d357cec9763392783f3abc9be253bc7fa3d"},"schema_version":"1.0"},"canonical_sha256":"93ab4a054c1f48779d33c949d27ba7ff7feca7f1fda14c7916bfd336ce6cd2ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:39.061708Z","signature_b64":"cKcbI0S0U5ni9jHu852S/XS3CHhxZlF10qZGDkxdgHwpbQSFh87oGasmjBNbvd+BXIbQ10canhhwP/GTBRBWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93ab4a054c1f48779d33c949d27ba7ff7feca7f1fda14c7916bfd336ce6cd2ef","last_reissued_at":"2026-07-05T00:25:39.061219Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:39.061219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.08304","source_version":2,"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-07-05T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zgoCfpnCvM/mO+szyo1YzIqWGvgt1R6kNcCiHte+fql/CZjDEDMU5Xn33NLXj4KMh8I6sgFkD2U/w0ogggjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:35:21.943514Z"},"content_sha256":"a074da46742936c4a1d470861ec8e6ad6042d4cc44f8fc542ef5e284e4016260","schema_version":"1.0","event_id":"sha256:a074da46742936c4a1d470861ec8e6ad6042d4cc44f8fc542ef5e284e4016260"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SOVUUBKMD5EHPHJTZFE5E65H75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constant Factor Approximation for Capacitated Min-Max Tree Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lavina Jain, Nikhil Kumar, Syamantak Das","submitted_at":"2019-07-18T21:59:33Z","abstract_excerpt":"Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The objective is to minimize the maximum length among all the trees. We give the first constant factor approximation for the hard uniform capacitated version of this problem, where, an input parameter $\\lambda$ upper bounds the number of vertices that can be covered by any of the trees. Our result extends to the rooted version of the problem, where we are given a set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08304","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.08304/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:25:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ab1F66Y2ZiLH5dm/YteCIY94n+7AFafSalT2inlwoPfIHxLu/OWV8c8Xt/FatMUbT3fAn39zVTj328JkLuwSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:35:21.944080Z"},"content_sha256":"5607b493260f2a257f5a9c274b21de92e386514fe68923f7020083caf43ff590","schema_version":"1.0","event_id":"sha256:5607b493260f2a257f5a9c274b21de92e386514fe68923f7020083caf43ff590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOVUUBKMD5EHPHJTZFE5E65H75/bundle.json","state_url":"https://pith.science/pith/SOVUUBKMD5EHPHJTZFE5E65H75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOVUUBKMD5EHPHJTZFE5E65H75/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-08-03T15:35:21Z","links":{"resolver":"https://pith.science/pith/SOVUUBKMD5EHPHJTZFE5E65H75","bundle":"https://pith.science/pith/SOVUUBKMD5EHPHJTZFE5E65H75/bundle.json","state":"https://pith.science/pith/SOVUUBKMD5EHPHJTZFE5E65H75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOVUUBKMD5EHPHJTZFE5E65H75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SOVUUBKMD5EHPHJTZFE5E65H75","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":"4364acfe8aa8042db2dd69661fdf1d357cec9763392783f3abc9be253bc7fa3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T21:59:33Z","title_canon_sha256":"5a51a69016c9ef5ebb6cb8d637db3a8316a9c41895412fbba21c77e583daa96c"},"schema_version":"1.0","source":{"id":"1907.08304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08304","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08304v2","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08304","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"SOVUUBKMD5EH","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_16","alias_value":"SOVUUBKMD5EHPHJT","created_at":"2026-07-05T00:25:39Z"},{"alias_kind":"pith_short_8","alias_value":"SOVUUBKM","created_at":"2026-07-05T00:25:39Z"}],"graph_snapshots":[{"event_id":"sha256:5607b493260f2a257f5a9c274b21de92e386514fe68923f7020083caf43ff590","target":"graph","created_at":"2026-07-05T00:25:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.08304/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G=(V,E)$ with non-negative real edge lengths and an integer parameter $k$, the Min-Max k-Tree Cover problem seeks to find a set of at most $k$ subtrees of $G$, such that the union of the trees is the vertex set $V$. The objective is to minimize the maximum length among all the trees. We give the first constant factor approximation for the hard uniform capacitated version of this problem, where, an input parameter $\\lambda$ upper bounds the number of vertices that can be covered by any of the trees. Our result extends to the rooted version of the problem, where we are given a set","authors_text":"Lavina Jain, Nikhil Kumar, Syamantak Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T21:59:33Z","title":"A Constant Factor Approximation for Capacitated Min-Max Tree Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08304","kind":"arxiv","version":2},"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:a074da46742936c4a1d470861ec8e6ad6042d4cc44f8fc542ef5e284e4016260","target":"record","created_at":"2026-07-05T00:25:39Z","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":"4364acfe8aa8042db2dd69661fdf1d357cec9763392783f3abc9be253bc7fa3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-18T21:59:33Z","title_canon_sha256":"5a51a69016c9ef5ebb6cb8d637db3a8316a9c41895412fbba21c77e583daa96c"},"schema_version":"1.0","source":{"id":"1907.08304","kind":"arxiv","version":2}},"canonical_sha256":"93ab4a054c1f48779d33c949d27ba7ff7feca7f1fda14c7916bfd336ce6cd2ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93ab4a054c1f48779d33c949d27ba7ff7feca7f1fda14c7916bfd336ce6cd2ef","first_computed_at":"2026-07-05T00:25:39.061219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:25:39.061219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cKcbI0S0U5ni9jHu852S/XS3CHhxZlF10qZGDkxdgHwpbQSFh87oGasmjBNbvd+BXIbQ10canhhwP/GTBRBWBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:25:39.061708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a074da46742936c4a1d470861ec8e6ad6042d4cc44f8fc542ef5e284e4016260","sha256:5607b493260f2a257f5a9c274b21de92e386514fe68923f7020083caf43ff590"],"state_sha256":"ce239cee2a78f373b87dcf1e057a5042d89c1f0338fd866c31bc870213005ba4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9m+OmvsLInnvYHbFmLWDD9v/nhBxCXueaI0kXAUbdHuc8wYQMCh94KGqgvm4/Kd+Re0Rnyue/qjhaehwCpOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:35:21.950242Z","bundle_sha256":"b1cb88c416dcf96da3d9e165fb42a177232d9efb0d2c4bb67e05aa6809cca5dc"}}