{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TP2HUE6RNP7XB4TIL6DMNCI6SR","short_pith_number":"pith:TP2HUE6R","schema_version":"1.0","canonical_sha256":"9bf47a13d16bff70f2685f86c6891e945b97077a6203021f84eec1ac347f25f0","source":{"kind":"arxiv","id":"1009.0343","version":1},"attestation_state":"computed","paper":{"title":"Edge Growth in Graph Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Matt DeVos, St\\'ephan Thomass\\'e","submitted_at":"2010-09-02T07:41:35Z","abstract_excerpt":"We show that for every connected graph $G$ of diameter $\\ge 3$, the graph $G^3$ has average degree $\\ge 7/4 \\delta(G)$. We also provide an example showing that this bound is best possible. This resolves a question of Hegarty \\cite{PH}."},"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":"1009.0343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-02T07:41:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"140daa6449342b67aa28ac2e3922731e63c4173aac5d6a43efe63396c123c27a","abstract_canon_sha256":"4fc9e61671dc1fd4aea72b853c3f6b7f9ebe8fec24b570afff22906a60420cd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.903770Z","signature_b64":"I8qBZZwzocWuzJB6dptGwk5QxuvzWMFHhhj4wNJSEdKMIyVc6yAbTFtyI7WqJTHDOBjjYWmf+1bcYCqIs+8MDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bf47a13d16bff70f2685f86c6891e945b97077a6203021f84eec1ac347f25f0","last_reissued_at":"2026-05-18T04:41:26.903322Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.903322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge Growth in Graph Cubes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Matt DeVos, St\\'ephan Thomass\\'e","submitted_at":"2010-09-02T07:41:35Z","abstract_excerpt":"We show that for every connected graph $G$ of diameter $\\ge 3$, the graph $G^3$ has average degree $\\ge 7/4 \\delta(G)$. We also provide an example showing that this bound is best possible. This resolves a question of Hegarty \\cite{PH}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0343","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":"1009.0343","created_at":"2026-05-18T04:41:26.903387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0343v1","created_at":"2026-05-18T04:41:26.903387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0343","created_at":"2026-05-18T04:41:26.903387+00:00"},{"alias_kind":"pith_short_12","alias_value":"TP2HUE6RNP7X","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TP2HUE6RNP7XB4TI","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TP2HUE6R","created_at":"2026-05-18T12:26:13.927090+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/TP2HUE6RNP7XB4TIL6DMNCI6SR","json":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR.json","graph_json":"https://pith.science/api/pith-number/TP2HUE6RNP7XB4TIL6DMNCI6SR/graph.json","events_json":"https://pith.science/api/pith-number/TP2HUE6RNP7XB4TIL6DMNCI6SR/events.json","paper":"https://pith.science/paper/TP2HUE6R"},"agent_actions":{"view_html":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR","download_json":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR.json","view_paper":"https://pith.science/paper/TP2HUE6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0343&json=true","fetch_graph":"https://pith.science/api/pith-number/TP2HUE6RNP7XB4TIL6DMNCI6SR/graph.json","fetch_events":"https://pith.science/api/pith-number/TP2HUE6RNP7XB4TIL6DMNCI6SR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR/action/storage_attestation","attest_author":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR/action/author_attestation","sign_citation":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR/action/citation_signature","submit_replication":"https://pith.science/pith/TP2HUE6RNP7XB4TIL6DMNCI6SR/action/replication_record"}},"created_at":"2026-05-18T04:41:26.903387+00:00","updated_at":"2026-05-18T04:41:26.903387+00:00"}