{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GC7UZIY3W2ORTBTVR6DBQZLBC2","short_pith_number":"pith:GC7UZIY3","schema_version":"1.0","canonical_sha256":"30bf4ca31bb69d1986758f8618656116a3818ccb97d471351455835019f988c3","source":{"kind":"arxiv","id":"1702.05257","version":1},"attestation_state":"computed","paper":{"title":"$\\ell$-distance-balanced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2017-02-17T08:52:27Z","abstract_excerpt":"Let $\\ell$ denote a positive integer. A connected graph $\\G$ of diameter at least $\\ell$ is said to be $\\ell${\\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\\G$ such that $d(u,v)=\\ell$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In this paper we present some basic properties of $\\ell$-distance-balanced graphs and study in more detail $\\ell$-distance-balanced graphs of diameter at most $3$. We also investigate the $\\ell$-distance-balanced property of some well known families of graphs such as the generalize"},"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":"1702.05257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-17T08:52:27Z","cross_cats_sorted":[],"title_canon_sha256":"9706c5b484c19352743fce235f95db5c5fa6542c4b97225e6bc878dc1eb73191","abstract_canon_sha256":"8591b6c8614a028631ff3c514caae79ae02d36af3c8eb21fae0d3f199c06c7fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:32.217068Z","signature_b64":"84QaiHdubU3XPe7xBrbwyGd3om0n9AD7wGSQsdA/M2y7Wl1eQ9lifHfPmOkHDQLEybRAfRmwdlv1Yiot0T0ZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30bf4ca31bb69d1986758f8618656116a3818ccb97d471351455835019f988c3","last_reissued_at":"2026-05-18T00:50:32.216369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:32.216369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\ell$-distance-balanced graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Primoz Sparl, Stefko Miklavic","submitted_at":"2017-02-17T08:52:27Z","abstract_excerpt":"Let $\\ell$ denote a positive integer. A connected graph $\\G$ of diameter at least $\\ell$ is said to be $\\ell${\\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\\G$ such that $d(u,v)=\\ell$, the number of vertices closer to $u$ than to $v$ is equal to the number of vertices closer to $v$ than to $u$. In this paper we present some basic properties of $\\ell$-distance-balanced graphs and study in more detail $\\ell$-distance-balanced graphs of diameter at most $3$. We also investigate the $\\ell$-distance-balanced property of some well known families of graphs such as the generalize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05257","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":"1702.05257","created_at":"2026-05-18T00:50:32.216468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05257v1","created_at":"2026-05-18T00:50:32.216468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05257","created_at":"2026-05-18T00:50:32.216468+00:00"},{"alias_kind":"pith_short_12","alias_value":"GC7UZIY3W2OR","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"GC7UZIY3W2ORTBTV","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"GC7UZIY3","created_at":"2026-05-18T12:31:15.632608+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/GC7UZIY3W2ORTBTVR6DBQZLBC2","json":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2.json","graph_json":"https://pith.science/api/pith-number/GC7UZIY3W2ORTBTVR6DBQZLBC2/graph.json","events_json":"https://pith.science/api/pith-number/GC7UZIY3W2ORTBTVR6DBQZLBC2/events.json","paper":"https://pith.science/paper/GC7UZIY3"},"agent_actions":{"view_html":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2","download_json":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2.json","view_paper":"https://pith.science/paper/GC7UZIY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05257&json=true","fetch_graph":"https://pith.science/api/pith-number/GC7UZIY3W2ORTBTVR6DBQZLBC2/graph.json","fetch_events":"https://pith.science/api/pith-number/GC7UZIY3W2ORTBTVR6DBQZLBC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2/action/storage_attestation","attest_author":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2/action/author_attestation","sign_citation":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2/action/citation_signature","submit_replication":"https://pith.science/pith/GC7UZIY3W2ORTBTVR6DBQZLBC2/action/replication_record"}},"created_at":"2026-05-18T00:50:32.216468+00:00","updated_at":"2026-05-18T00:50:32.216468+00:00"}