{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5RKS4BL6BMTLSSWPY6EHSWBGW3","short_pith_number":"pith:5RKS4BL6","schema_version":"1.0","canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","source":{"kind":"arxiv","id":"1612.02642","version":1},"attestation_state":"computed","paper":{"title":"Center, centroid and subtree core of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dheer Noal Sunil Desai, Kamal Lochan Patra","submitted_at":"2016-12-08T13:45:54Z","abstract_excerpt":"For $n\\geq 5$ and $2\\leq g\\leq n-3,$ consider the tree $P_{n-g,g}$ on $n$ vertices which is obtained by adding $g$ pendant vertices to one degree $1$ vertex of the path $P_{n-g}$. We call the trees $P_{n-g,g}$ as path-star trees. We prove that over all trees on $n\\geq 5$ vertices, the distance between center and subtree core and the distance between centroid and subtree core are maximized by some path-star trees. We also prove that the tree $P_{n-g_0,g_0}$ maximizes both the distances among all path-star trees on $n$ vertices, where $g_0$ is the smallest positive integer such that $2^{g_0}+g_0"},"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":"1612.02642","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-08T13:45:54Z","cross_cats_sorted":[],"title_canon_sha256":"855592006d269ec79360b78f9dd51e43023f80aa442de1dab342c35d7d228e20","abstract_canon_sha256":"229ef7f767a882264c35463cfe0d53b7fe18a8439d13491e30151e5745ff5235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:33.194493Z","signature_b64":"cAgqeF7lcMIHkDlJWpFE4HjwZtYPGKPIQrf9ajD+19lPVFQHl2ZBhDkgthoRRckqAVETJ8q28iPfQ88u6sDNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","last_reissued_at":"2026-05-18T00:55:33.193989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:33.193989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Center, centroid and subtree core of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dheer Noal Sunil Desai, Kamal Lochan Patra","submitted_at":"2016-12-08T13:45:54Z","abstract_excerpt":"For $n\\geq 5$ and $2\\leq g\\leq n-3,$ consider the tree $P_{n-g,g}$ on $n$ vertices which is obtained by adding $g$ pendant vertices to one degree $1$ vertex of the path $P_{n-g}$. We call the trees $P_{n-g,g}$ as path-star trees. We prove that over all trees on $n\\geq 5$ vertices, the distance between center and subtree core and the distance between centroid and subtree core are maximized by some path-star trees. We also prove that the tree $P_{n-g_0,g_0}$ maximizes both the distances among all path-star trees on $n$ vertices, where $g_0$ is the smallest positive integer such that $2^{g_0}+g_0"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02642","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":"1612.02642","created_at":"2026-05-18T00:55:33.194078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02642v1","created_at":"2026-05-18T00:55:33.194078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02642","created_at":"2026-05-18T00:55:33.194078+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RKS4BL6BMTL","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RKS4BL6BMTLSSWP","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RKS4BL6","created_at":"2026-05-18T12:30:01.593930+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/5RKS4BL6BMTLSSWPY6EHSWBGW3","json":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3.json","graph_json":"https://pith.science/api/pith-number/5RKS4BL6BMTLSSWPY6EHSWBGW3/graph.json","events_json":"https://pith.science/api/pith-number/5RKS4BL6BMTLSSWPY6EHSWBGW3/events.json","paper":"https://pith.science/paper/5RKS4BL6"},"agent_actions":{"view_html":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3","download_json":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3.json","view_paper":"https://pith.science/paper/5RKS4BL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02642&json=true","fetch_graph":"https://pith.science/api/pith-number/5RKS4BL6BMTLSSWPY6EHSWBGW3/graph.json","fetch_events":"https://pith.science/api/pith-number/5RKS4BL6BMTLSSWPY6EHSWBGW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/action/storage_attestation","attest_author":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/action/author_attestation","sign_citation":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/action/citation_signature","submit_replication":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/action/replication_record"}},"created_at":"2026-05-18T00:55:33.194078+00:00","updated_at":"2026-05-18T00:55:33.194078+00:00"}