{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3T7LF3BRKPY6L6OTHD77W5TS63","short_pith_number":"pith:3T7LF3BR","canonical_record":{"source":{"id":"1409.8141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T14:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"9a1ffa2f1061261368d027e7c4e71eec4a49241818a331e0168fd30cb17be9b2","abstract_canon_sha256":"0f09eb6be229d8c8a09ddf96125d9e6e67c59f70d6d73a889c75fad7bde16e2e"},"schema_version":"1.0"},"canonical_sha256":"dcfeb2ec3153f1e5f9d338fffb7672f6d38e78bcac5aba7fdd406c1ca7f0f39a","source":{"kind":"arxiv","id":"1409.8141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8141","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8141v1","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8141","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"3T7LF3BRKPY6","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3T7LF3BRKPY6L6OT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3T7LF3BR","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3T7LF3BRKPY6L6OTHD77W5TS63","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T14:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"9a1ffa2f1061261368d027e7c4e71eec4a49241818a331e0168fd30cb17be9b2","abstract_canon_sha256":"0f09eb6be229d8c8a09ddf96125d9e6e67c59f70d6d73a889c75fad7bde16e2e"},"schema_version":"1.0"},"canonical_sha256":"dcfeb2ec3153f1e5f9d338fffb7672f6d38e78bcac5aba7fdd406c1ca7f0f39a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:33.640251Z","signature_b64":"hXraAy9NzzvWe3gXnr4/FqdYNxGiuUHTAk/NE+U80BMAd2I+XE96m7fQIx3EHUTCQDok0kMD/IMlGHlAe6T+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcfeb2ec3153f1e5f9d338fffb7672f6d38e78bcac5aba7fdd406c1ca7f0f39a","last_reissued_at":"2026-05-18T02:41:33.639902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:33.639902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8141","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-18T02:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbuAayOn5cdMPjOcC+9JqAbNf482ZY0wz50ikdO0ZZbtTXarn62oFAZGMr/z+ciyHJY5FiatFqpjF++GHZOQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:30:40.819927Z"},"content_sha256":"162e08499894fe70de4d30706475e829d04c5382e93780f804893c6ea1e9c3e3","schema_version":"1.0","event_id":"sha256:162e08499894fe70de4d30706475e829d04c5382e93780f804893c6ea1e9c3e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3T7LF3BRKPY6L6OTHD77W5TS63","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An upper bound on the extremal version of Hajnal's triangle-free game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csaba Bir\\'o, D. Jacob Wildstrom, Paul Horn","submitted_at":"2014-09-29T14:53:27Z","abstract_excerpt":"A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maximal triangle-free graph is reached. The goal of one player is to end the game as soon as possible, while the other player is trying to prolong the game. With optimal play, the length of the game (number of edges played) is called the $K_3$ game saturation number.\n  In this paper we prove an upper bound for this number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8141","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-18T02:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7gT18qyevjSnp0qpsUWZa6yK5QWDDH9FpxEvUgE2x3F8HN1pE5LN3OIEkHpsEF9FR4nprHiheGnZMHQ4tzlCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:30:40.820271Z"},"content_sha256":"acf03232ea103ea31a18900e392a1be3da51b1db86c13d7f8fe60463b7b562e4","schema_version":"1.0","event_id":"sha256:acf03232ea103ea31a18900e392a1be3da51b1db86c13d7f8fe60463b7b562e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3T7LF3BRKPY6L6OTHD77W5TS63/bundle.json","state_url":"https://pith.science/pith/3T7LF3BRKPY6L6OTHD77W5TS63/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3T7LF3BRKPY6L6OTHD77W5TS63/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-06-03T14:30:40Z","links":{"resolver":"https://pith.science/pith/3T7LF3BRKPY6L6OTHD77W5TS63","bundle":"https://pith.science/pith/3T7LF3BRKPY6L6OTHD77W5TS63/bundle.json","state":"https://pith.science/pith/3T7LF3BRKPY6L6OTHD77W5TS63/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3T7LF3BRKPY6L6OTHD77W5TS63/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3T7LF3BRKPY6L6OTHD77W5TS63","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":"0f09eb6be229d8c8a09ddf96125d9e6e67c59f70d6d73a889c75fad7bde16e2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T14:53:27Z","title_canon_sha256":"9a1ffa2f1061261368d027e7c4e71eec4a49241818a331e0168fd30cb17be9b2"},"schema_version":"1.0","source":{"id":"1409.8141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8141","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8141v1","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8141","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"3T7LF3BRKPY6","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3T7LF3BRKPY6L6OT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3T7LF3BR","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:acf03232ea103ea31a18900e392a1be3da51b1db86c13d7f8fe60463b7b562e4","target":"graph","created_at":"2026-05-18T02:41:33Z","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":"A game starts with the empty graph on $n$ vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maximal triangle-free graph is reached. The goal of one player is to end the game as soon as possible, while the other player is trying to prolong the game. With optimal play, the length of the game (number of edges played) is called the $K_3$ game saturation number.\n  In this paper we prove an upper bound for this number.","authors_text":"Csaba Bir\\'o, D. Jacob Wildstrom, Paul Horn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T14:53:27Z","title":"An upper bound on the extremal version of Hajnal's triangle-free game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8141","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:162e08499894fe70de4d30706475e829d04c5382e93780f804893c6ea1e9c3e3","target":"record","created_at":"2026-05-18T02:41:33Z","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":"0f09eb6be229d8c8a09ddf96125d9e6e67c59f70d6d73a889c75fad7bde16e2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-29T14:53:27Z","title_canon_sha256":"9a1ffa2f1061261368d027e7c4e71eec4a49241818a331e0168fd30cb17be9b2"},"schema_version":"1.0","source":{"id":"1409.8141","kind":"arxiv","version":1}},"canonical_sha256":"dcfeb2ec3153f1e5f9d338fffb7672f6d38e78bcac5aba7fdd406c1ca7f0f39a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcfeb2ec3153f1e5f9d338fffb7672f6d38e78bcac5aba7fdd406c1ca7f0f39a","first_computed_at":"2026-05-18T02:41:33.639902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:33.639902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXraAy9NzzvWe3gXnr4/FqdYNxGiuUHTAk/NE+U80BMAd2I+XE96m7fQIx3EHUTCQDok0kMD/IMlGHlAe6T+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:33.640251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:162e08499894fe70de4d30706475e829d04c5382e93780f804893c6ea1e9c3e3","sha256:acf03232ea103ea31a18900e392a1be3da51b1db86c13d7f8fe60463b7b562e4"],"state_sha256":"eaa68d7958252f27ea1686e17f00cc1ceabd77763a693a27b886ef8ee5c1c6b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JaoHHhougRglG6pmSi4Z+9f2icnXLRXsFhQp6JUImOQLxjtE5hki6nF3aptjzlGpuc/Hrb5AzUOvtCw9PcCKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:30:40.822196Z","bundle_sha256":"9e99bb95cfde9ade8bc59aa957a94a216def827d96efecf41fb2d741e15687ec"}}