{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QZK6UCCWGWBV64Y6UY4PAHMECB","short_pith_number":"pith:QZK6UCCW","canonical_record":{"source":{"id":"1701.05215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T19:38:44Z","cross_cats_sorted":[],"title_canon_sha256":"45968c7935c4d9b859d2b918f48d35f241ecaa6cb51cd95edf5c2ff2fb562e5e","abstract_canon_sha256":"3dcf495de30c5552a55f5f04b7feccb4f558b0f8c1f91e2368ffa52f13af59e2"},"schema_version":"1.0"},"canonical_sha256":"8655ea085635835f731ea638f01d841052b761d35620265d855db3b89c17e76d","source":{"kind":"arxiv","id":"1701.05215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05215","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05215v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05215","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"QZK6UCCWGWBV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZK6UCCWGWBV64Y6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZK6UCCW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QZK6UCCWGWBV64Y6UY4PAHMECB","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T19:38:44Z","cross_cats_sorted":[],"title_canon_sha256":"45968c7935c4d9b859d2b918f48d35f241ecaa6cb51cd95edf5c2ff2fb562e5e","abstract_canon_sha256":"3dcf495de30c5552a55f5f04b7feccb4f558b0f8c1f91e2368ffa52f13af59e2"},"schema_version":"1.0"},"canonical_sha256":"8655ea085635835f731ea638f01d841052b761d35620265d855db3b89c17e76d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:30.506415Z","signature_b64":"RRYIwZsAkJwJYQdEKsOof+LlcbkgAeM7JR8a8uIvHFD+M3Ex9PNENMbVb9qxhdvFh/6yBnYjUyd+5eXp+ujzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8655ea085635835f731ea638f01d841052b761d35620265d855db3b89c17e76d","last_reissued_at":"2026-05-18T00:52:30.505898Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:30.505898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05215","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"629EboKA9EkQitm+QubiQKyRqPtDtdqVI2wornP1TEQ0xEIDAirghbVpfVfY1g/K9IlU+ZISFQIZApyheQFkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:20:26.159690Z"},"content_sha256":"19da07438c287745a874afc9213520a2375989dd4899088b35e66f11bdc7cc25","schema_version":"1.0","event_id":"sha256:19da07438c287745a874afc9213520a2375989dd4899088b35e66f11bdc7cc25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QZK6UCCWGWBV64Y6UY4PAHMECB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On different \"middle parts\" of a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heather Smith, Hua Wang, L\\'aszl\\'o Sz\\'ekely, Shuai Yuan","submitted_at":"2017-01-18T19:38:44Z","abstract_excerpt":"We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The problem of the maximum distance between the centroid and the subtree core among trees with given order and diameter becomes difficult. It can be solved in terms of the problem of minimizing the number of root-containing subtrees in a rooted tree of given order and height. While the latter problem remains unsolved, we provide a partial characterization of the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05215","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-18T00:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bP53KOOcFAQxc3iDk2j8gJgCRlQ3OMCrk5DPRYd37A8oPKynj6IKfzujZFNHUdf4fsoMqxYJYGXPJv3YYLdmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:20:26.160057Z"},"content_sha256":"8ca15feba23d62b2675671a3b1729d0bf126ea663dc309fa0ce7fe0cc553b672","schema_version":"1.0","event_id":"sha256:8ca15feba23d62b2675671a3b1729d0bf126ea663dc309fa0ce7fe0cc553b672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/bundle.json","state_url":"https://pith.science/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/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-06-04T23:20:26Z","links":{"resolver":"https://pith.science/pith/QZK6UCCWGWBV64Y6UY4PAHMECB","bundle":"https://pith.science/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/bundle.json","state":"https://pith.science/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZK6UCCWGWBV64Y6UY4PAHMECB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QZK6UCCWGWBV64Y6UY4PAHMECB","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":"3dcf495de30c5552a55f5f04b7feccb4f558b0f8c1f91e2368ffa52f13af59e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T19:38:44Z","title_canon_sha256":"45968c7935c4d9b859d2b918f48d35f241ecaa6cb51cd95edf5c2ff2fb562e5e"},"schema_version":"1.0","source":{"id":"1701.05215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05215","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05215v1","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05215","created_at":"2026-05-18T00:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"QZK6UCCWGWBV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZK6UCCWGWBV64Y6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZK6UCCW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:8ca15feba23d62b2675671a3b1729d0bf126ea663dc309fa0ce7fe0cc553b672","target":"graph","created_at":"2026-05-18T00:52:30Z","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 determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The problem of the maximum distance between the centroid and the subtree core among trees with given order and diameter becomes difficult. It can be solved in terms of the problem of minimizing the number of root-containing subtrees in a rooted tree of given order and height. While the latter problem remains unsolved, we provide a partial characterization of the ","authors_text":"Heather Smith, Hua Wang, L\\'aszl\\'o Sz\\'ekely, Shuai Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T19:38:44Z","title":"On different \"middle parts\" of a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05215","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:19da07438c287745a874afc9213520a2375989dd4899088b35e66f11bdc7cc25","target":"record","created_at":"2026-05-18T00:52:30Z","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":"3dcf495de30c5552a55f5f04b7feccb4f558b0f8c1f91e2368ffa52f13af59e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-18T19:38:44Z","title_canon_sha256":"45968c7935c4d9b859d2b918f48d35f241ecaa6cb51cd95edf5c2ff2fb562e5e"},"schema_version":"1.0","source":{"id":"1701.05215","kind":"arxiv","version":1}},"canonical_sha256":"8655ea085635835f731ea638f01d841052b761d35620265d855db3b89c17e76d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8655ea085635835f731ea638f01d841052b761d35620265d855db3b89c17e76d","first_computed_at":"2026-05-18T00:52:30.505898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:30.505898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RRYIwZsAkJwJYQdEKsOof+LlcbkgAeM7JR8a8uIvHFD+M3Ex9PNENMbVb9qxhdvFh/6yBnYjUyd+5eXp+ujzAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:30.506415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19da07438c287745a874afc9213520a2375989dd4899088b35e66f11bdc7cc25","sha256:8ca15feba23d62b2675671a3b1729d0bf126ea663dc309fa0ce7fe0cc553b672"],"state_sha256":"bf34aac794d71f70db411d98a3f910465891518cc25549dc3e6c6a840ce348c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZu8YLUccLmJxRs63/FPiIGmf83nvBteOu0ZWviT3w/acyTGaQsBgXgQOzKcXLS/QbmNlk22OcsYZMF2XDwDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:20:26.163390Z","bundle_sha256":"1702886454321113e067c5782b3aa00d66e2ca662f6bc1e12b3c4ec05d830570"}}