{"as_of":"2026-08-08T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1f88b938bb33f426dfa2bce6b25665e6b8712b82835db973c99b9e9b610315a","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:09:07.803551Z","state":"measured"},{"denominator":78,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":78,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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-06T17:19:19.416311Z","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-06T17:19:21.112313Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"cited_work":{"arxiv_id":"2506.06013","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.06013","snapshot_observed_at":"2026-08-06T17:19:21.112313Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","venue":"cs.LO","work_id":"d8fb9676-e5ca-4de6-92a5-06a39b384cd7","year":2025},"citing_paper":{"arxiv_id":"2507.11655","last_updated":"2025-07-15T18:41:19Z","snapshot_observed_at":"2026-08-07T15:44:32.904780Z","submitted_at":"2025-07-15T18:41:19Z","title":"Counting Answer Sets of Disjunctive Answer Set Programs","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T17:19:19.416311Z"},"links":{"cited_paper":"/paper/2506.06013","citing_paper":"/paper/2507.11655"},"observation_digest":"sha256:091f62c0bee20f44657371bc926eeb2828bc531f55c51aa147ac646a0e16a676","observation_id":"b28f7a84-2743-44e0-943b-1441627ef947","resolution":{"observed_at":"2026-08-06T17:19:21.174529Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.06013/citation-record","integrity":"/paper/2506.06013/integrity","json":"/paper/2506.06013/citation-record.json","paper":"/paper/2506.06013"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.795525Z","title":"Roux, and Morgan Magnin","venue":null,"work_id":"b6238b73-4c20-4a1b-bb4f-ed032c8288c5","year":2017},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:00.922753Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:e1d3ac1a29c68c103974bfb57f90b7df5d2c6dfe9fe499d51738b0beac80bc5f","observation_id":"7b7fd48f-1362-4738-9500-6e0bfac272a3","resolution":{"observed_at":"2026-08-07T06:09:18.798183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.788043Z","title":"Automated inference of Boolean models from molecular interaction maps using CaSQ","venue":null,"work_id":"254cba19-80fd-4eaa-821a-5c586d47af4e","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.168751Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:ec2ddac3448ac80a5f5ca612097d482ca9f2635a03e032822c14040570dd13f9","observation_id":"520dc281-2ce6-4168-b372-2228fefeafe9","resolution":{"observed_at":"2026-08-07T06:09:18.790981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.779060Z","title":"ASP and subset minimality: Enumeration, cautious reasoning and MUSes","venue":null,"work_id":"2f6f174f-2c6c-4829-8549-da38f22b367c","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.385823Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:ee5dc34e5e95a0db46ae0ba7db879203e157ec3b4f7834f0b5f38b2a88f21ada","observation_id":"28e24ada-103a-4204-8485-ecab996c33b0","resolution":{"observed_at":"2026-08-07T06:09:18.782761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.764952Z","title":"Muise, and Peter James Stuckey","venue":null,"work_id":"770756e3-6c27-496c-82b8-792e9db9e661","year":2015},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.538878Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:06a885601a62954245831b922d1770e437e292b615baae1125c2ebacd67e29de","observation_id":"f27fa80a-c5ab-4e18-8851-143ec8d6c9e9","resolution":{"observed_at":"2026-08-07T06:09:18.770358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06106","last_updated":"2024-07-08T16:44:36Z","snapshot_observed_at":"2026-08-02T12:20:54.992629Z","submitted_at":"2024-07-08T16:44:36Z","title":"Bridging abstract dialectical argumentation and Boolean gene regulation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06106","snapshot_observed_at":"2026-08-07T06:09:01.624912Z","title":"Rosenblueth, and Octavio Zapata","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.624912Z"},"links":{"cited_paper":"/paper/2407.06106","citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:2d029697ec21779f63ed2ac14a0db504d3b47c3bf1a91d4ac81e594d7022e4f0","observation_id":"cf2f4bc2-a039-4434-92cf-0a111c29f031","resolution":{"observed_at":"2026-08-07T06:09:01.624912Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.755561Z","title":"SAT competition 2017--solver and benchmark descriptions, 2017","venue":null,"work_id":"b86dcfda-820b-4ec9-967c-073d1207f4f3","year":2017},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.730924Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:0ef3f4dc14a683d3d7a9fe97cf23f4124c1f685a57c4c4963b9c8fb65ae64ed3","observation_id":"bd16ed4f-3028-4e8d-af56-f68d3143a0a0","resolution":{"observed_at":"2026-08-07T06:09:18.758150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.745675Z","title":"Propositional semantics for disjunctive logic programs","venue":null,"work_id":"51f7d012-ba56-43a0-9f24-a58d3a7148bf","year":1994},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.810784Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:5a60e298bb8424f229170dc2b0e0f5c329d2163195837aadf8e174352def9f65","observation_id":"5b84eca6-c726-416b-a2d3-c46e57207b2c","resolution":{"observed_at":"2026-08-07T06:09:18.749307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.642871Z","title":"AEON: attractor bifurcation analysis of parametrised Boolean networks","venue":null,"work_id":"f07ec23d-5d3b-4610-bf09-1abd925d2885","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:01.883853Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:c3c5f00ddb7ac3b2993c38cfd81eb5112a3c712164a9731aff839ecfd09ddf48","observation_id":"378fcdb6-f459-4c98-a0be-b0fc3679e8f1","resolution":{"observed_at":"2026-08-07T06:09:18.732117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.361611Z","title":"Phenotype control of partially specified Boolean networks","venue":null,"work_id":"93cb7b5e-09e2-4fcd-a7cf-ca2fe4ff6fa0","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.078573Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:68b1c5f6ab7dde4dfdfd3d08705d86413b8067316578f127b426cf3445b47e8e","observation_id":"b839a794-311c-47f2-826d-0f9152b650ee","resolution":{"observed_at":"2026-08-07T06:09:18.511515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.262523Z","title":"Handbook of Satisfiability , volume 185 of Frontiers in Artificial Intelligence and Applications","venue":null,"work_id":"ee54e2ff-c404-401d-9a4a-0061cfa7afdd","year":2009},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.166340Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:416c1d2972ee8090bb21147e95cb10ddc95f84c2f20ad0246e79cdd70b1704b3","observation_id":"4470ee96-ef1a-45e7-8a3b-09ed1ab64b87","resolution":{"observed_at":"2026-08-07T06:09:18.353959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:18.020923Z","title":"Boolean network modeling in systems pharmacology","venue":null,"work_id":"77b2de9b-fd1a-4d8b-838f-cab77866d76e","year":2018},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.235104Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:e1b25cefcca0b40141f778d5b5d5b4ee2e7b380890e21812f08aba5d1c3ed68d","observation_id":"6a08a345-6364-4515-b3b0-1a36707138d7","resolution":{"observed_at":"2026-08-07T06:09:18.119374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.945944Z","title":"Complexity of fixed point counting problems in Boolean networks","venue":null,"work_id":"3f4eeaac-d35b-4c4f-8af3-2bbc2dbbd769","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.315425Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:751d92f2230623d3ee433bb7c1933bbe75a544a373361eb7b7e75518ce38c5ca","observation_id":"68532d55-7057-4066-b13c-8c4f2e57da55","resolution":{"observed_at":"2026-08-07T06:09:18.011171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.785193Z","title":"Meel, and Moshe Y","venue":null,"work_id":"6d314566-9599-470a-9b7e-2771d11365ab","year":2013},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.453206Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:1637c2978c74667e42abe89c3dec809de35403aee2140d1fcacf125f6356725d","observation_id":"6e53b66a-fabc-4df7-ba40-9f57f2634160","resolution":{"observed_at":"2026-08-07T06:09:17.863961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.594837Z","title":"Meel, and Moshe Y","venue":null,"work_id":"fb71146d-896d-4b81-9fcd-c35f5f2cfb21","year":2016},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.571510Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:eeb0df45dccac4ff174887d2b27b6d371d2710d3563af31ae4632c46dce56a8e","observation_id":"9f216b5c-f8ac-4b01-a4ae-3dfde1174af1","resolution":{"observed_at":"2026-08-07T06:09:17.679397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.460372Z","title":"Chandra and George Markowsky","venue":null,"work_id":"6407d893-e7cf-4175-9ec5-f70d7813d815","year":1978},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.670553Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:956a17bed3e66d46d3ef026d9b0f176e80c87a0c0a2c018051a837f7ea0f44a4","observation_id":"7d35a4ba-f2f8-442e-877d-26e94b337d0c","resolution":{"observed_at":"2026-08-07T06:09:17.508033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.426169Z","title":"e l, Laurence Calzone, Andrei Yu. Zinovyev, and Lo \\","venue":null,"work_id":"78e13a81-fdc8-46f2-881a-ac60f2209b72","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.721964Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:091bd7d9b1cf766b80071d2b9bfd12df19db4eab342873ece600444fb449f80c","observation_id":"b89623c2-7525-48eb-a420-36c032d7fe07","resolution":{"observed_at":"2026-08-07T06:09:17.454886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.221525Z","title":null,"venue":null,"work_id":"e4ee433b-61f8-46d1-8f55-40ad66b48507","year":1978},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.776972Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:5574bb628a21410eb46fbed743ba880a5809d75e3074dbd40bf11455ffa0d389","observation_id":"218e4114-9891-4a83-870e-fce3f9011006","resolution":{"observed_at":"2026-08-07T06:09:17.298007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:17.035971Z","title":"A practical account into counting Dung's extensions by dynamic programming","venue":null,"work_id":"fca39a4b-fe07-43b9-948b-cc31908c4026","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.822379Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:6a8eb20f2835413a28da4c49993db3d51cae581aacc95bdecc77aad7d918ff1b","observation_id":"425683c1-bd43-4a63-af2e-f677a826612b","resolution":{"observed_at":"2026-08-07T06:09:17.153792Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.787101Z","title":"Connecting abstract argumentation and Boolean networks","venue":null,"work_id":"9063d293-46d0-4589-aa2c-f83f6b3c5ae5","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.857206Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:5206d195e14893177e791649c88c6c8472c2eec8ecbea48e3997bf87798b2d6a","observation_id":"c0f2c08e-a08d-4e64-9151-25ce9f549fc7","resolution":{"observed_at":"2026-08-07T06:09:16.933916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.611227Z","title":"A SAT -based algorithm for finding attractors in synchronous Boolean networks","venue":null,"work_id":"0211a5be-d529-45f4-af35-682ff878cb16","year":2011},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.886671Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:ecb6e3c3cbce2019deaea66d66ebb6afc6646a177737706f3ce4f80ba0924593","observation_id":"fff8e31c-9eb9-4d4a-9817-7cd2cdef3c70","resolution":{"observed_at":"2026-08-07T06:09:16.716346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.572946Z","title":"aspmc: New frontiers of algebraic answer set counting","venue":null,"work_id":"931099ee-4221-4747-bb39-33fca775ed82","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.943125Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:2c35d5ae3c27cddf5552be5f5ed3305c2b400aaa23d8767f2d020fa21efea331","observation_id":"68e8725b-78d8-4558-8dfb-410861919e14","resolution":{"observed_at":"2026-08-07T06:09:16.597519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.379237Z","title":"Consistency of Clark's completion and existence of stable models","venue":null,"work_id":"72af2217-750b-42e0-92ba-34bf80405c5f","year":1994},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:02.988896Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:dc220bdc86f9a74b216b624e95dc94decc6cf2237b5357d71bb2d09d4646d589","observation_id":"f1d4bf06-c2af-4fd6-a641-2cce94429ffa","resolution":{"observed_at":"2026-08-07T06:09:16.456734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.232299Z","title":"Fichte, Markus Hecher, and Mohamed A","venue":null,"work_id":"dc7dc968-1d82-4d63-a043-1953a1cb80cc","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.027181Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:81ffa1bbd28991670e55cc406adf007cfe6c04209693bb9db7ca4bc68136e6e6","observation_id":"0554d066-05c5-4fdc-bbce-dc2bd33d6f23","resolution":{"observed_at":"2026-08-07T06:09:16.303138Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:16.070869Z","title":"Rushing and strolling among answer sets - navigation made easy","venue":null,"work_id":"5fb4b9ad-3cb4-4538-9fce-8f7dbce2dbf9","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.081868Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:2af0533f7b7db6c5df1f495a51749b3c519891a02912ad57bddbe8e734bfb141","observation_id":"4e6c756a-c255-45b4-9b1b-64fc171ebd3e","resolution":{"observed_at":"2026-08-07T06:09:16.149874Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.959655Z","title":"Treewidth and counting projected answer sets","venue":null,"work_id":"407fae2b-2e10-42fd-b0d2-88d96fe8f681","year":2019},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.241879Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:1944f0a3d426dadd37150a30320029235d8fdbb3fe736968b38f2ad7ea08f29d","observation_id":"779fa429-88e6-4c6a-9927-8f9d6abb4fc2","resolution":{"observed_at":"2026-08-07T06:09:16.023723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.813879Z","title":"Counting complexity for reasoning in abstract argumentation","venue":null,"work_id":"10002817-4248-4074-a376-33909a38a5a5","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.320271Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f369a443c1e25991f7f6b1c50f92b2b6e31def46975ef639c8441db417887fae","observation_id":"527420b7-300e-44f7-bcea-e3a4109b58ac","resolution":{"observed_at":"2026-08-07T06:09:15.883997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.643750Z","title":"Answer set solving with bounded treewidth revisited","venue":null,"work_id":"cfa9d6a0-1d37-49cb-8015-86b47fd8ebae","year":2017},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.447344Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:390271c8d0fd9cc18e089199591a85caa623bd6d1dcbe608cb82ffd74df33110","observation_id":"4e6916e0-403d-484c-b0eb-aab0cd10cc05","resolution":{"observed_at":"2026-08-07T06:09:15.717477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.495705Z","title":"How many markers are needed to robustly determine a cell’s type? iScience , 24(11):103292, November 2021","venue":null,"work_id":"e259c4cb-f273-44d3-8bb7-ceeced38ed47","year":2021},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.495698Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:52beec641c1ec8080453413cfe0e5fcd8c87fd8a3edb9cf3e7102315fce1e24e","observation_id":"a0c0075f-6573-45b6-96d4-01753a6e2d2f","resolution":{"observed_at":"2026-08-07T06:09:15.554639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.330345Z","title":"Potassco: The Potsdam answer set solving collection","venue":null,"work_id":"c17ca4b8-6519-45f0-b713-986f4947da33","year":2011},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.668489Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:8106bf69c976c7e0fcf02c30a6ff6ce32bf6b55ac63f25fac446dc1bb0925dff","observation_id":"5a6f7ed9-1394-451e-94ef-6ab1c61f5a95","resolution":{"observed_at":"2026-08-07T06:09:15.425158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.178087Z","title":"The stable model semantics for logic programming","venue":null,"work_id":"53e94a95-15fa-403c-94ae-8a4a89bdc1bf","year":1988},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.702141Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:d5a4adf0a6a39122e83f63635f082c9753c4d961d3a57e1550683247f2fd1ec4","observation_id":"d309b27e-0f94-4b14-a6fa-2338122edcb0","resolution":{"observed_at":"2026-08-07T06:09:15.267655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:15.052654Z","title":"Abstract dialectical frameworks are Boolean networks","venue":null,"work_id":"fc3cb08b-8e10-412f-acf2-a4048be33b6e","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.720121Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:5cb010d0e642267451d402285498c370ec3750c45b683846fc8956c5bb7694c3","observation_id":"16cdc59e-d1d9-47f1-8a54-6544ccda53a2","resolution":{"observed_at":"2026-08-07T06:09:15.120587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.920854Z","title":"Homan and Sven Kosub","venue":null,"work_id":"2f19fc84-9dee-4d3f-9449-683d94084bcb","year":2015},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.796613Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:488fc518488f39c1377d30118d9d88da1eadbe75c2a4bec0840bb816c98e5a83","observation_id":"b9926853-780c-4b5f-9768-e326ae6d1881","resolution":{"observed_at":"2026-08-07T06:09:14.991802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.786330Z","title":"Logic programming for Boolean networks","venue":null,"work_id":"7b026474-cb94-4bd1-adf0-ec35b02172ea","year":2011},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.903970Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:9433c9dd1c7972db9c6d1579f91da234e413d7975b41dabc07b86ed1df4e1c43","observation_id":"ac170330-b498-47f8-937e-f072ea294994","resolution":{"observed_at":"2026-08-07T06:09:14.866370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.701962Z","title":"Oscillating behavior of logic programs","venue":null,"work_id":"2a6cf20a-c968-41b0-a1ba-396d78f13b92","year":2012},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:03.997590Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:c962b476fe38af2308a6364cdeaa7cdaff9dcf19bbfda19bdbee40c88c77d1fb","observation_id":"04589bc2-3059-4ca7-81e3-171610fadeb8","resolution":{"observed_at":"2026-08-07T06:09:14.746706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.567016Z","title":"Some (in)translatability results for normal logic programs and propositional theories","venue":null,"work_id":"6b94de99-5e6a-45bc-8f3c-b8a429f2530d","year":2006},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.081147Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:cc5d35321542b82246a8e583182b156d2bfdc01f704c9f0ba7219bbfb1835a5b","observation_id":"a7f37c92-6efc-4e12-9842-c61e5fdba28b","resolution":{"observed_at":"2026-08-07T06:09:14.629252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.274171Z","title":"Unfolding partiality and disjunctions in stable model semantics","venue":null,"work_id":"0e23d7ae-1053-4b95-bdac-5f6ff5595d14","year":2006},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.167309Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:98f6d08d2e7ac4a0e6d4f65c31290543e00c449a28ed18da2bbeb53e0db9bf64","observation_id":"fa4b2bc8-aa07-464f-ada8-8d8709c77847","resolution":{"observed_at":"2026-08-07T06:09:14.349845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:14.038042Z","title":null,"venue":null,"work_id":"98fecbad-4430-4f84-abae-a65d1303d960","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.255363Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:a6653d30e2b390704024a1c14e9d9ab263280625157b02a61675cfe5bb3f4fa1","observation_id":"73107c32-ae50-4b67-8050-de6366e7a3c3","resolution":{"observed_at":"2026-08-07T06:09:14.141122Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:13.816158Z","title":"Everardo, Ankit K","venue":null,"work_id":"6efa9f71-d1df-44e1-96dc-5c6c0a6e7efd","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.358242Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f5618a7963a52c34e79f0cdca0be243fc9fdf99c24e9259605ce9941d301d590","observation_id":"a15ad56a-0a4b-4a8f-9eaa-e298103454fb","resolution":{"observed_at":"2026-08-07T06:09:13.949202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:13.628298Z","title":"A fast and accurate ASP counting based network reliability estimator","venue":null,"work_id":"925ea5bd-2fcb-40fb-bb1b-1a36aa7dfd70","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.442146Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:c2a62ce16762562550eafaf355a9cc2843954f023e842e06c19a350891ff1def","observation_id":"7c52d5af-ad7e-4f03-9aed-4b5339da2682","resolution":{"observed_at":"2026-08-07T06:09:13.753664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:13.428027Z","title":"On lower bounding minimal model count","venue":null,"work_id":"d4de1a78-10d2-4ed9-a882-9b99bd00101b","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.521178Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:4a172134851bf2c9fc0f08123f806821251c4fb6294cecafa980e7a0a484ae04","observation_id":"0b46cd06-8c13-447e-8f8a-5e7d7a9247a3","resolution":{"observed_at":"2026-08-07T06:09:13.525273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:13.246702Z","title":"Admissibility in probabilistic argumentation","venue":null,"work_id":"58b9232a-5de1-494a-b07d-28295b6aee63","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.631909Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:c33ff3eb1e65d0c3728ab040177ad5e73efbfe3b752cd30918cf91c7bd34f1d9","observation_id":"0eafc864-b18a-4e5f-8e90-ffcf59456fe0","resolution":{"observed_at":"2026-08-07T06:09:13.343124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:13.023751Z","title":"Minimal intervention strategies in logical signaling networks with ASP","venue":null,"work_id":"cc820655-da7b-47ce-a9f7-4afac34a3a0b","year":2013},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.704481Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:41f792e438b5b444648e9e1f4fd248f23e3d894f3191d3464525bc59959441fc","observation_id":"a7555bee-2b79-437b-9a8a-424ef585c31f","resolution":{"observed_at":"2026-08-07T06:09:13.134133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:12.829559Z","title":"Towards a theory of biological robustness","venue":null,"work_id":"55bb5472-5f4c-4751-91a3-6ae96572d336","year":2007},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.784914Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:e3b35a856daf9464b05423cc7bf0f0159e003a69f9a052a3158393e867f5bf1c","observation_id":"4a1cdd23-00b2-40b5-a0b7-1f19f3c15abb","resolution":{"observed_at":"2026-08-07T06:09:12.961981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:12.618641Z","title":"Computing maximal and minimal trap spaces of Boolean networks","venue":null,"work_id":"8e9d2a03-6589-4357-9270-1f51be550aa6","year":2015},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.887563Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:69a2c14c7e68989a4072fc73caad7fa199775a58551a67540a4fab2edc3ce80a","observation_id":"1f4f1d16-fec5-44bd-9c4b-3a90f011b741","resolution":{"observed_at":"2026-08-07T06:09:12.708185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:12.472566Z","title":"Basins of attraction, commitment sets, and phenotypes of Boolean networks","venue":null,"work_id":"66c96a74-fffd-4f8c-a2df-8c8f0ed39478","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:04.968506Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:35759d9079451ad49e8bf00e0e7e39587d428eb23eb98985f315225636b20e7a","observation_id":"c2e79e81-e57d-4515-a199-bc9571f8fddf","resolution":{"observed_at":"2026-08-07T06:09:12.544245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:12.343998Z","title":"Detection of markers for discrete phenotypes","venue":null,"work_id":"f76f7c0a-c6b4-4c96-9f0a-9cf770ca2e7f","year":2021},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.025372Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:ef07a15d0dc15867661b6747b625b7637a9470d0e412fc218bc9407b02fd36fd","observation_id":"785ecb48-a114-48d3-ac58-089df63e0649","resolution":{"observed_at":"2026-08-07T06:09:12.415621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:12.129626Z","title":"Loop formulas for disjunctive logic programs","venue":null,"work_id":"fc0c0a8d-fb88-46e1-949f-ac98c4778915","year":2003},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.104683Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:bfc22469b0090edd20c25d78e78b6937025d3b676519328819d318365b5119b9","observation_id":"a22de02e-8ff7-49ba-b97e-7cf6be112ba9","resolution":{"observed_at":"2026-08-07T06:09:12.247770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.978891Z","title":"Dynamics inside the cancer cell attractor reveal cell heterogeneity, limits of stability, and escape","venue":null,"work_id":"7b44e918-890c-4662-a99b-5e84bf155e04","year":2016},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.201385Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:47903e32c6def4a6b48dcb35fc646039f4a1057a3952e1f60e42097a20ed27e9","observation_id":"6429b621-93f5-418e-9631-f9e38ce5ffe0","resolution":{"observed_at":"2026-08-07T06:09:12.019935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.902555Z","title":"Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving","venue":null,"work_id":"d06c286a-0ad9-49bf-bed9-3978175db684","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.295230Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:7442f74918fb1f78e9acd3e2e0e7f77aac57bd2e5251f968bb435163e5d4e167","observation_id":"8f254116-9021-4754-a499-43795caafb9d","resolution":{"observed_at":"2026-08-07T06:09:11.972923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.670612Z","title":"Stable models and an alternative logic programming paradigm","venue":null,"work_id":"14c44420-53b8-4b2a-be0b-8a96646d567d","year":1999},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.368430Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f4c05812b255aef9e607d960e5a327aafa1fc9f5ef3aab7c35b24d17dfacfd81","observation_id":"557194f9-8b5e-41d0-ac12-91831a6b1aa6","resolution":{"observed_at":"2026-08-07T06:09:11.854319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.478731Z","title":"On CNF conversion for disjoint SAT enumeration","venue":null,"work_id":"b1ac5206-a53a-4012-8a64-85a8b6fc8002","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.422835Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f5e09f9f355c0f8cf4d7f8e5e1b4dfc6dc3046678eca30c538d24519d0ddf912","observation_id":"4f2a3355-7baa-4a5c-b84f-8f60e6b43cbe","resolution":{"observed_at":"2026-08-07T06:09:11.571283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.331649Z","title":"Patient-specific Boolean models of signalling networks guide personalised treatments","venue":null,"work_id":"b25cab40-a38f-4091-bd6f-8e0d4afbf1e2","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.527157Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:fef6b1592e08250f0eb292d6f0cdf3c4cbce15a4d69889a85181dd62a887ee64","observation_id":"c1e71cd1-1da2-4fdc-8f1d-8657de3674ca","resolution":{"observed_at":"2026-08-07T06:09:11.391698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.189055Z","title":"Essai d'une théorie algébrique des nombres entiers, précédé d'une introduction logique à une théorie déductive quelconque","venue":null,"work_id":"c7dc79b8-0a05-4ecd-9c63-e6e97e91e4be","year":1901},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.670183Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:84a43cd67043271d25ef1b59a0bda104d53386973fd7c6891ac8267c096b8fc9","observation_id":"2498c72f-6627-46c1-b46f-d70569f6cc40","resolution":{"observed_at":"2026-08-07T06:09:11.248864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:11.074145Z","title":"Repository of logically consistent real-world Boolean network models","venue":null,"work_id":"7b0bc291-09de-45e3-8884-177eea2f102f","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.778594Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:58d311b5b585dd4525112a5f396d5fbdbf38e298e47ba9244c4978d422ad7fc6","observation_id":"1f3518a7-e6c5-46a2-ab67-0968b47068f9","resolution":{"observed_at":"2026-08-07T06:09:11.135490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.971544Z","title":"Reconciling qualitative, abstract, and scalable modeling of biological networks","venue":null,"work_id":"f0e68ed4-8580-4f51-92ce-f3881df9bc58","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.878174Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:9490364600b22c2cfbe1937a1a0af392258bd8d3773527cd1c4d244ce34ed726","observation_id":"3b996fe6-5348-4320-9ddd-ba456bb3fb5f","resolution":{"observed_at":"2026-08-07T06:09:11.025735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.851394Z","title":"Rozum, Jorge G \\' o mez Tejeda Za \\ n udo, Xiao Gan, D \\' a vid Deritei, and R \\' e ka Albert","venue":null,"work_id":"fdae0eed-5acb-4289-b5c5-122a4b2e0ee2","year":2021},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:05.952812Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:e48c45a1c8742018a2970cc293021435cf47e4879a0a3e225ee65df7cd550aec","observation_id":"ed539bb4-d48f-4908-9a97-a83015b12653","resolution":{"observed_at":"2026-08-07T06:09:10.910447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.729267Z","title":"Metabolic network expansion with answer set programming","venue":null,"work_id":"c68d0822-5ca8-4144-b272-f97cce57f460","year":2009},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.059779Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:b05827c8df8c1aef4242272587ad5fb79207fb605c570c5ce247b014f6544f22","observation_id":"278fcbaf-02ff-40da-9573-29d571e61401","resolution":{"observed_at":"2026-08-07T06:09:10.783023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.604307Z","title":"u hlwein, Nensi Ikonomi, Michael K \\","venue":null,"work_id":"0100224a-2997-4b64-aa55-a57ac1793f55","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.132817Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f27ccc239f90341283be2e194d1d6d46af54e448e7d85fa619ac93d838a3458a","observation_id":"04859085-1073-4a38-8234-eeea7970e89d","resolution":{"observed_at":"2026-08-07T06:09:10.655101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.489990Z","title":"Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components","venue":null,"work_id":"4c007a45-131d-4899-874e-195ea65ad738","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.211812Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:3415586572dbf10685f99e799febcecab2b2e825b8b34cbdb25d6b7eb13cce78","observation_id":"472fa5db-93c8-42ed-a95f-3a684b889ee0","resolution":{"observed_at":"2026-08-07T06:09:10.532195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.346665Z","title":null,"venue":null,"work_id":"0410c530-a659-43a0-b912-6ace923cd27c","year":2019},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.296151Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:3e41e40ff343f72e7937877622bca723a4cc7c1693ce6d82dd47f366c03cdbd4","observation_id":"049744f6-4819-4d56-8fb3-8fedaab8b3f3","resolution":{"observed_at":"2026-08-07T06:09:10.413036Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.214970Z","title":"Dougherty, and Wei Zhang","venue":null,"work_id":"a004caed-4fa6-403e-ab3e-ff313965d4d6","year":2002},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.398028Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:d3761c4e252871c12819a100b07445f68bea5319eea6ac0a3da357e9abf934a9","observation_id":"12aae628-8a70-46df-9e69-c8903c022dbe","resolution":{"observed_at":"2026-08-07T06:09:10.268629Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:10.075559Z","title":"Gene perturbation and intervention in probabilistic Boolean networks","venue":null,"work_id":"8bf52400-8fb0-414f-811f-06432760a6ba","year":2002},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.477584Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:b94abb5740d13ded3066231dd91c2cdcd998b5835c6032157daa6260994c2336","observation_id":"b4a0a393-b993-40ad-a0f2-806f350f0bf3","resolution":{"observed_at":"2026-08-07T06:09:10.135059Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.950426Z","title":"Sequential temporary and permanent control of Boolean networks","venue":null,"work_id":"06e389b1-2cd9-498f-90b7-5bcc5369a9fd","year":2020},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.551248Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:bd4b0ef3348cac5463043d7513e03437fb3cb31d966e14f9ab5d552cfc8ecd8b","observation_id":"113123ff-b6c5-42b1-ad82-d8c9db4d7516","resolution":{"observed_at":"2026-08-07T06:09:10.020440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.840617Z","title":"sharpSAT - counting models with advanced component caching and implicit BCP","venue":null,"work_id":"f788749b-c8e3-4511-82aa-000455ab4268","year":2006},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.660207Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:d5259fff6c3d72dfaf11d1cfa942cd0128019822cc4554a554b5295c69689df4","observation_id":"fefe266e-02c9-4d8d-afe5-59dcc08295b8","resolution":{"observed_at":"2026-08-07T06:09:09.895489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.693293Z","title":"Phenotype control and elimination of variables in Boolean networks","venue":null,"work_id":"20502bfa-df1e-4239-b975-6332aaedbf20","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.767870Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:8862e173ac8dacbafebce285c4e830d6bbc2c2a35ad0cb52c11937b21f8ec2f6","observation_id":"9b2af911-efb7-41ff-8c9b-30150be3481f","resolution":{"observed_at":"2026-08-07T06:09:09.759259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.564463Z","title":null,"venue":null,"work_id":"44405ff3-f0be-499c-a754-63ecdccc8256","year":2006},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.879447Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:0e098b85bda2f6b314c360c2394ad56c5a89c1a6ba4479e0c24ae90187e29660","observation_id":"bf4e5e70-00b7-4b36-8df3-00d5b55eaf3b","resolution":{"observed_at":"2026-08-07T06:09:09.648409Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.387771Z","title":"Tosic and Gul A","venue":null,"work_id":"a54c977d-2f58-45c8-acaa-aa6e69053443","year":2005},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:06.989250Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:a65e3e6bca26c0f4eff144bd1704d42c7934d9d6fcbd8baf122c7d64d2296a14","observation_id":"05127cb3-528b-4377-bb9b-7b96b4da4bcc","resolution":{"observed_at":"2026-08-07T06:09:09.489654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.215731Z","title":"Scalable enumeration of trap spaces in Boolean networks via answer set programming","venue":null,"work_id":"32d8bdcd-b1f9-481d-9d97-55172359880d","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.079187Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:3ad4cbf8e4d550a3ab952554513fcd49b47de4c1e3d575a74e0a418f5bf9f7d4","observation_id":"396738e2-168f-4522-8b3a-dc18b36e24ea","resolution":{"observed_at":"2026-08-07T06:09:09.299175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06255","last_updated":"2024-03-10T16:40:35Z","snapshot_observed_at":"2026-07-06T17:42:16.039458Z","submitted_at":"2024-03-10T16:40:35Z","title":"mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06255","snapshot_observed_at":"2026-08-07T06:09:07.175307Z","title":"mpbn: a simple tool for efficient edition and analysis of elementary properties of Boolean networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.175307Z"},"links":{"cited_paper":"/paper/2403.06255","citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:1723140a4bb85e9ab220af20afa7f078f362642f5420555f432f59b7f72f75a1","observation_id":"f211cdcc-4d2f-4ff1-ac11-59c67cab6d61","resolution":{"observed_at":"2026-08-07T06:09:07.175307Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:09.033305Z","title":"Graphical analysis of abstract argumentation frameworks via Boolean networks","venue":null,"work_id":"4b3a6ce2-c093-434e-86f5-40179157d150","year":2025},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.251442Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:adcc6194b74796ce727b59e81720883448277c87eafdd84a2f40db4a8234902f","observation_id":"15e9108d-b662-4457-98fc-73e5c8b13737","resolution":{"observed_at":"2026-08-07T06:09:09.100326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.864153Z","title":"Efficient enumeration of fixed points in complex Boolean networks using answer set programming","venue":null,"work_id":"91d92d9a-35df-4631-8f02-01a74bb682e9","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.305827Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:8d22b06bc98e7e7e6ba04a1d88398ba30ab7c7cb60e3b6b1acf5d870a5111806","observation_id":"2ecb76fc-cb8a-46d5-8982-a30bf442d323","resolution":{"observed_at":"2026-08-07T06:09:08.938518Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.744913Z","title":"Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding","venue":null,"work_id":"faa1cf13-98f1-4a7f-9c97-3c350a2fdca9","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.383066Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:675b70dd26f587342de2590132b0e19650ececb9c548dc4d8927d0e745ba7c0a","observation_id":"3960ce57-fcae-4524-9584-89d60b0bfe9a","resolution":{"observed_at":"2026-08-07T06:09:08.820394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.538376Z","title":"Graphical conditions for the existence, unicity and number of regular models","venue":null,"work_id":"2425b15f-7dc7-428b-87e6-669c9f57f6a3","year":2024},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.482703Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:f8fc0b9b2343efecdc9ffd82b9cf55379211587cf36fdc953e36629980c478e7","observation_id":"4ae9f621-e436-405d-bb78-66b09a5371d7","resolution":{"observed_at":"2026-08-07T06:09:08.625040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.401304Z","title":"Computing attractors of large-scale asynchronous Boolean networks using minimal trap spaces","venue":null,"work_id":"da74bab4-2c8a-4b1d-a239-840b8a00ce6b","year":2022},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.568708Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:8ba6786a56ac58b6060914d7c092ea5e6c0a511d262ebf7e5767c62b96c80bd1","observation_id":"6ac046d8-f830-445a-8578-3aae61f1c889","resolution":{"observed_at":"2026-08-07T06:09:08.469509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.253099Z","title":"Mapping the attractor landscape of Boolean networks with biobalm","venue":null,"work_id":"79e82b39-23e0-4020-8045-0bd89d6ea640","year":2025},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.650451Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:765636f0ef8ccb9423d443086e4e13cc76d93d37f4c9809a096f1e75eecd3691","observation_id":"afd38128-2330-4d19-b57e-79369e5c1ac3","resolution":{"observed_at":"2026-08-07T06:09:08.342751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:08.105635Z","title":"Learning Boolean logic models of signaling networks with ASP","venue":null,"work_id":"58661409-be66-4c21-984a-cafe434cc39b","year":2015},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.737709Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:52ce4e73fb48b5265feeaf175a6ccc4e77b04db183fb018467a62ed41a2ae777","observation_id":"61ef711d-cdc0-4260-b6a4-01c93faf9c1a","resolution":{"observed_at":"2026-08-07T06:09:08.204309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:09:07.950052Z","title":"Rounding meets approximate model counting","venue":null,"work_id":"1369d39c-2b91-46bd-82cc-222f803004b3","year":2023},"citing_paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T06:09:07.803551Z"},"links":{"citing_paper":"/paper/2506.06013"},"observation_digest":"sha256:8a3adae9a02918b6e90923f0091fbaee572cb37e1706ba909d032e4480e4af72","observation_id":"38925438-b611-45a0-ade9-3cf04cb12aaa","resolution":{"observed_at":"2026-08-07T06:09:08.018469Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.06013","last_updated":"2025-06-18T03:18:49Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-07T05:59:43.638261Z","submitted_at":"2025-06-06T12:00:39Z","title":"Scalable Counting of Minimal Trap Spaces and Fixed Points in Boolean Networks"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":71},"total_outbound_references":77},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 77 of 77 outbound references and 1 inbound Pith citation observation for arXiv:2506.06013."}