{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XXDTYZZX3OYZO3MUBPEFIZSSLU","short_pith_number":"pith:XXDTYZZX","schema_version":"1.0","canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","source":{"kind":"arxiv","id":"1709.00589","version":1},"attestation_state":"computed","paper":{"title":"Embeddings into almost self-centered graphs of given radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haiqiong Liu, Kexiang Xu, Kinkar Ch. Das, Sandi Klav\\v{z}ar","submitted_at":"2017-09-02T14:35:52Z","abstract_excerpt":"A graph is almost self-centered (ASC) if all but two of its vertices are central. An almost self-centered graph with radius $r$ is called an $r$-ASC graph. The $r$-ASC index $\\theta_r(G)$ of a graph $G$ is the minimum number of vertices needed to be added to $G$ such that an $r$-ASC graph is obtained that contains $G$ as an induced subgraph. It is proved that $\\theta_r(G)\\le 2r$ holds for any graph $G$ and any $r\\ge 2$ which improves the earlier known bound $\\theta_r(G)\\le 2r+1$. It is further proved that $\\theta_r(G)\\le 2r-1$ holds if $r\\geq 3$ and $G$ is of order at least $2$. The $3$-ASC in"},"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":"1709.00589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-02T14:35:52Z","cross_cats_sorted":[],"title_canon_sha256":"6ae9e878b8f7490b8f95e19df55b9f35346136568578fc4c523dc58da3551202","abstract_canon_sha256":"86e4351be6290c19c7209e1c54773bfa9700055a0dbcf48c1436aa6985906e83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:07.561856Z","signature_b64":"cjqRthTIypfly0E1h2Lwqam5mkni71ltKoM7x0zouvIN3NI5mqrSrMfbV16a1XVr7drEtHZMBDKm4PRUF7OcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","last_reissued_at":"2026-05-18T00:36:07.561291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:07.561291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embeddings into almost self-centered graphs of given radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haiqiong Liu, Kexiang Xu, Kinkar Ch. Das, Sandi Klav\\v{z}ar","submitted_at":"2017-09-02T14:35:52Z","abstract_excerpt":"A graph is almost self-centered (ASC) if all but two of its vertices are central. An almost self-centered graph with radius $r$ is called an $r$-ASC graph. The $r$-ASC index $\\theta_r(G)$ of a graph $G$ is the minimum number of vertices needed to be added to $G$ such that an $r$-ASC graph is obtained that contains $G$ as an induced subgraph. It is proved that $\\theta_r(G)\\le 2r$ holds for any graph $G$ and any $r\\ge 2$ which improves the earlier known bound $\\theta_r(G)\\le 2r+1$. It is further proved that $\\theta_r(G)\\le 2r-1$ holds if $r\\geq 3$ and $G$ is of order at least $2$. The $3$-ASC in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00589","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":"1709.00589","created_at":"2026-05-18T00:36:07.561403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00589v1","created_at":"2026-05-18T00:36:07.561403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00589","created_at":"2026-05-18T00:36:07.561403+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXDTYZZX3OYZ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXDTYZZX3OYZO3MU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXDTYZZX","created_at":"2026-05-18T12:31:56.362134+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/XXDTYZZX3OYZO3MUBPEFIZSSLU","json":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU.json","graph_json":"https://pith.science/api/pith-number/XXDTYZZX3OYZO3MUBPEFIZSSLU/graph.json","events_json":"https://pith.science/api/pith-number/XXDTYZZX3OYZO3MUBPEFIZSSLU/events.json","paper":"https://pith.science/paper/XXDTYZZX"},"agent_actions":{"view_html":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU","download_json":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU.json","view_paper":"https://pith.science/paper/XXDTYZZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00589&json=true","fetch_graph":"https://pith.science/api/pith-number/XXDTYZZX3OYZO3MUBPEFIZSSLU/graph.json","fetch_events":"https://pith.science/api/pith-number/XXDTYZZX3OYZO3MUBPEFIZSSLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/action/storage_attestation","attest_author":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/action/author_attestation","sign_citation":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/action/citation_signature","submit_replication":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/action/replication_record"}},"created_at":"2026-05-18T00:36:07.561403+00:00","updated_at":"2026-05-18T00:36:07.561403+00:00"}