{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5GQ63XRWDFHRW5UO75XZUOQVN4","short_pith_number":"pith:5GQ63XRW","schema_version":"1.0","canonical_sha256":"e9a1edde36194f1b768eff6f9a3a156f3a64ab86d07a738d1a22418984a8884d","source":{"kind":"arxiv","id":"1310.4096","version":4},"attestation_state":"computed","paper":{"title":"Generating random graphs in biased Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Humberto Naves, Michael Krivelevich","submitted_at":"2013-10-15T16:03:29Z","abstract_excerpt":"We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker-Breaker games. In particular, we show that for $b=o\\left(\\sqrt{n}\\right)$, Maker can build a pancyclic graph (that is, a graph that contains cycles of every possible length) while playing a $(1:b)$ game on $E(K_n)$. As another application, we show that for $b=\\Theta\\left(n/\\ln n\\right)$, playing a $(1:b)$ game on $E(K_n)$, Maker can build a graph which contains copies of a"},"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":"1310.4096","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-15T16:03:29Z","cross_cats_sorted":[],"title_canon_sha256":"c8dbf6576b910d91303e37aca36eb36c8dfef951a475a2ae3ff1f50054b1944e","abstract_canon_sha256":"2ae029e59cfceb03ba47b3cc0eccebf130e8639b566821d42fe1a7fdf58c5da7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.784089Z","signature_b64":"93chOge9FQiMiyfwj/4WhshpPeOJSE84jsIeLBs1eS0IIb/Zf9ZQ5kCAZfTG++Q8/pEQuLRG6eQPPMYtlYjlAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a1edde36194f1b768eff6f9a3a156f3a64ab86d07a738d1a22418984a8884d","last_reissued_at":"2026-05-18T01:33:32.783534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.783534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating random graphs in biased Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Humberto Naves, Michael Krivelevich","submitted_at":"2013-10-15T16:03:29Z","abstract_excerpt":"We present a general approach connecting biased Maker-Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker-Breaker games. In particular, we show that for $b=o\\left(\\sqrt{n}\\right)$, Maker can build a pancyclic graph (that is, a graph that contains cycles of every possible length) while playing a $(1:b)$ game on $E(K_n)$. As another application, we show that for $b=\\Theta\\left(n/\\ln n\\right)$, playing a $(1:b)$ game on $E(K_n)$, Maker can build a graph which contains copies of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4096","kind":"arxiv","version":4},"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":"1310.4096","created_at":"2026-05-18T01:33:32.783605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4096v4","created_at":"2026-05-18T01:33:32.783605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4096","created_at":"2026-05-18T01:33:32.783605+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GQ63XRWDFHR","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GQ63XRWDFHRW5UO","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GQ63XRW","created_at":"2026-05-18T12:27:34.582898+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/5GQ63XRWDFHRW5UO75XZUOQVN4","json":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4.json","graph_json":"https://pith.science/api/pith-number/5GQ63XRWDFHRW5UO75XZUOQVN4/graph.json","events_json":"https://pith.science/api/pith-number/5GQ63XRWDFHRW5UO75XZUOQVN4/events.json","paper":"https://pith.science/paper/5GQ63XRW"},"agent_actions":{"view_html":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4","download_json":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4.json","view_paper":"https://pith.science/paper/5GQ63XRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4096&json=true","fetch_graph":"https://pith.science/api/pith-number/5GQ63XRWDFHRW5UO75XZUOQVN4/graph.json","fetch_events":"https://pith.science/api/pith-number/5GQ63XRWDFHRW5UO75XZUOQVN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4/action/storage_attestation","attest_author":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4/action/author_attestation","sign_citation":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4/action/citation_signature","submit_replication":"https://pith.science/pith/5GQ63XRWDFHRW5UO75XZUOQVN4/action/replication_record"}},"created_at":"2026-05-18T01:33:32.783605+00:00","updated_at":"2026-05-18T01:33:32.783605+00:00"}