{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1994:CJHUR7V66RIDASDIVVEFU5N57C","short_pith_number":"pith:CJHUR7V6","canonical_record":{"source":{"id":"math/9409222","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"3e029a61a5c63c08bb91a80c4255ce2e68e2b58a9dabd8ba313bbaf2804a5888","abstract_canon_sha256":"d3da650c6476e4141bef89b2ffe9faa2982ac236c257fa19ea62a050a694ed92"},"schema_version":"1.0"},"canonical_sha256":"124f48febef450304868ad485a75bdf8a80faaf5d991ee3e6d9c90964040833f","source":{"kind":"arxiv","id":"math/9409222","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409222","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409222v1","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409222","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJHUR7V66RID","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_16","alias_value":"CJHUR7V66RIDASDI","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_8","alias_value":"CJHUR7V6","created_at":"2026-07-04T15:50:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1994:CJHUR7V66RIDASDIVVEFU5N57C","target":"record","payload":{"canonical_record":{"source":{"id":"math/9409222","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"3e029a61a5c63c08bb91a80c4255ce2e68e2b58a9dabd8ba313bbaf2804a5888","abstract_canon_sha256":"d3da650c6476e4141bef89b2ffe9faa2982ac236c257fa19ea62a050a694ed92"},"schema_version":"1.0"},"canonical_sha256":"124f48febef450304868ad485a75bdf8a80faaf5d991ee3e6d9c90964040833f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:50:55.620782Z","signature_b64":"d6nzMlsVW9bRRrNWtrJ3T3hgEM7b0A8bn/xfGtA6ZfEMdLV91TVNLd3j6AnY3DH2MRz4BJ+f3Ljq6vWG1SEJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"124f48febef450304868ad485a75bdf8a80faaf5d991ee3e6d9c90964040833f","last_reissued_at":"2026-07-04T15:50:55.620388Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:50:55.620388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/9409222","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-07-04T15:50:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vsVWIC3HJzmK/mwmypOzNqvHv1lvDBFrgVZVmaBoL0p6kukLQl1x/VNZXHQZyrE/p12WBy7wvf/csuxANQ4PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:03:27.147688Z"},"content_sha256":"9645024476c79cba175eaa3dc797d14c817bc83e9626b563baf4350c5059f167","schema_version":"1.0","event_id":"sha256:9645024476c79cba175eaa3dc797d14c817bc83e9626b563baf4350c5059f167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1994:CJHUR7V66RIDASDIVVEFU5N57C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning trees short or small","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel J. Rosenkrantz, Madhav V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi","submitted_at":"1994-09-21T00:00:00Z","abstract_excerpt":"We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted graph. We show that the $k$MST problem is NP-hard even for points in the Euclidean plane. We provide approximation algorithms with performance ratio $2\\sqrt{k}$ for the general edge-weighted case and $O(k^{1/4})$ for the case of points in the plane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409222","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/9409222/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-04T15:50:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NTLYFx8q94fDqpfhrNtpWbcEgZRjZIEKjll0+/T0dCzHtoc1FSDuSc4t/Jq6NNjazVbTWlByDvubPQMlyPxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:03:27.148434Z"},"content_sha256":"e4beaa6243ec528a3f186f0dc1617abbac180abdc77fe9e9ad3d67e6aa637d57","schema_version":"1.0","event_id":"sha256:e4beaa6243ec528a3f186f0dc1617abbac180abdc77fe9e9ad3d67e6aa637d57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJHUR7V66RIDASDIVVEFU5N57C/bundle.json","state_url":"https://pith.science/pith/CJHUR7V66RIDASDIVVEFU5N57C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJHUR7V66RIDASDIVVEFU5N57C/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-07T01:03:27Z","links":{"resolver":"https://pith.science/pith/CJHUR7V66RIDASDIVVEFU5N57C","bundle":"https://pith.science/pith/CJHUR7V66RIDASDIVVEFU5N57C/bundle.json","state":"https://pith.science/pith/CJHUR7V66RIDASDIVVEFU5N57C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJHUR7V66RIDASDIVVEFU5N57C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:CJHUR7V66RIDASDIVVEFU5N57C","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":"d3da650c6476e4141bef89b2ffe9faa2982ac236c257fa19ea62a050a694ed92","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"3e029a61a5c63c08bb91a80c4255ce2e68e2b58a9dabd8ba313bbaf2804a5888"},"schema_version":"1.0","source":{"id":"math/9409222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409222","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409222v1","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409222","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_12","alias_value":"CJHUR7V66RID","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_16","alias_value":"CJHUR7V66RIDASDI","created_at":"2026-07-04T15:50:55Z"},{"alias_kind":"pith_short_8","alias_value":"CJHUR7V6","created_at":"2026-07-04T15:50:55Z"}],"graph_snapshots":[{"event_id":"sha256:e4beaa6243ec528a3f186f0dc1617abbac180abdc77fe9e9ad3d67e6aa637d57","target":"graph","created_at":"2026-07-04T15:50:55Z","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/math/9409222/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted graph. We show that the $k$MST problem is NP-hard even for points in the Euclidean plane. We provide approximation algorithms with performance ratio $2\\sqrt{k}$ for the general edge-weighted case and $O(k^{1/4})$ for the case of points in the plane.","authors_text":"Daniel J. Rosenkrantz, Madhav V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title":"Spanning trees short or small"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409222","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:9645024476c79cba175eaa3dc797d14c817bc83e9626b563baf4350c5059f167","target":"record","created_at":"2026-07-04T15:50:55Z","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":"d3da650c6476e4141bef89b2ffe9faa2982ac236c257fa19ea62a050a694ed92","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"3e029a61a5c63c08bb91a80c4255ce2e68e2b58a9dabd8ba313bbaf2804a5888"},"schema_version":"1.0","source":{"id":"math/9409222","kind":"arxiv","version":1}},"canonical_sha256":"124f48febef450304868ad485a75bdf8a80faaf5d991ee3e6d9c90964040833f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"124f48febef450304868ad485a75bdf8a80faaf5d991ee3e6d9c90964040833f","first_computed_at":"2026-07-04T15:50:55.620388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:50:55.620388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d6nzMlsVW9bRRrNWtrJ3T3hgEM7b0A8bn/xfGtA6ZfEMdLV91TVNLd3j6AnY3DH2MRz4BJ+f3Ljq6vWG1SEJBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:50:55.620782Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9409222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9645024476c79cba175eaa3dc797d14c817bc83e9626b563baf4350c5059f167","sha256:e4beaa6243ec528a3f186f0dc1617abbac180abdc77fe9e9ad3d67e6aa637d57"],"state_sha256":"154031794474f89435690d82c55cc44f20291ae7d7c8bdad81e4ada9289fc819"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"st99RduQtXA/B5EE6vPKw/fKnPhC9fsdagVX4V6qMa/rsajY8G9hdAG9QUkD7x6BLLhFqYa1FLhGryll08zmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:03:27.155904Z","bundle_sha256":"5a99d3188ea41d70b9ddc6fae59fcea205adee728b34e35aff0745f2cdae6887"}}