{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MS4HS7M4UYXFP63HCX6A44NQQE","short_pith_number":"pith:MS4HS7M4","schema_version":"1.0","canonical_sha256":"64b8797d9ca62e57fb6715fc0e71b0811a862e33219368ec1cfab2764b41064b","source":{"kind":"arxiv","id":"1605.07237","version":1},"attestation_state":"computed","paper":{"title":"Adding random edges to dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Krivelevich, Ryan R. Martin, Tom Bohman","submitted_at":"2016-05-23T23:18:48Z","abstract_excerpt":"This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and $k$-connectivity."},"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":"1605.07237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-23T23:18:48Z","cross_cats_sorted":[],"title_canon_sha256":"aa3d830010c8d056cd755a94c3f4f38438c4effc0a1bee08e50000ae6e9e8b25","abstract_canon_sha256":"ec6407b906babc34029793e7660f2d3212fdebe352d541d9928af83f56b3d9bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.600977Z","signature_b64":"UAQ47UN90fJOMnU0dhv9yH/2PtMV60DFDSJdu5v0oXlnZbT7wK7y5J88Uu7Hs9GeWZHBUtaKpHugPbEK91wMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b8797d9ca62e57fb6715fc0e71b0811a862e33219368ec1cfab2764b41064b","last_reissued_at":"2026-05-18T01:13:46.600351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.600351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adding random edges to dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Krivelevich, Ryan R. Martin, Tom Bohman","submitted_at":"2016-05-23T23:18:48Z","abstract_excerpt":"This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small diameter and $k$-connectivity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07237","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":"1605.07237","created_at":"2026-05-18T01:13:46.600444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07237v1","created_at":"2026-05-18T01:13:46.600444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07237","created_at":"2026-05-18T01:13:46.600444+00:00"},{"alias_kind":"pith_short_12","alias_value":"MS4HS7M4UYXF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MS4HS7M4UYXFP63H","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MS4HS7M4","created_at":"2026-05-18T12:30:32.724797+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/MS4HS7M4UYXFP63HCX6A44NQQE","json":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE.json","graph_json":"https://pith.science/api/pith-number/MS4HS7M4UYXFP63HCX6A44NQQE/graph.json","events_json":"https://pith.science/api/pith-number/MS4HS7M4UYXFP63HCX6A44NQQE/events.json","paper":"https://pith.science/paper/MS4HS7M4"},"agent_actions":{"view_html":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE","download_json":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE.json","view_paper":"https://pith.science/paper/MS4HS7M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07237&json=true","fetch_graph":"https://pith.science/api/pith-number/MS4HS7M4UYXFP63HCX6A44NQQE/graph.json","fetch_events":"https://pith.science/api/pith-number/MS4HS7M4UYXFP63HCX6A44NQQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE/action/storage_attestation","attest_author":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE/action/author_attestation","sign_citation":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE/action/citation_signature","submit_replication":"https://pith.science/pith/MS4HS7M4UYXFP63HCX6A44NQQE/action/replication_record"}},"created_at":"2026-05-18T01:13:46.600444+00:00","updated_at":"2026-05-18T01:13:46.600444+00:00"}