{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","short_pith_number":"pith:3DQNOQVN","schema_version":"1.0","canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","source":{"kind":"arxiv","id":"1012.2950","version":1},"attestation_state":"computed","paper":{"title":"Average Degree in Graph Powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Scheide, Jessica McDonald, Matt DeVos","submitted_at":"2010-12-14T07:43:13Z","abstract_excerpt":"The kth power of a simple graph G, denoted G^k, is the graph with vertex set V(G) where two vertices are adjacent if they are within distance k in G. We are interested in finding lower bounds on the average degree of G^k. Here we prove that if G is connected with minimum degree d > 2 and |V(G)| > (8/3)d, then G^4 has average degree at least (7/3)d. We also prove that if G is a connected d-regular graph on n vertices with diameter at least 3k+3, then the average degree of G^{3k+2} is at least (2k+1)(d+1) - k(k+1) (d+1)^2/n - 1. Both of these results are shown to be essentially best possible; th"},"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.2950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T07:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"89caf770af94f0013d001916ec37e4ab8de20a9bd6d18305281dd611a84772a6","abstract_canon_sha256":"7782f2d0666bdaba1182a9910b96057de86a7e7c4509de1c8c3f334374cba991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:18.980698Z","signature_b64":"VLaACZrGTlEvmUKhszcIaSRSt96iGX+cWJD9JTHQ8LU4uHjrugnyOszd9Bfmv9WATlntaprFR5zNwQln7U6xCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","last_reissued_at":"2026-05-18T04:33:18.980296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:18.980296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Degree in Graph Powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Diego Scheide, Jessica McDonald, Matt DeVos","submitted_at":"2010-12-14T07:43:13Z","abstract_excerpt":"The kth power of a simple graph G, denoted G^k, is the graph with vertex set V(G) where two vertices are adjacent if they are within distance k in G. We are interested in finding lower bounds on the average degree of G^k. Here we prove that if G is connected with minimum degree d > 2 and |V(G)| > (8/3)d, then G^4 has average degree at least (7/3)d. We also prove that if G is a connected d-regular graph on n vertices with diameter at least 3k+3, then the average degree of G^{3k+2} is at least (2k+1)(d+1) - k(k+1) (d+1)^2/n - 1. Both of these results are shown to be essentially best possible; th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2950","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.2950","created_at":"2026-05-18T04:33:18.980356+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2950v1","created_at":"2026-05-18T04:33:18.980356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2950","created_at":"2026-05-18T04:33:18.980356+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DQNOQVNTLIW","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DQNOQVNTLIWVC2Q","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DQNOQVN","created_at":"2026-05-18T12:26:03.138858+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/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","json":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB.json","graph_json":"https://pith.science/api/pith-number/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/graph.json","events_json":"https://pith.science/api/pith-number/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/events.json","paper":"https://pith.science/paper/3DQNOQVN"},"agent_actions":{"view_html":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","download_json":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB.json","view_paper":"https://pith.science/paper/3DQNOQVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2950&json=true","fetch_graph":"https://pith.science/api/pith-number/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/graph.json","fetch_events":"https://pith.science/api/pith-number/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/action/storage_attestation","attest_author":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/action/author_attestation","sign_citation":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/action/citation_signature","submit_replication":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/action/replication_record"}},"created_at":"2026-05-18T04:33:18.980356+00:00","updated_at":"2026-05-18T04:33:18.980356+00:00"}