{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XXDTYZZX3OYZO3MUBPEFIZSSLU","short_pith_number":"pith:XXDTYZZX","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"},"canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","source":{"kind":"arxiv","id":"1709.00589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00589","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00589v1","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00589","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"XXDTYZZX3OYZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXDTYZZX3OYZO3MU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXDTYZZX","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XXDTYZZX3OYZO3MUBPEFIZSSLU","target":"record","payload":{"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"},"canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","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"},"source_kind":"arxiv","source_id":"1709.00589","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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"diACZwJZeSwDFGqvAU5jGYz6v9hgY972JmOKvCkrtTPdki1tivBQKMq/PaTx82ohUqeO7HZVzvaumV27S9RJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:47.147719Z"},"content_sha256":"a3ea4d76bdc36e199e1a133a9edefcf245d48a43b5269848c01f60762c957d38","schema_version":"1.0","event_id":"sha256:a3ea4d76bdc36e199e1a133a9edefcf245d48a43b5269848c01f60762c957d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XXDTYZZX3OYZO3MUBPEFIZSSLU","target":"graph","payload":{"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"},"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:36:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WT7xmJBCAsumoIMnsE8Ll7G3kpU9LZshlNCabDtuxZ+PcnwTiYL9ME3ugx7zKolOXxCHK5elPZUbigmkuHVRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:45:47.148095Z"},"content_sha256":"7f46ca5dd2ea1885a1fb6bd412c654c15ac9fa03ca2af42af0b0b9bfe938d5e8","schema_version":"1.0","event_id":"sha256:7f46ca5dd2ea1885a1fb6bd412c654c15ac9fa03ca2af42af0b0b9bfe938d5e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/bundle.json","state_url":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/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-02T20:45:47Z","links":{"resolver":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU","bundle":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/bundle.json","state":"https://pith.science/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXDTYZZX3OYZO3MUBPEFIZSSLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XXDTYZZX3OYZO3MUBPEFIZSSLU","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":"86e4351be6290c19c7209e1c54773bfa9700055a0dbcf48c1436aa6985906e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-02T14:35:52Z","title_canon_sha256":"6ae9e878b8f7490b8f95e19df55b9f35346136568578fc4c523dc58da3551202"},"schema_version":"1.0","source":{"id":"1709.00589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00589","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00589v1","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00589","created_at":"2026-05-18T00:36:07Z"},{"alias_kind":"pith_short_12","alias_value":"XXDTYZZX3OYZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XXDTYZZX3OYZO3MU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XXDTYZZX","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:7f46ca5dd2ea1885a1fb6bd412c654c15ac9fa03ca2af42af0b0b9bfe938d5e8","target":"graph","created_at":"2026-05-18T00:36:07Z","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":"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","authors_text":"Haiqiong Liu, Kexiang Xu, Kinkar Ch. Das, Sandi Klav\\v{z}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-02T14:35:52Z","title":"Embeddings into almost self-centered graphs of given radius"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00589","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:a3ea4d76bdc36e199e1a133a9edefcf245d48a43b5269848c01f60762c957d38","target":"record","created_at":"2026-05-18T00:36:07Z","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":"86e4351be6290c19c7209e1c54773bfa9700055a0dbcf48c1436aa6985906e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-02T14:35:52Z","title_canon_sha256":"6ae9e878b8f7490b8f95e19df55b9f35346136568578fc4c523dc58da3551202"},"schema_version":"1.0","source":{"id":"1709.00589","kind":"arxiv","version":1}},"canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdc73c6737dbb1976d940bc85466525d029cbde68387fd7b317ff0065943e29b","first_computed_at":"2026-05-18T00:36:07.561291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:07.561291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cjqRthTIypfly0E1h2Lwqam5mkni71ltKoM7x0zouvIN3NI5mqrSrMfbV16a1XVr7drEtHZMBDKm4PRUF7OcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:07.561856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3ea4d76bdc36e199e1a133a9edefcf245d48a43b5269848c01f60762c957d38","sha256:7f46ca5dd2ea1885a1fb6bd412c654c15ac9fa03ca2af42af0b0b9bfe938d5e8"],"state_sha256":"b2b3b55ba00e1255041dd9415e31ace14224ec5c05c45e87ee3ac2215038dcbc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obn0G/KgOVq2wpA7QPz2FUa53hXDPlYL1Au/15Ut6OhP1rCsRgJAZmP80hf/5mKN1dWxWOFpz2xn1Fr/z6pFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:45:47.150108Z","bundle_sha256":"dd576cf0ed8d6168b946c493795ac45e5ace2dd7f471d29637accf9fa9c4fa99"}}