{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GP3IDESPFKWBND5L3WO7X4XHOM","short_pith_number":"pith:GP3IDESP","canonical_record":{"source":{"id":"2405.04462","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T16:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"f9e106095d1b2e4e4bbf68a2b94e87817af766d81e9bec37714d3ee8f613a6d5","abstract_canon_sha256":"9922862744cd6f3ce49d1fa46b191b8d49e88cc9f8ce8525682a8b13c17d5147"},"schema_version":"1.0"},"canonical_sha256":"33f681924f2aac168fabdd9dfbf2e773048029e3ed4e3313864c84bb3775b453","source":{"kind":"arxiv","id":"2405.04462","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04462","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04462v2","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04462","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"GP3IDESPFKWB","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_16","alias_value":"GP3IDESPFKWBND5L","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_8","alias_value":"GP3IDESP","created_at":"2026-07-05T08:36:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GP3IDESPFKWBND5L3WO7X4XHOM","target":"record","payload":{"canonical_record":{"source":{"id":"2405.04462","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T16:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"f9e106095d1b2e4e4bbf68a2b94e87817af766d81e9bec37714d3ee8f613a6d5","abstract_canon_sha256":"9922862744cd6f3ce49d1fa46b191b8d49e88cc9f8ce8525682a8b13c17d5147"},"schema_version":"1.0"},"canonical_sha256":"33f681924f2aac168fabdd9dfbf2e773048029e3ed4e3313864c84bb3775b453","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:47.489652Z","signature_b64":"po2/6aqrQY/sQuMGF0ETlCpXaKYRv7tmvgSTEJmjKtKMqI2kLspPQOExSL1FIr0Hl3SGjujG9JmcxP9hh3NeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33f681924f2aac168fabdd9dfbf2e773048029e3ed4e3313864c84bb3775b453","last_reissued_at":"2026-07-05T08:36:47.489182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:47.489182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.04462","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uu4PrL47+YLRWjy+jXLr84mp14YyEbE1f9LyPjismPdNDFCmGdLb3euFDUOoXtC/E29ojoAZmadQAC/+LtumDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T02:57:45.015695Z"},"content_sha256":"74dbbfbf51b9f850d0e1ef931aaa1f724bbdb4b01c25d5513d2e7a0543caaa80","schema_version":"1.0","event_id":"sha256:74dbbfbf51b9f850d0e1ef931aaa1f724bbdb4b01c25d5513d2e7a0543caaa80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GP3IDESPFKWBND5L3WO7X4XHOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Srivastav, Matthias Sowa","submitted_at":"2024-05-07T16:26:24Z","abstract_excerpt":"Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \\in \\mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each round of the game Maker claims one edge and Breaker is allowed to claim up to $q$ edges. If Maker is able to claim all edges of a copy of $C$, he wins the game. Otherwise Breaker wins. In this work we introduce the first constructive strategy for Maker for the $C_4$-Maker-Breaker game and show that he can win the game if $q < 0.16 n^{2/3}$. According to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04462","kind":"arxiv","version":2},"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/2405.04462/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZalqPqhDpOsAGfAleC7hX8AlcD/Gq52FkjXKW2EbZil9cB5vXExUDI4eMrVrinE4dBFTWhp4zXGaCpukXMZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T02:57:45.016082Z"},"content_sha256":"4fffde4e338bc7c527ee83c7fca325b91bb17971bf1ee80941aa57d424627e65","schema_version":"1.0","event_id":"sha256:4fffde4e338bc7c527ee83c7fca325b91bb17971bf1ee80941aa57d424627e65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GP3IDESPFKWBND5L3WO7X4XHOM/bundle.json","state_url":"https://pith.science/pith/GP3IDESPFKWBND5L3WO7X4XHOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GP3IDESPFKWBND5L3WO7X4XHOM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-17T02:57:45Z","links":{"resolver":"https://pith.science/pith/GP3IDESPFKWBND5L3WO7X4XHOM","bundle":"https://pith.science/pith/GP3IDESPFKWBND5L3WO7X4XHOM/bundle.json","state":"https://pith.science/pith/GP3IDESPFKWBND5L3WO7X4XHOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GP3IDESPFKWBND5L3WO7X4XHOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GP3IDESPFKWBND5L3WO7X4XHOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9922862744cd6f3ce49d1fa46b191b8d49e88cc9f8ce8525682a8b13c17d5147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T16:26:24Z","title_canon_sha256":"f9e106095d1b2e4e4bbf68a2b94e87817af766d81e9bec37714d3ee8f613a6d5"},"schema_version":"1.0","source":{"id":"2405.04462","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.04462","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"2405.04462v2","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.04462","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"GP3IDESPFKWB","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_16","alias_value":"GP3IDESPFKWBND5L","created_at":"2026-07-05T08:36:47Z"},{"alias_kind":"pith_short_8","alias_value":"GP3IDESP","created_at":"2026-07-05T08:36:47Z"}],"graph_snapshots":[{"event_id":"sha256:4fffde4e338bc7c527ee83c7fca325b91bb17971bf1ee80941aa57d424627e65","target":"graph","created_at":"2026-07-05T08:36:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.04462/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Maker-Breaker subgraph games are among the most famous combinatorial games. For given $n,q \\in \\mathbb{N}$ and a subgraph $C$ of the complete graph $K_n$, the two players, called Maker and Breaker, alternately claim edges of $K_n$. In each round of the game Maker claims one edge and Breaker is allowed to claim up to $q$ edges. If Maker is able to claim all edges of a copy of $C$, he wins the game. Otherwise Breaker wins. In this work we introduce the first constructive strategy for Maker for the $C_4$-Maker-Breaker game and show that he can win the game if $q < 0.16 n^{2/3}$. According to the ","authors_text":"Anand Srivastav, Matthias Sowa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T16:26:24Z","title":"A Constructive Winning Maker Strategy in the Maker-Breaker $C_4$-Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.04462","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:74dbbfbf51b9f850d0e1ef931aaa1f724bbdb4b01c25d5513d2e7a0543caaa80","target":"record","created_at":"2026-07-05T08:36:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9922862744cd6f3ce49d1fa46b191b8d49e88cc9f8ce8525682a8b13c17d5147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-07T16:26:24Z","title_canon_sha256":"f9e106095d1b2e4e4bbf68a2b94e87817af766d81e9bec37714d3ee8f613a6d5"},"schema_version":"1.0","source":{"id":"2405.04462","kind":"arxiv","version":2}},"canonical_sha256":"33f681924f2aac168fabdd9dfbf2e773048029e3ed4e3313864c84bb3775b453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33f681924f2aac168fabdd9dfbf2e773048029e3ed4e3313864c84bb3775b453","first_computed_at":"2026-07-05T08:36:47.489182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:36:47.489182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"po2/6aqrQY/sQuMGF0ETlCpXaKYRv7tmvgSTEJmjKtKMqI2kLspPQOExSL1FIr0Hl3SGjujG9JmcxP9hh3NeBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:36:47.489652Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.04462","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74dbbfbf51b9f850d0e1ef931aaa1f724bbdb4b01c25d5513d2e7a0543caaa80","sha256:4fffde4e338bc7c527ee83c7fca325b91bb17971bf1ee80941aa57d424627e65"],"state_sha256":"650c58ce6f032f86a05c7656ba30aaa86c1b4e3fc8e9eafcea348dc0daf9ca45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikzMW+jA0rsH5HXjvP911t7NcKf2hbf6gwKeORl0nYmSMzoJOXrgpQ35R8rAkU/frOPHAdlF9HHb1/RoWE0ZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T02:57:45.018639Z","bundle_sha256":"158192d7c9a6ab8232190410aaa65dc8dfd34c23cc8f0447781afd5b318fb9a1"}}