{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G2CVSDH2THL7KZX6BCNTVRHLOD","short_pith_number":"pith:G2CVSDH2","schema_version":"1.0","canonical_sha256":"3685590cfa99d7f566fe089b3ac4eb70f6342b6b2b0d89847e013bc0035c347a","source":{"kind":"arxiv","id":"2506.03375","version":1},"attestation_state":"computed","paper":{"title":"Cover time of random subgraphs of the hypercube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Wesley Pegden","submitted_at":"2025-06-03T20:32:45Z","abstract_excerpt":"$Q_{n,p}$, the random subgraph of the $n$-vertex hypercube $Q_n$, is obtained by independently retaining each edge of $Q_n$ with probability $p$. We give precise values for the cover time of $Q_{n,p}$ above the connectivity threshold."},"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":"2506.03375","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T20:32:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c85c1343e681eadc92eb8c99731baa34886e205db25718f9999f2cbd74f64ccc","abstract_canon_sha256":"bf98eb48be7b93725235e498fdb6d136cf31bade3cfd72432ce7622e50d2ee3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:26.430206Z","signature_b64":"3eHv6nloe2IfCZjb6FxASGG9P3MOfWi4+ypAeUt/xYFiCAGjbi77bVLaJ8xLKqkmBX16CoiRfObMpjcZo91cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3685590cfa99d7f566fe089b3ac4eb70f6342b6b2b0d89847e013bc0035c347a","last_reissued_at":"2026-07-05T11:15:26.429712Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:26.429712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cover time of random subgraphs of the hypercube","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Colin Cooper, Wesley Pegden","submitted_at":"2025-06-03T20:32:45Z","abstract_excerpt":"$Q_{n,p}$, the random subgraph of the $n$-vertex hypercube $Q_n$, is obtained by independently retaining each edge of $Q_n$ with probability $p$. We give precise values for the cover time of $Q_{n,p}$ above the connectivity threshold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03375","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03375/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.03375","created_at":"2026-07-05T11:15:26.429771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03375v1","created_at":"2026-07-05T11:15:26.429771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03375","created_at":"2026-07-05T11:15:26.429771+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2CVSDH2THL7","created_at":"2026-07-05T11:15:26.429771+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2CVSDH2THL7KZX6","created_at":"2026-07-05T11:15:26.429771+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2CVSDH2","created_at":"2026-07-05T11:15:26.429771+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/G2CVSDH2THL7KZX6BCNTVRHLOD","json":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD.json","graph_json":"https://pith.science/api/pith-number/G2CVSDH2THL7KZX6BCNTVRHLOD/graph.json","events_json":"https://pith.science/api/pith-number/G2CVSDH2THL7KZX6BCNTVRHLOD/events.json","paper":"https://pith.science/paper/G2CVSDH2"},"agent_actions":{"view_html":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD","download_json":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD.json","view_paper":"https://pith.science/paper/G2CVSDH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03375&json=true","fetch_graph":"https://pith.science/api/pith-number/G2CVSDH2THL7KZX6BCNTVRHLOD/graph.json","fetch_events":"https://pith.science/api/pith-number/G2CVSDH2THL7KZX6BCNTVRHLOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD/action/storage_attestation","attest_author":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD/action/author_attestation","sign_citation":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD/action/citation_signature","submit_replication":"https://pith.science/pith/G2CVSDH2THL7KZX6BCNTVRHLOD/action/replication_record"}},"created_at":"2026-07-05T11:15:26.429771+00:00","updated_at":"2026-07-05T11:15:26.429771+00:00"}