{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5RKS4BL6BMTLSSWPY6EHSWBGW3","short_pith_number":"pith:5RKS4BL6","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"},"canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","source":{"kind":"arxiv","id":"1612.02642","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02642","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02642v1","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02642","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"5RKS4BL6BMTL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5RKS4BL6BMTLSSWP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5RKS4BL6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5RKS4BL6BMTLSSWPY6EHSWBGW3","target":"record","payload":{"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"},"canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","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"},"source_kind":"arxiv","source_id":"1612.02642","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:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MM/igZ/GyszgqimFDE/ezebHKZfagg0cNe18HWLI6T63Wr7fpp4OmiPmLvFBFwefS/F+55LLXTzxkGWwD2ukBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:24:02.868711Z"},"content_sha256":"b88cfefcede1ea9c7c092e9ef73aaab835a039c7ebf691094497443235c9a5dd","schema_version":"1.0","event_id":"sha256:b88cfefcede1ea9c7c092e9ef73aaab835a039c7ebf691094497443235c9a5dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5RKS4BL6BMTLSSWPY6EHSWBGW3","target":"graph","payload":{"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"},"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:55:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYXxt5Pzjc4T/0flRCtONgEJ+hyyQ1b5sRU9hv3vPBCzaylRzyPcXuFuHPn2sGrM15VGfbYyTLd8ZD3ssscnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:24:02.869062Z"},"content_sha256":"2fc8475724d44baf1fe547183b2ac68fff663204edbe6cb8aef2510b1cc2a10c","schema_version":"1.0","event_id":"sha256:2fc8475724d44baf1fe547183b2ac68fff663204edbe6cb8aef2510b1cc2a10c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/bundle.json","state_url":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/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-24T01:24:02Z","links":{"resolver":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3","bundle":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/bundle.json","state":"https://pith.science/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RKS4BL6BMTLSSWPY6EHSWBGW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5RKS4BL6BMTLSSWPY6EHSWBGW3","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":"229ef7f767a882264c35463cfe0d53b7fe18a8439d13491e30151e5745ff5235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-08T13:45:54Z","title_canon_sha256":"855592006d269ec79360b78f9dd51e43023f80aa442de1dab342c35d7d228e20"},"schema_version":"1.0","source":{"id":"1612.02642","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02642","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02642v1","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02642","created_at":"2026-05-18T00:55:33Z"},{"alias_kind":"pith_short_12","alias_value":"5RKS4BL6BMTL","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5RKS4BL6BMTLSSWP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5RKS4BL6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2fc8475724d44baf1fe547183b2ac68fff663204edbe6cb8aef2510b1cc2a10c","target":"graph","created_at":"2026-05-18T00:55:33Z","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":"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","authors_text":"Dheer Noal Sunil Desai, Kamal Lochan Patra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-08T13:45:54Z","title":"Center, centroid and subtree core of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02642","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:b88cfefcede1ea9c7c092e9ef73aaab835a039c7ebf691094497443235c9a5dd","target":"record","created_at":"2026-05-18T00:55:33Z","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":"229ef7f767a882264c35463cfe0d53b7fe18a8439d13491e30151e5745ff5235","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-08T13:45:54Z","title_canon_sha256":"855592006d269ec79360b78f9dd51e43023f80aa442de1dab342c35d7d228e20"},"schema_version":"1.0","source":{"id":"1612.02642","kind":"arxiv","version":1}},"canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec552e057e0b26b94acfc788795826b6e68aa5b375df91adf5589201171bff1b","first_computed_at":"2026-05-18T00:55:33.193989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:33.193989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAgqeF7lcMIHkDlJWpFE4HjwZtYPGKPIQrf9ajD+19lPVFQHl2ZBhDkgthoRRckqAVETJ8q28iPfQ88u6sDNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:33.194493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02642","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b88cfefcede1ea9c7c092e9ef73aaab835a039c7ebf691094497443235c9a5dd","sha256:2fc8475724d44baf1fe547183b2ac68fff663204edbe6cb8aef2510b1cc2a10c"],"state_sha256":"0b9c88a2cc03e163505979fb07cdb6cedff5687c17bd172dd20c819f94d61f3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hgsOpilGNXFLM7ZK1ZHbMctKFQjytCnPEoQPjpcH0rvgU77EG+wzHHzXzgkV6cWKCDpvsrTmubzIoXXA+oE2BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:24:02.871713Z","bundle_sha256":"a44f145166658d49e85c36192fb40b16c59f52e4fe2b13bc0500ddd13e9c3765"}}