{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VYAJV3K7HPVAZGNCQRGNKRWBYC","short_pith_number":"pith:VYAJV3K7","canonical_record":{"source":{"id":"2406.11051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T19:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"051fc24336c7ef66def42ea20397db6573862284e3119319c2c29e3b610e9265","abstract_canon_sha256":"b8b50ac0c148974ae7bed5be5f893ea17f24893c7f93f9a6f8c058895dea8a36"},"schema_version":"1.0"},"canonical_sha256":"ae009aed5f3bea0c99a2844cd546c1c0881225d22701c75d297db7e09e242624","source":{"kind":"arxiv","id":"2406.11051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11051","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11051v1","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11051","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"VYAJV3K7HPVA","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYAJV3K7HPVAZGNC","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYAJV3K7","created_at":"2026-07-05T08:32:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VYAJV3K7HPVAZGNCQRGNKRWBYC","target":"record","payload":{"canonical_record":{"source":{"id":"2406.11051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T19:24:53Z","cross_cats_sorted":[],"title_canon_sha256":"051fc24336c7ef66def42ea20397db6573862284e3119319c2c29e3b610e9265","abstract_canon_sha256":"b8b50ac0c148974ae7bed5be5f893ea17f24893c7f93f9a6f8c058895dea8a36"},"schema_version":"1.0"},"canonical_sha256":"ae009aed5f3bea0c99a2844cd546c1c0881225d22701c75d297db7e09e242624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:48.168091Z","signature_b64":"jvR8BRXmAPqKPO+zmsaSpIK6I/ZxoCBcUnmza4IBnrBg6nwQe0Pkyxb/tpbeAuoo46Fx6AGg1mmDVSW/yZd0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae009aed5f3bea0c99a2844cd546c1c0881225d22701c75d297db7e09e242624","last_reissued_at":"2026-07-05T08:32:48.167638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:48.167638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.11051","source_version":1,"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:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+CJLfujha85xJaBEpFr+SeIlgQZlrhlV/9BOG//d8LfKeeUKIRHi/W2A2nr3bsaUWzExJvIGGQdgj7kFADkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:46:16.618286Z"},"content_sha256":"79769268cfdd2f22a4f3546c2249bdb0beee077ab7f601160415105ba29d6fcd","schema_version":"1.0","event_id":"sha256:79769268cfdd2f22a4f3546c2249bdb0beee077ab7f601160415105ba29d6fcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VYAJV3K7HPVAZGNCQRGNKRWBYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adnane Fouadi, Anand Srivastav, Mourad El Ouali","submitted_at":"2024-06-16T19:24:53Z","abstract_excerpt":"We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \\in \\mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spanning graph with minimum degree $k=k(n)$, a connected spanning subgraph or a Hamiltonian subgraph. In the $(a:b)$ game in each round Maker chooses $a$ unclaimed edges of $K_n$ and Breaker chooses $b$ unclaimed edges. Maker wins, if he succeeds to build a copy of the subgraph under consideration, otherwise Breaker wins. For the $k$-minimum-degree, we present a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11051","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/2406.11051/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:32:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NsBugQynUoACGxqyzo/7JwKQlUGJhqzWuuz3TI0OPq+kSdAyjuActR2NTbgBGyVgy/lKO39EcoR6W5okzLl+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T21:46:16.618809Z"},"content_sha256":"38576e55124b0d90e54af1f6f218921578ec33b6b1af6d0c3918edc45bd1ed7d","schema_version":"1.0","event_id":"sha256:38576e55124b0d90e54af1f6f218921578ec33b6b1af6d0c3918edc45bd1ed7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/bundle.json","state_url":"https://pith.science/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/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-08-21T21:46:16Z","links":{"resolver":"https://pith.science/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC","bundle":"https://pith.science/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/bundle.json","state":"https://pith.science/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYAJV3K7HPVAZGNCQRGNKRWBYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VYAJV3K7HPVAZGNCQRGNKRWBYC","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":"b8b50ac0c148974ae7bed5be5f893ea17f24893c7f93f9a6f8c058895dea8a36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T19:24:53Z","title_canon_sha256":"051fc24336c7ef66def42ea20397db6573862284e3119319c2c29e3b610e9265"},"schema_version":"1.0","source":{"id":"2406.11051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.11051","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"arxiv_version","alias_value":"2406.11051v1","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11051","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_12","alias_value":"VYAJV3K7HPVA","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_16","alias_value":"VYAJV3K7HPVAZGNC","created_at":"2026-07-05T08:32:48Z"},{"alias_kind":"pith_short_8","alias_value":"VYAJV3K7","created_at":"2026-07-05T08:32:48Z"}],"graph_snapshots":[{"event_id":"sha256:38576e55124b0d90e54af1f6f218921578ec33b6b1af6d0c3918edc45bd1ed7d","target":"graph","created_at":"2026-07-05T08:32:48Z","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/2406.11051/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the $(a:b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_n$ on $n$ vertices, $n,a,b \\in \\mathbb{N}$ where the goal of Maker is to build a copy of a specific fixed subgraph $H$. In our work this is a spanning graph with minimum degree $k=k(n)$, a connected spanning subgraph or a Hamiltonian subgraph. In the $(a:b)$ game in each round Maker chooses $a$ unclaimed edges of $K_n$ and Breaker chooses $b$ unclaimed edges. Maker wins, if he succeeds to build a copy of the subgraph under consideration, otherwise Breaker wins. For the $k$-minimum-degree, we present a","authors_text":"Adnane Fouadi, Anand Srivastav, Mourad El Ouali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T19:24:53Z","title":"Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11051","kind":"arxiv","version":1},"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:79769268cfdd2f22a4f3546c2249bdb0beee077ab7f601160415105ba29d6fcd","target":"record","created_at":"2026-07-05T08:32:48Z","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":"b8b50ac0c148974ae7bed5be5f893ea17f24893c7f93f9a6f8c058895dea8a36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-06-16T19:24:53Z","title_canon_sha256":"051fc24336c7ef66def42ea20397db6573862284e3119319c2c29e3b610e9265"},"schema_version":"1.0","source":{"id":"2406.11051","kind":"arxiv","version":1}},"canonical_sha256":"ae009aed5f3bea0c99a2844cd546c1c0881225d22701c75d297db7e09e242624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae009aed5f3bea0c99a2844cd546c1c0881225d22701c75d297db7e09e242624","first_computed_at":"2026-07-05T08:32:48.167638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:48.167638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jvR8BRXmAPqKPO+zmsaSpIK6I/ZxoCBcUnmza4IBnrBg6nwQe0Pkyxb/tpbeAuoo46Fx6AGg1mmDVSW/yZd0BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:48.168091Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.11051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79769268cfdd2f22a4f3546c2249bdb0beee077ab7f601160415105ba29d6fcd","sha256:38576e55124b0d90e54af1f6f218921578ec33b6b1af6d0c3918edc45bd1ed7d"],"state_sha256":"20568b09cba91108a3cd153da5a86d6d94abbe40c9b05b48210515a89a9e4063"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7AIBbw22N106c9+pgVRHRVk8Vw3Nfubv/hTEyjOAvRrUf+wiIXDhKjQuy9d7pGs4WeG+4ee1ZeJ4VkEVrfiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T21:46:16.622965Z","bundle_sha256":"cd03e01c9f9b40be60ced52c2f1e3ab34dbd55e4824b2be993f1b1d8cb3d1144"}}