{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UDURJ7LHV3I5OFQJPE5YB346JB","short_pith_number":"pith:UDURJ7LH","schema_version":"1.0","canonical_sha256":"a0e914fd67aed1d71609793b80ef9e48432fd1700e5b3c648caad00552f96acf","source":{"kind":"arxiv","id":"1112.5157","version":1},"attestation_state":"computed","paper":{"title":"Edge growth in graph squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Goff","submitted_at":"2011-12-21T20:58:37Z","abstract_excerpt":"We resolve a conjecture of Hegarty regarding the number of edges in the square of a regular graph. If $G$ is a connected $d$-regular graph with $n$ vertices, the graph square of $G$ is not complete, and $G$ is not a member of two narrow families of graphs, then the square of $G$ has at least $(2-o_d(1))n$ more edges than $G$."},"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":"1112.5157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-12-21T20:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"c58da8b5393739f5a1a841945cd13e46707bb31c9b661b2f08dd8256585e5a29","abstract_canon_sha256":"a2cebc5352d192e46a8ee4e28a47e3121ef0b811b03e8bb06846ce2763a00210"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:48.575003Z","signature_b64":"8X5sJZ3o6bsmj77Yc/PUWAtGrPaGZm/j1LnA1Y3FWUiyInCew/oBvOo8kXNvbpWldq/xSn+73yLrOlup/NfaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e914fd67aed1d71609793b80ef9e48432fd1700e5b3c648caad00552f96acf","last_reissued_at":"2026-05-18T04:05:48.574214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:48.574214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge growth in graph squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Goff","submitted_at":"2011-12-21T20:58:37Z","abstract_excerpt":"We resolve a conjecture of Hegarty regarding the number of edges in the square of a regular graph. If $G$ is a connected $d$-regular graph with $n$ vertices, the graph square of $G$ is not complete, and $G$ is not a member of two narrow families of graphs, then the square of $G$ has at least $(2-o_d(1))n$ more edges than $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.5157","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":"1112.5157","created_at":"2026-05-18T04:05:48.574341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.5157v1","created_at":"2026-05-18T04:05:48.574341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.5157","created_at":"2026-05-18T04:05:48.574341+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDURJ7LHV3I5","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDURJ7LHV3I5OFQJ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDURJ7LH","created_at":"2026-05-18T12:26:42.757692+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/UDURJ7LHV3I5OFQJPE5YB346JB","json":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB.json","graph_json":"https://pith.science/api/pith-number/UDURJ7LHV3I5OFQJPE5YB346JB/graph.json","events_json":"https://pith.science/api/pith-number/UDURJ7LHV3I5OFQJPE5YB346JB/events.json","paper":"https://pith.science/paper/UDURJ7LH"},"agent_actions":{"view_html":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB","download_json":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB.json","view_paper":"https://pith.science/paper/UDURJ7LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.5157&json=true","fetch_graph":"https://pith.science/api/pith-number/UDURJ7LHV3I5OFQJPE5YB346JB/graph.json","fetch_events":"https://pith.science/api/pith-number/UDURJ7LHV3I5OFQJPE5YB346JB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB/action/storage_attestation","attest_author":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB/action/author_attestation","sign_citation":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB/action/citation_signature","submit_replication":"https://pith.science/pith/UDURJ7LHV3I5OFQJPE5YB346JB/action/replication_record"}},"created_at":"2026-05-18T04:05:48.574341+00:00","updated_at":"2026-05-18T04:05:48.574341+00:00"}