{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YCQGSN7K3GYY6Y35TCI7DPLIRW","short_pith_number":"pith:YCQGSN7K","schema_version":"1.0","canonical_sha256":"c0a06937ead9b18f637d9891f1bd688d8c392400860140d6caf10120b89a99ab","source":{"kind":"arxiv","id":"2607.18569","version":1},"attestation_state":"computed","paper":{"title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anand Srivastav, Julian Christoph Brinkmann","submitted_at":"2026-07-20T23:04:55Z","abstract_excerpt":"In this paper, we present new polynomial-time algorithms for determining the winner of the unbiased triangle game played on the edge set of general graphs. To that end, we propose to view the game through the edge-triangle incidence graph instead of the standard hypergraph model. We identify a necessary and sufficient winning condition for Maker in terms of the edge-triangle incidence graph and show that winning strategies achieving this condition as fast as possible play monotonically in the sense that they only consider monotonically decreasing connected subgraphs of the edge-triangle incide"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.18569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-07-20T23:04:55Z","cross_cats_sorted":[],"title_canon_sha256":"029f304c8e3922c64a60e17e2a5a578f297e3fe1145770c20a341770ba514616","abstract_canon_sha256":"75eb47f112f037e5beaa988c2e67bcdb1a93e037fe9750e990b1c63b7e984164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:54.721104Z","signature_b64":"WcmKZCkYdSJswkOOfw22ntW0dbuTLrpoQpA+cKOe0cP9cTSZuj6XoKmbZoZuPeshMJdYTdn/eWfKdnLY3hxtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0a06937ead9b18f637d9891f1bd688d8c392400860140d6caf10120b89a99ab","last_reissued_at":"2026-07-22T00:22:54.720360Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:54.720360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anand Srivastav, Julian Christoph Brinkmann","submitted_at":"2026-07-20T23:04:55Z","abstract_excerpt":"In this paper, we present new polynomial-time algorithms for determining the winner of the unbiased triangle game played on the edge set of general graphs. To that end, we propose to view the game through the edge-triangle incidence graph instead of the standard hypergraph model. We identify a necessary and sufficient winning condition for Maker in terms of the edge-triangle incidence graph and show that winning strategies achieving this condition as fast as possible play monotonically in the sense that they only consider monotonically decreasing connected subgraphs of the edge-triangle incide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18569","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/2607.18569/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.18569","created_at":"2026-07-22T00:22:54.720761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18569v1","created_at":"2026-07-22T00:22:54.720761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18569","created_at":"2026-07-22T00:22:54.720761+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCQGSN7K3GYY","created_at":"2026-07-22T00:22:54.720761+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCQGSN7K3GYY6Y35","created_at":"2026-07-22T00:22:54.720761+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCQGSN7K","created_at":"2026-07-22T00:22:54.720761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW","json":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW.json","graph_json":"https://pith.science/api/pith-number/YCQGSN7K3GYY6Y35TCI7DPLIRW/graph.json","events_json":"https://pith.science/api/pith-number/YCQGSN7K3GYY6Y35TCI7DPLIRW/events.json","paper":"https://pith.science/paper/YCQGSN7K"},"agent_actions":{"view_html":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW","download_json":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW.json","view_paper":"https://pith.science/paper/YCQGSN7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18569&json=true","fetch_graph":"https://pith.science/api/pith-number/YCQGSN7K3GYY6Y35TCI7DPLIRW/graph.json","fetch_events":"https://pith.science/api/pith-number/YCQGSN7K3GYY6Y35TCI7DPLIRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW/action/storage_attestation","attest_author":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW/action/author_attestation","sign_citation":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW/action/citation_signature","submit_replication":"https://pith.science/pith/YCQGSN7K3GYY6Y35TCI7DPLIRW/action/replication_record"}},"created_at":"2026-07-22T00:22:54.720761+00:00","updated_at":"2026-07-22T00:22:54.720761+00:00"}