{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6Q3W7AKS4QVLYRAJFUMISXQCWH","short_pith_number":"pith:6Q3W7AKS","canonical_record":{"source":{"id":"2505.21306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"e59bb409ef63caab994400405a783bdb46f20b7113b34b4a750e18b3b87c9ced","abstract_canon_sha256":"51321939e9a1334191f54b66a8afa1be47bf4eed994c799d645726357b0536b9"},"schema_version":"1.0"},"canonical_sha256":"f4376f8152e42abc44092d18895e02b1ef064ae4dacc8e03a23e664b5fee224c","source":{"kind":"arxiv","id":"2505.21306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21306","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21306v1","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21306","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"6Q3W7AKS4QVL","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_16","alias_value":"6Q3W7AKS4QVLYRAJ","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_8","alias_value":"6Q3W7AKS","created_at":"2026-07-05T11:10:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6Q3W7AKS4QVLYRAJFUMISXQCWH","target":"record","payload":{"canonical_record":{"source":{"id":"2505.21306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"e59bb409ef63caab994400405a783bdb46f20b7113b34b4a750e18b3b87c9ced","abstract_canon_sha256":"51321939e9a1334191f54b66a8afa1be47bf4eed994c799d645726357b0536b9"},"schema_version":"1.0"},"canonical_sha256":"f4376f8152e42abc44092d18895e02b1ef064ae4dacc8e03a23e664b5fee224c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:10:39.961185Z","signature_b64":"Xy867JOSLQ3TlgFRG/4eE1l22NR8iE928LPoNkk9afTZb9NYDEze+vDuuTr4zeDwESXHheI2HYflny+zsCL0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4376f8152e42abc44092d18895e02b1ef064ae4dacc8e03a23e664b5fee224c","last_reissued_at":"2026-07-05T11:10:39.960617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:10:39.960617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.21306","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-05T11:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSIBs+01b0Fy+mSQe8VB2gBsGmX+Oy60SSFmz5lEwjAEoYa1oQ6a+5ho0EF1tQqqJ8c5BUHGeOsyQ/0Cv9xiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:31:29.731665Z"},"content_sha256":"7e79146cee4cc98f844c211f4dc2c247d3a539efc4d52fc2a6cf94d6b9c74ac6","schema_version":"1.0","event_id":"sha256:7e79146cee4cc98f844c211f4dc2c247d3a539efc4d52fc2a6cf94d6b9c74ac6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6Q3W7AKS4QVLYRAJFUMISXQCWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structure-biased Maker-Breaker Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Francesca Yu, Wesley Pegden","submitted_at":"2025-05-27T15:06:42Z","abstract_excerpt":"In classical Maker-Breaker games on graphs, Maker and Breaker take turns claiming edges; Maker's goal is to claim all of some structure (e.g., a spanning tree, Hamilton cycle, etc.), while Breaker aims to stop her. The standard question considered is how powerful a Breaker Maker can defeat; i.e., for the $(1:b)$-biased game where Breaker takes $b$ edges per turn, how large can $b$ be for Maker to still have a winning strategy, for various possible goal sets?\n  We introduce a variant of this question in which Breaker is required to choose their multiple edges as the edges of (a subgraph of) a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21306","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/2505.21306/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-05T11:10:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmjOltNxoP1sScpde5Reb8csV6p1VRJHygwQQhudXSpNg98WHci0kNuVN/zMdqZBjD81I3ZnsQS12mAFxLNbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T15:31:29.732005Z"},"content_sha256":"37c88869e1a517669e07e510904d577407c1bd8e0007712b263f00fe1fea1548","schema_version":"1.0","event_id":"sha256:37c88869e1a517669e07e510904d577407c1bd8e0007712b263f00fe1fea1548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/bundle.json","state_url":"https://pith.science/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/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-19T15:31:29Z","links":{"resolver":"https://pith.science/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH","bundle":"https://pith.science/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/bundle.json","state":"https://pith.science/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Q3W7AKS4QVLYRAJFUMISXQCWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6Q3W7AKS4QVLYRAJFUMISXQCWH","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":"51321939e9a1334191f54b66a8afa1be47bf4eed994c799d645726357b0536b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:06:42Z","title_canon_sha256":"e59bb409ef63caab994400405a783bdb46f20b7113b34b4a750e18b3b87c9ced"},"schema_version":"1.0","source":{"id":"2505.21306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.21306","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"arxiv_version","alias_value":"2505.21306v1","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21306","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_12","alias_value":"6Q3W7AKS4QVL","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_16","alias_value":"6Q3W7AKS4QVLYRAJ","created_at":"2026-07-05T11:10:39Z"},{"alias_kind":"pith_short_8","alias_value":"6Q3W7AKS","created_at":"2026-07-05T11:10:39Z"}],"graph_snapshots":[{"event_id":"sha256:37c88869e1a517669e07e510904d577407c1bd8e0007712b263f00fe1fea1548","target":"graph","created_at":"2026-07-05T11:10:39Z","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/2505.21306/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In classical Maker-Breaker games on graphs, Maker and Breaker take turns claiming edges; Maker's goal is to claim all of some structure (e.g., a spanning tree, Hamilton cycle, etc.), while Breaker aims to stop her. The standard question considered is how powerful a Breaker Maker can defeat; i.e., for the $(1:b)$-biased game where Breaker takes $b$ edges per turn, how large can $b$ be for Maker to still have a winning strategy, for various possible goal sets?\n  We introduce a variant of this question in which Breaker is required to choose their multiple edges as the edges of (a subgraph of) a g","authors_text":"Francesca Yu, Wesley Pegden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:06:42Z","title":"Structure-biased Maker-Breaker Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21306","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:7e79146cee4cc98f844c211f4dc2c247d3a539efc4d52fc2a6cf94d6b9c74ac6","target":"record","created_at":"2026-07-05T11:10:39Z","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":"51321939e9a1334191f54b66a8afa1be47bf4eed994c799d645726357b0536b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-27T15:06:42Z","title_canon_sha256":"e59bb409ef63caab994400405a783bdb46f20b7113b34b4a750e18b3b87c9ced"},"schema_version":"1.0","source":{"id":"2505.21306","kind":"arxiv","version":1}},"canonical_sha256":"f4376f8152e42abc44092d18895e02b1ef064ae4dacc8e03a23e664b5fee224c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4376f8152e42abc44092d18895e02b1ef064ae4dacc8e03a23e664b5fee224c","first_computed_at":"2026-07-05T11:10:39.960617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:10:39.960617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xy867JOSLQ3TlgFRG/4eE1l22NR8iE928LPoNkk9afTZb9NYDEze+vDuuTr4zeDwESXHheI2HYflny+zsCL0CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:10:39.961185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.21306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e79146cee4cc98f844c211f4dc2c247d3a539efc4d52fc2a6cf94d6b9c74ac6","sha256:37c88869e1a517669e07e510904d577407c1bd8e0007712b263f00fe1fea1548"],"state_sha256":"b8c45aa9f9beb5e54acf018244c3d15aaa9c390f2988d387bfb2c8205fac56b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NWK7bm6MXB/VBoNQ7eb9dwqS7TZYfNWDPzi0tT9lKKPGx3twdt00j6Dsxuei58cNOvBKBV1VA4uBh8VItncAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T15:31:29.735040Z","bundle_sha256":"ae74ae00b3eb93c39d54130ce461f1b065e39767c0000ce55b19745210efa0f0"}}