{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VN7MWHMJSBQZXTRFP7WVFV3EMY","short_pith_number":"pith:VN7MWHMJ","schema_version":"1.0","canonical_sha256":"ab7ecb1d8990619bce257fed52d764660333ba4a6537405571273bd93dcc4621","source":{"kind":"arxiv","id":"2008.07763","version":1},"attestation_state":"computed","paper":{"title":"The Steiner $k$-eccentricity on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Li, Guihai Yu, Jie Hu, Sandi Klav\\v{z}ar, Xingfu Li","submitted_at":"2020-08-18T06:44:04Z","abstract_excerpt":"We study the Steiner $k$-eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klav\\v{z}ar, On the average Steiner 3-eccentricity of trees, arXiv:2005.10319, 2020]. To support the algorithm, we achieve much stronger properties for the Steiner $k$-ecc tree than that in the previous paper. Based on this, a linear time algorithm is devised to calculate the Steiner $k$-eccentricity of a vertex in a tree. On the other hand, the lower and upper bounds of the average Steiner $k$-eccentricity index of a tree on order $n$ are established based on a novel technique whi"},"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":"2008.07763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-08-18T06:44:04Z","cross_cats_sorted":[],"title_canon_sha256":"e2ab1c9418648c9f62ad90a3b7b452db7f0a60973d1a9facf9c6501536461633","abstract_canon_sha256":"27e718fa95583aa14aaec97ae8983425566698ab8e66247878da8c1f8cd3e401"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:55.088747Z","signature_b64":"T60rY9qwyi2amtlQijJU+NKUVLXywBbEdfggpnJf0DXDdYzNcZtDaVU/XBGNnvW0oq+7RsyT3fnzWxvdtalMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7ecb1d8990619bce257fed52d764660333ba4a6537405571273bd93dcc4621","last_reissued_at":"2026-07-05T01:27:55.088293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:55.088293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Steiner $k$-eccentricity on trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Li, Guihai Yu, Jie Hu, Sandi Klav\\v{z}ar, Xingfu Li","submitted_at":"2020-08-18T06:44:04Z","abstract_excerpt":"We study the Steiner $k$-eccentricity on trees, which generalizes the previous one in the paper [X.~Li, G.~Yu, S.~Klav\\v{z}ar, On the average Steiner 3-eccentricity of trees, arXiv:2005.10319, 2020]. To support the algorithm, we achieve much stronger properties for the Steiner $k$-ecc tree than that in the previous paper. Based on this, a linear time algorithm is devised to calculate the Steiner $k$-eccentricity of a vertex in a tree. On the other hand, the lower and upper bounds of the average Steiner $k$-eccentricity index of a tree on order $n$ are established based on a novel technique whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.07763","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/2008.07763/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2008.07763","created_at":"2026-07-05T01:27:55.088362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.07763v1","created_at":"2026-07-05T01:27:55.088362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.07763","created_at":"2026-07-05T01:27:55.088362+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN7MWHMJSBQZ","created_at":"2026-07-05T01:27:55.088362+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN7MWHMJSBQZXTRF","created_at":"2026-07-05T01:27:55.088362+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN7MWHMJ","created_at":"2026-07-05T01:27:55.088362+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/VN7MWHMJSBQZXTRFP7WVFV3EMY","json":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY.json","graph_json":"https://pith.science/api/pith-number/VN7MWHMJSBQZXTRFP7WVFV3EMY/graph.json","events_json":"https://pith.science/api/pith-number/VN7MWHMJSBQZXTRFP7WVFV3EMY/events.json","paper":"https://pith.science/paper/VN7MWHMJ"},"agent_actions":{"view_html":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY","download_json":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY.json","view_paper":"https://pith.science/paper/VN7MWHMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.07763&json=true","fetch_graph":"https://pith.science/api/pith-number/VN7MWHMJSBQZXTRFP7WVFV3EMY/graph.json","fetch_events":"https://pith.science/api/pith-number/VN7MWHMJSBQZXTRFP7WVFV3EMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY/action/storage_attestation","attest_author":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY/action/author_attestation","sign_citation":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY/action/citation_signature","submit_replication":"https://pith.science/pith/VN7MWHMJSBQZXTRFP7WVFV3EMY/action/replication_record"}},"created_at":"2026-07-05T01:27:55.088362+00:00","updated_at":"2026-07-05T01:27:55.088362+00:00"}