{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PZNUAJBHM5IDQY4S4N5R4XXXOF","short_pith_number":"pith:PZNUAJBH","schema_version":"1.0","canonical_sha256":"7e5b4024276750386392e37b1e5ef7714d987b7d1377bb36c9c9eb34f2daf522","source":{"kind":"arxiv","id":"1012.3942","version":1},"attestation_state":"computed","paper":{"title":"Distance-balanced closure of some graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. Manouchehrian, M. Mohammad-Noori, N. Ghareghani","submitted_at":"2010-12-17T17:57:20Z","abstract_excerpt":"In this paper we prove that any distance-balanced graph $G$ with $\\Delta(G)\\geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $\\Delta(T)\\geq |V(T)|-3$."},"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":"1012.3942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-17T17:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"396556389ac20b36cd21e939123dac6bdfb7a8e3460a63b14d7fc0be7035d84c","abstract_canon_sha256":"e66392ffa717eb3937441cd21bbfd457879d05d5a4440f6f2620f0462841f2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:03.571500Z","signature_b64":"gGzgS841SlQUy9QIgJKcnznu8MtlHFvDh64LYsurIRlWzjuRqzn06GfA7IVAQ1gbOiUU1YLwhoQqN5A+s+5EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e5b4024276750386392e37b1e5ef7714d987b7d1377bb36c9c9eb34f2daf522","last_reissued_at":"2026-05-18T04:33:03.570966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:03.570966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-balanced closure of some graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B. Manouchehrian, M. Mohammad-Noori, N. Ghareghani","submitted_at":"2010-12-17T17:57:20Z","abstract_excerpt":"In this paper we prove that any distance-balanced graph $G$ with $\\Delta(G)\\geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $\\Delta(T)\\geq |V(T)|-3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3942","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":"1012.3942","created_at":"2026-05-18T04:33:03.571059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3942v1","created_at":"2026-05-18T04:33:03.571059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3942","created_at":"2026-05-18T04:33:03.571059+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZNUAJBHM5ID","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZNUAJBHM5IDQY4S","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZNUAJBH","created_at":"2026-05-18T12:26:12.377268+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/PZNUAJBHM5IDQY4S4N5R4XXXOF","json":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF.json","graph_json":"https://pith.science/api/pith-number/PZNUAJBHM5IDQY4S4N5R4XXXOF/graph.json","events_json":"https://pith.science/api/pith-number/PZNUAJBHM5IDQY4S4N5R4XXXOF/events.json","paper":"https://pith.science/paper/PZNUAJBH"},"agent_actions":{"view_html":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF","download_json":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF.json","view_paper":"https://pith.science/paper/PZNUAJBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3942&json=true","fetch_graph":"https://pith.science/api/pith-number/PZNUAJBHM5IDQY4S4N5R4XXXOF/graph.json","fetch_events":"https://pith.science/api/pith-number/PZNUAJBHM5IDQY4S4N5R4XXXOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF/action/storage_attestation","attest_author":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF/action/author_attestation","sign_citation":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF/action/citation_signature","submit_replication":"https://pith.science/pith/PZNUAJBHM5IDQY4S4N5R4XXXOF/action/replication_record"}},"created_at":"2026-05-18T04:33:03.571059+00:00","updated_at":"2026-05-18T04:33:03.571059+00:00"}