{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GC7UZIY3W2ORTBTVR6DBQZLBC2","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":"8591b6c8614a028631ff3c514caae79ae02d36af3c8eb21fae0d3f199c06c7fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-17T08:52:27Z","title_canon_sha256":"9706c5b484c19352743fce235f95db5c5fa6542c4b97225e6bc878dc1eb73191"},"schema_version":"1.0","source":{"id":"1702.05257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05257","created_at":"2026-05-18T00:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05257v1","created_at":"2026-05-18T00:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05257","created_at":"2026-05-18T00:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"GC7UZIY3W2OR","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"GC7UZIY3W2ORTBTV","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"GC7UZIY3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:038aa0740c75c08f9029cd76f12763e94f080e155c3adf0675dfea2498db7f82","target":"graph","created_at":"2026-05-18T00:50:32Z","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":"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","authors_text":"Primoz Sparl, Stefko Miklavic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-17T08:52:27Z","title":"$\\ell$-distance-balanced graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05257","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:cdc19361f505e9186ebd4eebbba10e727f8b8658ce08b384da69b9d7041ad41a","target":"record","created_at":"2026-05-18T00:50:32Z","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":"8591b6c8614a028631ff3c514caae79ae02d36af3c8eb21fae0d3f199c06c7fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-17T08:52:27Z","title_canon_sha256":"9706c5b484c19352743fce235f95db5c5fa6542c4b97225e6bc878dc1eb73191"},"schema_version":"1.0","source":{"id":"1702.05257","kind":"arxiv","version":1}},"canonical_sha256":"30bf4ca31bb69d1986758f8618656116a3818ccb97d471351455835019f988c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30bf4ca31bb69d1986758f8618656116a3818ccb97d471351455835019f988c3","first_computed_at":"2026-05-18T00:50:32.216369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:32.216369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"84QaiHdubU3XPe7xBrbwyGd3om0n9AD7wGSQsdA/M2y7Wl1eQ9lifHfPmOkHDQLEybRAfRmwdlv1Yiot0T0ZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:32.217068Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdc19361f505e9186ebd4eebbba10e727f8b8658ce08b384da69b9d7041ad41a","sha256:038aa0740c75c08f9029cd76f12763e94f080e155c3adf0675dfea2498db7f82"],"state_sha256":"5167b727bd0b30c8801b53b30de1b0d61a93020cc88069b01a76210f675f4118"}