{"as_of":"2026-08-22T00:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4b42d78031f53a91f88877e23198175b6eebcf6a4ec85ad4ff2ae50d74ce040f","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:12:58.254621Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.18569/citation-record","integrity":"/paper/2607.18569/integrity","json":"/paper/2607.18569/citation-record.json","paper":"/paper/2607.18569"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:53.907529Z","title":"More Asymmetry Yields Faster Matrix Multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:53.907529Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:edfc5a37eef1c75ae9a0c387053711f78e6f42622763e3a59bcea5d762423d35","observation_id":"32167deb-5346-4f63-a8b4-d28415b70796","resolution":{"observed_at":"2026-08-01T15:12:53.907529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.37236/559","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"OntheChvátal-ErdösTriangleGame.Electron.J.Comb.,18(1),2011","venue":"The Electronic Journal of Combinatorics","work_id":"802685c6-e7d7-46db-a237-1042244ad615","year":2011},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:53.971808Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:8103d709357dc1f4e3472bed20f99f519aa4262f5766ed08a696bb67c03f5b8b","observation_id":"09e28232-06c5-47ee-b92f-416fb307c5f1","resolution":{"observed_at":"2026-08-01T15:13:22.315377Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:54.100692Z","title":"O(n2.7799) Complexity for n*n Approximate Matrix Multiplication.Inf","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.100692Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:c18da1f52c5f3034a12003207c5dd334e829e96bcb9d3e7713b6e044ef2191b1","observation_id":"bd5345f0-b874-44af-a61c-1c3ec139f885","resolution":{"observed_at":"2026-08-01T15:12:54.100692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2009.10.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Seymour, and Robin Thomas","venue":"Journal of Combinatorial Theory Series B","work_id":"129def3b-5c24-4a33-9aae-ada8d77fd86b","year":2010},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.212118Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:4e8637b3cff680dd288c044e54cfcf38be968dedd1dcda0425154bccf3767133","observation_id":"ddaf2be1-bf40-42f1-9f25-b2232fde97fc","resolution":{"observed_at":"2026-08-01T15:13:22.050592Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:54.349701Z","title":"On the Asymptotic Complexity of Matrix multiplication (Extended Summary)","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.349701Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:fde556b6143faad990b585c3d455e67052d42d6e187151347298f2089704ec68","observation_id":"5e576dae-fd2c-49a1-9367-dbb49d8a67f7","resolution":{"observed_at":"2026-08-01T15:12:54.349701Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:54.498766Z","title":"TowardsOptimalOutput-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.498766Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:d2f54a3c3b2ecb4ac4c1a1c6bd00206d8c55315c191995a11090efce417381b9","observation_id":"cc3d7ae1-8fba-4963-a9ee-6f537f84dde1","resolution":{"observed_at":"2026-08-01T15:12:54.498766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:54.651633Z","title":"Complexity of Maker-Breaker games on edge sets of graphs.Discret","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.651633Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:3764637f647642c4e1504393ae480c446e4e73ef1b39b63252ba43f6d4c13d28","observation_id":"752b4553-352a-4f42-9d0e-7a2c38aae272","resolution":{"observed_at":"2026-08-01T15:12:54.651633Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.05.009","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the complexity of fixed parameter clique and dominating set.Theoretical Computer Science, 326(1):57–67, 2004.doi:10.1016/j.tcs.2004.05.009","venue":"Theoretical Computer Science","work_id":"e1425afc-2395-4319-87b8-02222021323b","year":2004},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:54.822157Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:535503dddda41d47516d5fc424241d749f8d33d2369ba02b2a9ace11fbc5d5c6","observation_id":"36c38fcb-3b0e-4e22-83d5-8ab53580de83","resolution":{"observed_at":"2026-08-01T15:13:21.929579Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:55.020314Z","title":"Selfridge","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.020314Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:3538d7434bb28036f64d7c5e74f5bd66caf59d9ffdcc805476839d5e9e7abdd5","observation_id":"b1331c2b-6b1a-4141-9f53-5092d7266f09","resolution":{"observed_at":"2026-08-01T15:12:55.020314Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.13819","last_updated":"2026-04-12T07:47:47Z","snapshot_observed_at":"2026-08-16T20:37:11.821065Z","submitted_at":"2025-09-17T08:36:11Z","title":"4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.13819","snapshot_observed_at":"2026-08-01T15:12:55.237577Z","title":"4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete.CoRR, abs/2509.13819, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.237577Z"},"links":{"cited_paper":"/paper/2509.13819","citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:4b166bc6c4a49302f5af1825173f47dad60701dfe3b06b47e5ed7b670fd5e1d6","observation_id":"1b54b81e-9360-4311-b3bd-538b267cf71a","resolution":{"observed_at":"2026-08-01T15:12:55.237577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.12819","last_updated":"2026-07-11T15:41:08Z","snapshot_observed_at":"2026-08-16T16:29:46.774446Z","submitted_at":"2022-09-26T16:26:40Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.12819","snapshot_observed_at":"2026-08-01T15:12:55.441245Z","title":"Maker-Breaker is solved in polynomial time on hypergraphs of rank 3.CoRR, abs/2209.12819, 2025.arXiv:2209.12819","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.441245Z"},"links":{"cited_paper":"/paper/2209.12819","citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:37f3ea548d0f5616e9541e90d69c6742c4c71ecb535762cab81f0de03e4a8bf9","observation_id":"86f3387e-424c-476e-9d46-fbf7282c14fe","resolution":{"observed_at":"2026-08-01T15:12:55.441245Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:55.652037Z","title":"A new bound for the Maker-Breaker triangle game.Eur","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.652037Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:c1b0ab9f12f150bc3dee17fb1d54d1534454a9882d4f849df28b8f92c538249c","observation_id":"ee827ec6-1e1a-47f6-b670-219aef0bb99d","resolution":{"observed_at":"2026-08-01T15:12:55.652037Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:55.913345Z","title":"On the number of triangles in𝑘4-free graphs.CoRR, abs/2509.12100, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:55.913345Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:476790f1f6946ef8b6c82aeb092b61372e602891927217539682d541c28f50fc","observation_id":"53840470-6370-4fbb-b0d9-bc4fefedb67d","resolution":{"observed_at":"2026-08-01T15:12:55.913345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-0348-0825-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Birkhäuser Basel, 2014.doi:10.1007/978-3-0348-0825-5","venue":"Oberwolfach Seminars","work_id":"cc62bb66-3772-450d-be13-299fadebaf53","year":2014},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.112320Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:78c02396549bc13f5f40ffcf8eba696d156388b95615752a726e945120af77c8","observation_id":"abb09ad3-5542-4b2d-81d1-1af1cff05365","resolution":{"observed_at":"2026-08-01T15:13:21.767756Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:56.342199Z","title":"Hopcroft and Robert Endre Tarjan","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.342199Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:6c288d029d3fa5be7ac1d191523e70452d6dbe7cdf9dd7e85d11ba8d4aa8ff36","observation_id":"393633f6-189d-4859-a125-94deb2f56ec8","resolution":{"observed_at":"2026-08-01T15:12:56.342199Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:56.582501Z","title":"Finding a Minimum Circuit in a Graph.SIAM J","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.582501Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:3b0d003b38568fb7e49f27eaf3ec30b87d07156350f777203161e6af99252622","observation_id":"fb854d87-d37f-4559-8ef5-2bd3687a79bc","resolution":{"observed_at":"2026-08-01T15:12:56.582501Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20271","last_updated":"2025-02-27T16:57:05Z","snapshot_observed_at":"2026-08-16T12:54:34.095856Z","submitted_at":"2025-02-27T16:57:05Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20271","snapshot_observed_at":"2026-08-01T15:12:56.751500Z","title":"Solving Maker-Breaker Games on 5-uniform hypergraphs is PSPACE-complete.CoRR, abs/2502.20271, 2025.arXiv:2502.20271","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.751500Z"},"links":{"cited_paper":"/paper/2502.20271","citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:128719b90a246d790aec380535bad5982503fde7255cb0b7ab881ee29827e836","observation_id":"da6a2a39-c039-4fcc-b63f-039178809727","resolution":{"observed_at":"2026-08-01T15:12:56.751500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:56.953724Z","title":"Phd thesis, Freie Universität Berlin, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:56.953724Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:69d93d89b7025aa5224b6c77b439e3bb919a3c69c68ce3e58b5c9744dbe9bc54","observation_id":"b4148050-c8fc-47bc-aff0-2c61847e02de","resolution":{"observed_at":"2026-08-01T15:12:56.953724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:57.166594Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:57.166594Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:412f59e2777c13d53b2bf74ae1d992f92b07f140abbea0c7d34f9efdfebee52c","observation_id":"2a1c7c9c-e1df-41ec-9cb1-73032632bbc8","resolution":{"observed_at":"2026-08-01T15:12:57.166594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rsa.20489","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"AthresholdfortheMaker-Breakercliquegame.RandomStruct.Algorithms,45(2):318–341, 2014.doi:10.1002/RSA.20489","venue":"Random Structures and Algorithms","work_id":"ad292258-8b40-44f8-8779-4eba2740e803","year":2014},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:57.331386Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:e60415a9200bb4e76955b15fdd2f5d070fe866669d8ca2e82f515cdad335fd38","observation_id":"dc2eff71-ee90-4c57-a0a6-37f49b6e5084","resolution":{"observed_at":"2026-08-01T15:13:21.648894Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1978.34","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"6769d318-4dfa-43f5-9ce0-25b67f5fb22e","year":1978},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:57.541066Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:908a703b7579652cd067b3ab5ac0c8e2d6da46ee9b20beb656aef349854a4343","observation_id":"83c527ed-abf8-4655-ab54-b5f861a6035e","resolution":{"observed_at":"2026-08-01T15:13:21.478689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00493-023-00026-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"6-UniformMaker-BreakerGameisPSPACE-Complete.Combinatorica,43(3):595–612, 2023.doi:10.1007/S00493-023-00026-7","venue":"COMBINATORICA","work_id":"c2f0e6a8-b3f3-4f35-a6a2-a2da3c1c12f3","year":2023},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:57.742781Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:0cd9e3b00e4d0499f0a2ceef917caefb27c5c6a14360dd2f77b8adfee77800af","observation_id":"140a2353-c757-4fe2-8e61-35663ebb95f6","resolution":{"observed_at":"2026-08-01T15:13:21.196303Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:57.916569Z","title":"Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication.SIAM J","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:57.916569Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:d7430957cf0078f4a388c8b858a90b10cb67b49a23ead9a7ccd46614e8384ea3","observation_id":"56efdbed-b73c-4205-b8cb-f1bf71e28503","resolution":{"observed_at":"2026-08-01T15:12:57.916569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:58.050460Z","title":"Schaefer","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:58.050460Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:faf1883bad477ccd9c98a225b079a77a70207a59b6d653ac000a0b6e52aff145","observation_id":"084e7b68-1b18-4c9d-b3d0-59a5923e3670","resolution":{"observed_at":"2026-08-01T15:12:58.050460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:58.185865Z","title":"Partial and Total Matrix Multiplication.SIAM J","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:58.185865Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:29682f92ca29d999b05ef9e798142f7522224ab74ab590bba4c3314b7b9506d9","observation_id":"2b9ee4aa-f1d3-42ef-a9b7-07f1f90974ac","resolution":{"observed_at":"2026-08-01T15:12:58.185865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T15:12:58.254621Z","title":"Multiplying Matrices Faster Than Coppersmith-Winograd","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T15:12:58.254621Z"},"links":{"citing_paper":"/paper/2607.18569"},"observation_digest":"sha256:839d50c19711c4257a7428bb7db8aeb98c7176239af85d9130865cc9c2a0cac8","observation_id":"577d8c96-fcd4-4053-a6ca-277ae346b10e","resolution":{"observed_at":"2026-08-01T15:12:58.254621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18569","last_updated":"2026-07-20T23:04:55Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T20:38:02.505841Z","submitted_at":"2026-07-20T23:04:55Z","title":"Faster Algorithms for Deciding the Unbiased Maker-Breaker Triangle Game on General Graphs"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":6,"verified_fuzzy":0},"total_outbound_references":26},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2607.18569."}