{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RRMHKDVBC4R4XCE6GZ2HW4VTMY","short_pith_number":"pith:RRMHKDVB","canonical_record":{"source":{"id":"1812.01382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"36173f0bc72247aa42e3f8862934a9de0af80995a44fd0970c891977fdd6f483","abstract_canon_sha256":"eab02d5bc37451e54a256a78cc84d168589e346dad4120c380d4399ba3764902"},"schema_version":"1.0"},"canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","source":{"kind":"arxiv","id":"1812.01382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01382","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01382v1","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01382","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"RRMHKDVBC4R4","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRMHKDVBC4R4XCE6","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRMHKDVB","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RRMHKDVBC4R4XCE6GZ2HW4VTMY","target":"record","payload":{"canonical_record":{"source":{"id":"1812.01382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"36173f0bc72247aa42e3f8862934a9de0af80995a44fd0970c891977fdd6f483","abstract_canon_sha256":"eab02d5bc37451e54a256a78cc84d168589e346dad4120c380d4399ba3764902"},"schema_version":"1.0"},"canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.621763Z","signature_b64":"t9NdmBH4KP6pjFpGZ62L55iAR/OEQGx4LL8W63N3Vl976HzdEZHb71vtfkLr0jXw8k6pSqrw5udMbvYluvsFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","last_reissued_at":"2026-05-17T23:59:12.621246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.621246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.01382","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-05-17T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6aRH7rAPzDswOTqpJEMPySV4etifQoaQ6mqpQVEUmT1udBCoqcORDDaYe1g07gAc1ljkL/KrAgKdgIM73nVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:04:27.006113Z"},"content_sha256":"3295da6be2a5cdcb739e8c681bfadcf250a48bb38edf7c67d0941eb49b3baf19","schema_version":"1.0","event_id":"sha256:3295da6be2a5cdcb739e8c681bfadcf250a48bb38edf7c67d0941eb49b3baf19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RRMHKDVBC4R4XCE6GZ2HW4VTMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new Bound for the Maker-Breaker Triangle Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Srivastav, Christian Glazik","submitted_at":"2018-12-04T12:44:09Z","abstract_excerpt":"The triangle game introduced by Chv\\'{a}tal and Erd\\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\\in\\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alternately Maker claims one edge and thereafter Breaker claims $q$ edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chv\\'{a}tal and Erd\\H{o}s (1978) proved that for $q<\\sqrt{2n+2}-5/2\\approx 1.414\\sqrt{n}$ Maker has a winning strategy, and for $q\\geq 2\\sqrt{n}$ Breaker has a winning strategy. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01382","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"},"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-05-17T23:59:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtLTix/tdTDRL2Cjz5ICtulWBnpN5jrKZk8pHaD7JXMgCX4HREFmjMqVbiKSRlpz9f/RfUvd37WerBHBKT/ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:04:27.006575Z"},"content_sha256":"0a7b1193531c1e5388c7f05b6c26b1e6cd8274f9307e6b34c3560a15991910b6","schema_version":"1.0","event_id":"sha256:0a7b1193531c1e5388c7f05b6c26b1e6cd8274f9307e6b34c3560a15991910b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/bundle.json","state_url":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/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-22T01:04:27Z","links":{"resolver":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY","bundle":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/bundle.json","state":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RRMHKDVBC4R4XCE6GZ2HW4VTMY","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":"eab02d5bc37451e54a256a78cc84d168589e346dad4120c380d4399ba3764902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","title_canon_sha256":"36173f0bc72247aa42e3f8862934a9de0af80995a44fd0970c891977fdd6f483"},"schema_version":"1.0","source":{"id":"1812.01382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01382","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01382v1","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01382","created_at":"2026-05-17T23:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"RRMHKDVBC4R4","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RRMHKDVBC4R4XCE6","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RRMHKDVB","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:0a7b1193531c1e5388c7f05b6c26b1e6cd8274f9307e6b34c3560a15991910b6","target":"graph","created_at":"2026-05-17T23:59:12Z","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"},"paper":{"abstract_excerpt":"The triangle game introduced by Chv\\'{a}tal and Erd\\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\\in\\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alternately Maker claims one edge and thereafter Breaker claims $q$ edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chv\\'{a}tal and Erd\\H{o}s (1978) proved that for $q<\\sqrt{2n+2}-5/2\\approx 1.414\\sqrt{n}$ Maker has a winning strategy, and for $q\\geq 2\\sqrt{n}$ Breaker has a winning strategy. ","authors_text":"Anand Srivastav, Christian Glazik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","title":"A new Bound for the Maker-Breaker Triangle Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01382","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:3295da6be2a5cdcb739e8c681bfadcf250a48bb38edf7c67d0941eb49b3baf19","target":"record","created_at":"2026-05-17T23:59:12Z","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":"eab02d5bc37451e54a256a78cc84d168589e346dad4120c380d4399ba3764902","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","title_canon_sha256":"36173f0bc72247aa42e3f8862934a9de0af80995a44fd0970c891977fdd6f483"},"schema_version":"1.0","source":{"id":"1812.01382","kind":"arxiv","version":1}},"canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","first_computed_at":"2026-05-17T23:59:12.621246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:12.621246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t9NdmBH4KP6pjFpGZ62L55iAR/OEQGx4LL8W63N3Vl976HzdEZHb71vtfkLr0jXw8k6pSqrw5udMbvYluvsFAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:12.621763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3295da6be2a5cdcb739e8c681bfadcf250a48bb38edf7c67d0941eb49b3baf19","sha256:0a7b1193531c1e5388c7f05b6c26b1e6cd8274f9307e6b34c3560a15991910b6"],"state_sha256":"dac13948bae5fffb02e6ec22ebc27d4a928e25e9512cd485ea8190f2288bb47f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Za3jfzVNu4Q/udXTi8yA41veaR8PHU7+eaD2lkID1fM9l45QmaV2j0vcINbJcmI9Nwv0YJEPW1Qdi9ObevWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T01:04:27.011528Z","bundle_sha256":"c2ceec658830b07b2d455c206402cf6706755a0cad74e91aa9564bf525dea1cf"}}