{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","short_pith_number":"pith:3DQNOQVN","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"},"canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","source":{"kind":"arxiv","id":"1012.2950","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2950","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2950v1","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2950","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"3DQNOQVNTLIW","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3DQNOQVNTLIWVC2Q","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3DQNOQVN","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","target":"record","payload":{"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"},"canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","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"},"source_kind":"arxiv","source_id":"1012.2950","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-18T04:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGZg4u+kYxOM87khClOjrpESVMAXDwNxXI9D5nO4w+zVgRantVtGsUjcI51zxj/EzUmrtM8Gx87v80AzwWWpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:10:10.735890Z"},"content_sha256":"80b47fda46ede10ca7165d38d2f3de7a02026c0d47592be38cd5782af33cf9e1","schema_version":"1.0","event_id":"sha256:80b47fda46ede10ca7165d38d2f3de7a02026c0d47592be38cd5782af33cf9e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","target":"graph","payload":{"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"},"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-18T04:33:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpdXhjtOqkdqED6W+rpwzRYiR6DNN44VvwBkMNsHH9yTF4CtjepOostl2/PAWC8KFoECU6lbpjB7mihnZw+pCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:10:10.736531Z"},"content_sha256":"84bbe85424baba790238a3e4216449619fbfcf3c6eff4d89d7e0c635e7c353b9","schema_version":"1.0","event_id":"sha256:84bbe85424baba790238a3e4216449619fbfcf3c6eff4d89d7e0c635e7c353b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/bundle.json","state_url":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/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-05-30T17:10:10Z","links":{"resolver":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","bundle":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/bundle.json","state":"https://pith.science/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DQNOQVNTLIWVC2Q4ZMXEZ6LTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3DQNOQVNTLIWVC2Q4ZMXEZ6LTB","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":"7782f2d0666bdaba1182a9910b96057de86a7e7c4509de1c8c3f334374cba991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T07:43:13Z","title_canon_sha256":"89caf770af94f0013d001916ec37e4ab8de20a9bd6d18305281dd611a84772a6"},"schema_version":"1.0","source":{"id":"1012.2950","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2950","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2950v1","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2950","created_at":"2026-05-18T04:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"3DQNOQVNTLIW","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3DQNOQVNTLIWVC2Q","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3DQNOQVN","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:84bbe85424baba790238a3e4216449619fbfcf3c6eff4d89d7e0c635e7c353b9","target":"graph","created_at":"2026-05-18T04:33:18Z","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":"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","authors_text":"Diego Scheide, Jessica McDonald, Matt DeVos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T07:43:13Z","title":"Average Degree in Graph Powers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2950","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:80b47fda46ede10ca7165d38d2f3de7a02026c0d47592be38cd5782af33cf9e1","target":"record","created_at":"2026-05-18T04:33:18Z","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":"7782f2d0666bdaba1182a9910b96057de86a7e7c4509de1c8c3f334374cba991","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-14T07:43:13Z","title_canon_sha256":"89caf770af94f0013d001916ec37e4ab8de20a9bd6d18305281dd611a84772a6"},"schema_version":"1.0","source":{"id":"1012.2950","kind":"arxiv","version":1}},"canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8e0d742ad9ad16a8b50e6597267cb987d24d5d9ce161e85a6c9ba7d78633141","first_computed_at":"2026-05-18T04:33:18.980296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:18.980296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VLaACZrGTlEvmUKhszcIaSRSt96iGX+cWJD9JTHQ8LU4uHjrugnyOszd9Bfmv9WATlntaprFR5zNwQln7U6xCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:18.980698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2950","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80b47fda46ede10ca7165d38d2f3de7a02026c0d47592be38cd5782af33cf9e1","sha256:84bbe85424baba790238a3e4216449619fbfcf3c6eff4d89d7e0c635e7c353b9"],"state_sha256":"ce5ff5d6443f694c43d6051f70160504b7aa8026c0211c4569a9df1a4613b475"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpjLSHJ9MwCYCXylOu5LFa3XtiZQjX9zPGi7VKcamcU/1hH+v7Iu/Yw2CyCX+NVOwK1gBVbt6ZJZDQrJEh2AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:10:10.740820Z","bundle_sha256":"c12bc93818ca598c5163016ee5d4364cacd4ffa2c5229076578c895318b06741"}}