{"as_of":"2026-08-12T18:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:878795d68f25556cd22d4d1fd280fdaed62cc0a8b21ac5167afd05b6cfd21618","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T06:11:59.642462Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:27:08.464094Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T11:27:08.504354Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"cited_work":{"arxiv_id":"2608.02503","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.02503","snapshot_observed_at":"2026-08-05T11:27:08.504354Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","venue":"cs.DS","work_id":"369f7d56-e179-4824-887e-11a46608ecff","year":2026},"citing_paper":{"arxiv_id":"2608.03848","last_updated":"2026-08-04T15:52:31Z","snapshot_observed_at":"2026-08-11T17:09:54.633318Z","submitted_at":"2026-08-04T15:52:31Z","title":"The Hard-Core Model on Bipartite Spectral Expanders: Counting and Sampling at All Fugacities","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T11:27:08.464094Z"},"links":{"cited_paper":"/paper/2608.02503","citing_paper":"/paper/2608.03848"},"observation_digest":"sha256:decb731845bd5c6316650c823a8989123f2902f79b6bace195145566270dd160","observation_id":"7d9aa399-d4a7-48fe-900a-277f9c2e942b","resolution":{"observed_at":"2026-08-05T11:27:08.509456Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2608.02503/citation-record","integrity":"/paper/2608.02503/integrity","json":"/paper/2608.02503/citation-record.json","paper":"/paper/2608.02503"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T06:11:59.453014Z","title":"Springer, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.453014Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:27659a0753cc191ff71654d53251ed6a10809919678ffff87830a10af48ec2ac","observation_id":"55a0fe21-bf3e-4ba4-897d-627aeeb45e91","resolution":{"observed_at":"2026-08-04T06:11:59.453014Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.01281","last_updated":"2017-03-21T17:19:56Z","snapshot_observed_at":"2026-07-06T05:13:22.674148Z","submitted_at":"2016-10-05T06:34:02Z","title":"A Quantitative Local Limit Theorem for Triangles in Random Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.01281","snapshot_observed_at":"2026-08-04T06:11:59.459121Z","title":"A quantitative local limit theorem for triangles in random graphs, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.459121Z"},"links":{"cited_paper":"/paper/1610.01281","citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:34a27619eb3f386e169d23f834f3652333095162aac9cc2923752cc47de26ae2","observation_id":"13e17746-ac62-4f02-b33b-b6faed169fdb","resolution":{"observed_at":"2026-08-04T06:11:59.459121Z","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-04T06:11:59.464406Z","title":"# bis-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region.Journal of Computer and System Sciences, 82(5):690–711, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.464406Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:814e2dc21932181f322f155969b1e877d446d305feeb4771ac4ee1bd15d5ca83","observation_id":"aa8add24-ce43-450c-b64d-f158d7c41763","resolution":{"observed_at":"2026-08-04T06:11:59.464406Z","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-04T06:11:59.469576Z","title":"Pirogov–Sinai theory for the hard-core model beyond lattices.Communications in Mathematical Physics, 407:129, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.469576Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:6c9f1c5e7a63f561d9dcc0f05ecbb1079d4f14dda47989af0be00e8b7784388c","observation_id":"1e6e9763-553c-40fb-8973-8298adaefc69","resolution":{"observed_at":"2026-08-04T06:11:59.469576Z","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-04T06:11:59.475269Z","title":"Counting independent sets in unbalanced bipartite graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.475269Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:599d6d7d1c43377e17de99a7bfea731fc65cd880adbe02b248ee03c2312eb6bb","observation_id":"e01080c6-2dc2-4c13-bd70-6604cf406152","resolution":{"observed_at":"2026-08-04T06:11:59.475269Z","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-04T06:11:59.480814Z","title":"Computational thresholds for the fixed-magnetization ising model","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.480814Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:8524c2a71a94c87f243f3e1e7107853193631fa7c27f09d6c89918cf91d664a8","observation_id":"39030114-7585-4245-a791-9e19254c4655","resolution":{"observed_at":"2026-08-04T06:11:59.480814Z","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-04T06:11:59.486472Z","title":"Rapid mixing at the uniqueness threshold","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.486472Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:e5e1e9769fa57a714d0747d1c04bc41f98ceb23c5b3eaf93e4f5337e1ff1b271","observation_id":"49d058c0-36fc-48d9-9180-a53ea82dbaf3","resolution":{"observed_at":"2026-08-04T06:11:59.486472Z","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-04T06:11:59.491600Z","title":"Uniqueness and rapid mixing in the bipartite hardcore model (extended abstract)","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.491600Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:5c939a6fb858bbd06e2d216f4e3b7be6e2195cbecd7aedd574e3d1ba90a249aa","observation_id":"614a6775-36fc-4529-9795-322bdb4a4669","resolution":{"observed_at":"2026-08-04T06:11:59.491600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.02746","last_updated":"2026-04-03T05:38:57Z","snapshot_observed_at":"2026-07-06T22:52:02.162758Z","submitted_at":"2026-04-03T05:38:57Z","title":"Zero-Freeness of the Hard-Core Model with Bounded Connective Constant","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.02746","snapshot_observed_at":"2026-08-04T06:11:59.497036Z","title":"Zero-freeness of the hard-core model with bounded connective constant, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.497036Z"},"links":{"cited_paper":"/paper/2604.02746","citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:8c29256b760806f2d478f5976d30d9860a2b49e91850bf9e39e6c995ae311483","observation_id":"1a6b4de2-7f80-4d25-8c47-13dd850dc9ba","resolution":{"observed_at":"2026-08-04T06:11:59.497036Z","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-04T06:11:59.502435Z","title":"Sampling colorings and independent sets of random regular bipartite graphs in the non-uniqueness region","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.502435Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:675c8293a4d0863cf9cdd14ef865da75494dcc6fd4bf665d7addb4548d96ae25","observation_id":"8e9c6992-d0f4-4ac8-a2d6-dbc276846b8d","resolution":{"observed_at":"2026-08-04T06:11:59.502435Z","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-04T06:11:59.507744Z","title":"Approximately counting independent sets of a given size in bounded-degree graphs.SIAM Journal on Computing, 52(2):618–640, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.507744Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:faea8fc7b21bf03566ebad8a04efd12ff80c07da9bd6c8675e6ea0f494b7db37","observation_id":"7f3e2337-6b0f-4f78-a109-b8ff95603f79","resolution":{"observed_at":"2026-08-04T06:11:59.507744Z","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-04T06:11:59.512673Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.512673Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:f249fc803a27b610956120d4306ad47168e73f930f48838b4d822b8c42721ac5","observation_id":"9f0440c4-392b-436f-8b5e-6a23d7527f02","resolution":{"observed_at":"2026-08-04T06:11:59.512673Z","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-04T06:11:59.517489Z","title":"The relative complexity of approximate counting problems.Algorithmica, 38(3):471–500, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.517489Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:d04dfe1dbc4f3fe79f5d3408e4af9eb12dfbd9e424655ebd0b320aa00728bd88","observation_id":"570ef8a4-94bf-4d15-a8d1-ede9aa32054a","resolution":{"observed_at":"2026-08-04T06:11:59.517489Z","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-04T06:11:59.522680Z","title":"An approximation trichotomy for boolean #csp.Journal of Computer and System Sciences, 76(3–4):267–277, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.522680Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:7b3083a4850cb92e9bc9b0dba5eb54561f65ef64bc26ecd27d76965729232ddc","observation_id":"198d20c1-465a-4b71-8132-97b174bc9af1","resolution":{"observed_at":"2026-08-04T06:11:59.522680Z","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-04T06:11:59.527148Z","title":"Relations between average case complexity and approximation complexity","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.527148Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:5f37af381f407e3931923b50a3d943c0f724c155348a76b595908dad8ea3cd4d","observation_id":"43c7579f-cdfa-4397-8ac1-29520df1675f","resolution":{"observed_at":"2026-08-04T06:11:59.527148Z","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-04T06:11:59.532074Z","title":"On cutting a few vertices from a graph","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.532074Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:2e601215d5f27b03e23e69d2d6ed8f75bcb4b655589e2c48d8015b9f89d30b49","observation_id":"ce765d4a-d8fd-417b-898e-0cc6dc42a474","resolution":{"observed_at":"2026-08-04T06:11:59.532074Z","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-04T06:11:59.537678Z","title":"Improved inapprox- imability results for counting independent sets in the hard-core model.Random Structures & Algorithms, 45(1):78–110, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.537678Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:9de0919a58875b83b0291a334472c5b458ea1903e2250af95df760b125dfda71","observation_id":"a17e8504-7874-45db-aafb-34a4541e9746","resolution":{"observed_at":"2026-08-04T06:11:59.537678Z","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-04T06:11:59.542503Z","title":"Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region.Journal of the ACM, 62(6):50:1–50:60, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.542503Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:71432cd2ee9a405d19db62f1baa5c46123e04a107b42daa5362b517d90221036","observation_id":"a2f7cdc8-2bd8-47dd-a674-95dfe9aa0824","resolution":{"observed_at":"2026-08-04T06:11:59.542503Z","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-04T06:11:59.547300Z","title":"Inapproximability of the partition function for the antiferromagnetic ising and hard-core models.Combinatorics, Probability and Computing, 25(4):500–559, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.547300Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:58af774668ae456258ae808d9ef30f893edff360b9575a55f85e88bf259c87e9","observation_id":"8a7b33a8-8d28-4c73-9436-98a93a8a579a","resolution":{"observed_at":"2026-08-04T06:11:59.547300Z","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-04T06:11:59.552059Z","title":"Some simplified np-complete problems","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.552059Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:df2438ed144b8f4220d71f4efd336a134aacaba88fb138ca15d0a8a15a54c16a","observation_id":"26305145-22f4-4ea8-8611-a4bb7f35631e","resolution":{"observed_at":"2026-08-04T06:11:59.552059Z","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-04T06:11:59.557458Z","title":"Walter de Gruyter, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.557458Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:1a201a0d1cb12a78c888ef275acf97ffb1fad89578ed68a3e404507eb04760b9","observation_id":"665fe4d7-d992-41b1-8bce-cb2359f1d243","resolution":{"observed_at":"2026-08-04T06:11:59.557458Z","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-04T06:11:59.562080Z","title":"Algorithmic Pirogov–Sinai theory.Probability Theory and Related Fields, 176(3–4):851–895, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.562080Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:85ef73415c3579044ca5a1db1e2d229b7d5bad44661f9e846500dff6d991472f","observation_id":"5b5a4633-49b5-4db8-b058-2d948a2ad510","resolution":{"observed_at":"2026-08-04T06:11:59.562080Z","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-04T06:11:59.567229Z","title":"Optimal mixing of the down-up walk on independent sets of a given size","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.567229Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:7043c5b82293742ee560ef27e9a5ebb579fc1b4309e20b1125fedf3ddd44919b","observation_id":"9890fc48-5867-43f4-b0bc-dc4145b7b916","resolution":{"observed_at":"2026-08-04T06:11:59.567229Z","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-04T06:11:59.572352Z","title":"Approximate counting and sampling via local central limit theorems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.572352Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:b45dce4414dc950ec43bac10bcd8fa44db0de75fe9e0d1bdcfed8defc359d5b5","observation_id":"7e16fc54-3d2b-4239-b100-92d93a84607d","resolution":{"observed_at":"2026-08-04T06:11:59.572352Z","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-04T06:11:59.577299Z","title":"Algorithms for #BIS-hard problems on expander graphs.SIAM Journal on Computing, 49(4):681–710, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.577299Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:b457e2333c71de2fafd82f85b3fba84e3f4d26900f7ab9b0f3be63415d71a293","observation_id":"f4677c60-f46c-4f30-9806-b17e0e65a34a","resolution":{"observed_at":"2026-08-04T06:11:59.577299Z","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-04T06:11:59.582496Z","title":"A refined graph container lemma and applications to the hard-core model on bipartite expanders.Random Structures & Algorithms, 68(1):e70041, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.582496Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:d3e3a3d1d2fe0ea64cc26723174534fb421506e023616c173c29852cb91f3583","observation_id":"52edfbd8-cb56-48cf-8dcc-58dc1edb0555","resolution":{"observed_at":"2026-08-04T06:11:59.582496Z","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-04T06:11:59.587796Z","title":"Approximately counting independent sets in bipartite graphs via graph containers.Random Structures & Algorithms, 63(1):215–241, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.587796Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:873b507987d89ff901667ccebcb836a2d4de57a132426341b278d5ba490d7d71","observation_id":"6cb26281-c8f2-4dc8-8777-e5f028d3b753","resolution":{"observed_at":"2026-08-04T06:11:59.587796Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.21847","last_updated":"2026-04-23T16:37:49Z","snapshot_observed_at":"2026-07-06T23:08:23.939574Z","submitted_at":"2026-04-23T16:37:49Z","title":"Sampling from the Hardcore Model on Random Regular Bipartite Graphs above the Uniqueness Threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.21847","snapshot_observed_at":"2026-08-04T06:11:59.592858Z","title":"Sampling from the hardcore model on random regular bipartite graphs above the uniqueness threshold.arXiv preprint arXiv:2604.21847, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.592858Z"},"links":{"cited_paper":"/paper/2604.21847","citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:1d550d880a1e083b91969ca38ead702a397d664867662752b08518182a22eef6","observation_id":"b502faf7-bb9e-4d0b-aed9-e16c7fc024cc","resolution":{"observed_at":"2026-08-04T06:11:59.592858Z","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-04T06:11:59.598033Z","title":"Fast and slow mixing of the Kawasaki dynamics on bounded-degree graphs.Random Structures & Algorithms, 67(4):e70038, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.598033Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:a9f64c31859dc3e84b5b0d2ed241efbbf80cbe8ddda55335590be55422b231d4","observation_id":"fbac758d-5107-48fc-b8a6-2c82e63fd2a3","resolution":{"observed_at":"2026-08-04T06:11:59.598033Z","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-04T06:11:59.602926Z","title":"Counting independent sets and colorings on random regular bipartite graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.602926Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:171e1655e2c72392190e8381d7798eb77873758e172a921ae3a96b9b84fbc4ec","observation_id":"545b94d9-24dd-400f-96d5-40b07c56b84f","resolution":{"observed_at":"2026-08-04T06:11:59.602926Z","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-04T06:11:59.608569Z","title":"Fptas for #BIS with degree bounds on one side","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.608569Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:fd45fdab1b5555682132503bd54e834e7d67a5addecaa99cbc88c90b5a5ba800","observation_id":"fa7630cd-62b0-4c4f-b921-ce0fc47a80ae","resolution":{"observed_at":"2026-08-04T06:11:59.608569Z","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-04T06:11:59.614177Z","title":"Central limit theorems and the geometry of polynomials.Journal of the European Mathematical Society, 28(5):2261–2305, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.614177Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:1f55071380dc6bb4dc10d5670ba44754385f0917873c754ca42c4848969a44aa","observation_id":"417d08a0-b39e-4f9f-a7e7-d71b72be75d1","resolution":{"observed_at":"2026-08-04T06:11:59.614177Z","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-04T06:11:59.618874Z","title":"Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.SIAM Journal on Computing, 46(6):1893–1919, 2017","venue":null,"work_id":null,"year":1919},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.618874Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:39dd7de22b42079c593a5e9cee92fc4746801dcfea75619549a7f4e9822227a3","observation_id":"e4a60ed9-ef41-4940-a459-f4b21c0ec4f4","resolution":{"observed_at":"2026-08-04T06:11:59.618874Z","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-04T06:11:59.623823Z","title":"On the hardness of finding balanced independent sets in random bipartite graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.623823Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:fedf67dfb1964190a88887d0c82441f9f898a4e0057420b84147af75317b550b","observation_id":"0e46b739-d839-46d3-8d05-c890cd230a64","resolution":{"observed_at":"2026-08-04T06:11:59.623823Z","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-04T06:11:59.628402Z","title":"Spatial mixing and the connective constant: Optimal bounds.Probability Theory and Related Fields, 168(1–2):153–197, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.628402Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:ef0e1d1d8343492f900e92e2490fd8c18b2e6bd3640f7e8cedbce8494563a7c5","observation_id":"63c81712-8f3d-46bf-9efe-5eaa92da7b0e","resolution":{"observed_at":"2026-08-04T06:11:59.628402Z","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-04T06:11:59.632908Z","title":"Computational transition at the uniqueness threshold","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.632908Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:71219de29e1afb2fe949b0fab8a826128e8cf63fe1e85b019b3be14a6af58d4e","observation_id":"75ccc228-d6b8-4c31-bd14-8b0f19292d05","resolution":{"observed_at":"2026-08-04T06:11:59.632908Z","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-04T06:11:59.637927Z","title":"Counting in two-spin models ond-regular graphs.The Annals of Probability, 42(6):2383–2416, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.637927Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:cdfefafd6f1623f5fbfc174b7a245a494e54ea2b60775cce24232264c4b5dd55","observation_id":"cf40aa86-8a07-4a50-a87d-5ebe72b6bbd4","resolution":{"observed_at":"2026-08-04T06:11:59.637927Z","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-04T06:11:59.642462Z","title":"Counting independent sets up to the tree threshold","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T06:11:59.642462Z"},"links":{"citing_paper":"/paper/2608.02503"},"observation_digest":"sha256:e3ca0a52de8f6ef06afadf7fb3e82ddd550580d584ae73928e8e55e29d55e753","observation_id":"1d2e5cb8-2913-4e96-a025-5e00e0647c0a","resolution":{"observed_at":"2026-08-04T06:11:59.642462Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02503","last_updated":"2026-08-03T17:05:02Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T12:51:28.320656Z","submitted_at":"2026-08-03T17:05:02Z","title":"Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":38},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 1 inbound Pith citation observation for arXiv:2608.02503."}