{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JR4TKSAUXAVMTZ46QQEU65Y3GA","short_pith_number":"pith:JR4TKSAU","schema_version":"1.0","canonical_sha256":"4c79354814b82ac9e79e84094f771b30058f63c095bd55fc584369ccdc8bc3bc","source":{"kind":"arxiv","id":"1307.6939","version":1},"attestation_state":"computed","paper":{"title":"Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Shokoufandeh, B\\'ela Csaba, Thomas A. Plick","submitted_at":"2013-07-26T07:19:33Z","abstract_excerpt":"We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\\it monochromatic} and {\\it bichromatic} versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic problems."},"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":"1307.6939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-07-26T07:19:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"175b68675929e147a15c2dbb57361dca7c76368b6e9dc58c64a89e451211c37c","abstract_canon_sha256":"2f5cc3f518c731ac3f1ccd311979cadf6092bb9699af220d50d46380ccacd07e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:25.795598Z","signature_b64":"eEaiyc7PtXjVsZwBfZ4a1iSF1IYFbAOMxwOrorz0Fn2LfAYM/fb3Y+7j6mT1YUVyKLRFwhGf7sD72+12WZuKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c79354814b82ac9e79e84094f771b30058f63c095bd55fc584369ccdc8bc3bc","last_reissued_at":"2026-05-18T03:17:25.794673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:25.794673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ali Shokoufandeh, B\\'ela Csaba, Thomas A. Plick","submitted_at":"2013-07-26T07:19:33Z","abstract_excerpt":"We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\\it monochromatic} and {\\it bichromatic} versions of the minimum matching, minimum spanning tree, and traveling salesman problems. We also present tight concentration results for the monochromatic problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6939","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6939","created_at":"2026-05-18T03:17:25.794835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6939v1","created_at":"2026-05-18T03:17:25.794835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6939","created_at":"2026-05-18T03:17:25.794835+00:00"},{"alias_kind":"pith_short_12","alias_value":"JR4TKSAUXAVM","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JR4TKSAUXAVMTZ46","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JR4TKSAU","created_at":"2026-05-18T12:27:49.015174+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/JR4TKSAUXAVMTZ46QQEU65Y3GA","json":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA.json","graph_json":"https://pith.science/api/pith-number/JR4TKSAUXAVMTZ46QQEU65Y3GA/graph.json","events_json":"https://pith.science/api/pith-number/JR4TKSAUXAVMTZ46QQEU65Y3GA/events.json","paper":"https://pith.science/paper/JR4TKSAU"},"agent_actions":{"view_html":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA","download_json":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA.json","view_paper":"https://pith.science/paper/JR4TKSAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6939&json=true","fetch_graph":"https://pith.science/api/pith-number/JR4TKSAUXAVMTZ46QQEU65Y3GA/graph.json","fetch_events":"https://pith.science/api/pith-number/JR4TKSAUXAVMTZ46QQEU65Y3GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA/action/storage_attestation","attest_author":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA/action/author_attestation","sign_citation":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA/action/citation_signature","submit_replication":"https://pith.science/pith/JR4TKSAUXAVMTZ46QQEU65Y3GA/action/replication_record"}},"created_at":"2026-05-18T03:17:25.794835+00:00","updated_at":"2026-05-18T03:17:25.794835+00:00"}