{"as_of":"2026-08-13T01:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b735d30b212c582a20c70550e2ec730a8b367a12165857ca53304d1049ee0ae8","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:54:19.352353Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.16963/citation-record","integrity":"/paper/2411.16963/integrity","json":"/paper/2411.16963/citation-record.json","paper":"/paper/2411.16963"},"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-12T12:54:19.572749Z","title":null,"venue":null,"work_id":"4aaa73ce-5a95-46ed-a3db-023ba230448d","year":1971},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.292131Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:0d6c89890553bbecb99ef2325f0f87d04a44df866ba58de11747c42bdda93358","observation_id":"e64a8d8f-a809-4f86-b798-9e07c002bb0c","resolution":{"observed_at":"2026-08-12T12:54:19.578070Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.558489Z","title":"Chv´ atal","venue":null,"work_id":"833954dd-1f42-4950-8732-d38c00da1668","year":1980},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.298077Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:4e88b94e13d63bdc9ba0ec7fded3e4f454d410f68c3abe9c98a01bbd1c1fd74c","observation_id":"832b7653-2ad4-4b7a-8d70-c32546e4000c","resolution":{"observed_at":"2026-08-12T12:54:19.563152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.543923Z","title":null,"venue":null,"work_id":"e2c199ea-f0bb-4eed-9648-4a93eb51aba4","year":1979},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.302680Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:0e57de9dcca9700b3408bd26002338164a08ed72724b93e77ab103564a975df5","observation_id":"5d3c0581-1f7a-46ce-9111-6939fcbe283e","resolution":{"observed_at":"2026-08-12T12:54:19.548645Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.528851Z","title":null,"venue":null,"work_id":"5caa12cd-44c8-4f4e-ae56-adf12fc9661a","year":1972},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.307221Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:9ccc31875eb4aef3a11aef875423783fbc5de73675bb184b09e23496fa556963","observation_id":"b8e270c6-12ff-4724-8457-16f8907db74f","resolution":{"observed_at":"2026-08-12T12:54:19.533662Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.513059Z","title":null,"venue":null,"work_id":"6996a5a6-68e2-403d-a178-137c130ed5c1","year":1978},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.312044Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:0c5b77c88b90f6d3f0403f033a3af6de629c88645f29b9feb44e173dfe4a1560","observation_id":"91d81098-4745-42e8-a224-181f8be94f87","resolution":{"observed_at":"2026-08-12T12:54:19.517946Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.496222Z","title":"Wikipedia article retrieved October 27, 2024, https://en.wikipedia.org/wiki/Boolean satisfiability problem#Exactly-1 3-satisfiability","venue":null,"work_id":"93f8c905-86df-436b-bcce-f1cd5ee08d71","year":2024},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.316738Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:00b755b51f06c4044af65e10a517e2ef104ef95d1f9691947e7d1b865b3360b6","observation_id":"22084d3a-d431-4ab9-94ed-ef56a85efff2","resolution":{"observed_at":"2026-08-12T12:54:19.502769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.480473Z","title":"The system reduces to a + b = 1 b + c = 1 c + d = 0 (26) and the solution is ( a, b, c, d) = (0, 1, 0, 0)","venue":null,"work_id":"96aa44b2-b62a-4ab3-8ccf-8b7246082d0a","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.322215Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:1467cd4090cc59a13f99e8fb6aa6287b6ca05045310ee7f87ffe4b0bdaa278f9","observation_id":"15d60d93-bb7c-4a9f-aa61-36408f4bbe6a","resolution":{"observed_at":"2026-08-12T12:54:19.485467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.463897Z","title":"The system reduces to a + b = 0 b + c = 0 c + d = 0 (27) and the solution is ( a, b, c, d) = (0, 0, 0, 0)","venue":null,"work_id":"6085502f-ec13-4b36-9b98-a130c7f9c798","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.327066Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:85abb8faaf4f8fc638305058ceea8cbf6a09901e3e87aaeecc59405c9fe2401c","observation_id":"8c02743f-4fcb-4b27-ade5-07474b026d51","resolution":{"observed_at":"2026-08-12T12:54:19.469267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.447477Z","title":"a + b = 0 b + c = 1 c + d = 1 (28) and the solution is ( a, b, c, d) = (0, 0, 1, 0)","venue":null,"work_id":"eb29b694-c248-4768-928e-dab27a367523","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.331950Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:2d520949ed2bee08b16271d03ad053040ea6512230f011583ae9286498a30f7d","observation_id":"345761d5-217b-403b-841b-92a7f4e377d5","resolution":{"observed_at":"2026-08-12T12:54:19.452231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.431804Z","title":"The system reduces to a + b = 1 b + c = 0 c + d = 0 (29) and the solution is ( a, b, c, d) = (1, 0, 0, 0)","venue":null,"work_id":"479cc0be-60cf-402a-8999-777131a233d9","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.337080Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:da0a59a3db5ee38631e9baed2e496506abec08f51a12f68ebb8da68e5f75600d","observation_id":"62698cbb-4b4e-4496-8398-0252813abb99","resolution":{"observed_at":"2026-08-12T12:54:19.436631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.416660Z","title":"The system reduces to a + b = 1 b + c = 1 c + d = 1 (30) and the solutions are ( a, b, c, d) = (1, 0, 1, 0) and ( a, b, c, d) = (0, 1, 0, 1)","venue":null,"work_id":"29e41169-9d8d-4af0-8e33-3e7b979c3fbc","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.341848Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:1fc5a3cca15f26b09fd10b9fe475832ff4db7834e5e672ab8c48d975700b6e6f","observation_id":"2dde0046-f213-485e-bfff-b4c9bd4e1446","resolution":{"observed_at":"2026-08-12T12:54:19.421131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.400866Z","title":"The system reduces to a + b = 0 b + c = 0 c + d = 1 (31) and the solution is ( a, b, c, d) = (0, 0, 0, 1)","venue":null,"work_id":"d06b648a-c4f9-48ef-b3ad-43b9c19e6aa3","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.346716Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:792ed16743f972559add4749d769da89ea5421cc61db1396d9d4dd8fad2f9dd0","observation_id":"88450005-f629-4c16-ada8-1b6e22c4d712","resolution":{"observed_at":"2026-08-12T12:54:19.406018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:54:19.383014Z","title":"The system reduces to a + b = 1 b + c = 0 c + d = 1 (32) and the solution is ( a, b, c, d) = (1, 0, 0, 1)","venue":null,"work_id":"1ea25191-219a-489c-91cd-3421e61b5311","year":null},"citing_paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:54:19.352353Z"},"links":{"citing_paper":"/paper/2411.16963"},"observation_digest":"sha256:8b0bb5cb61d32bf4472082842951bb577b6b4a649bd3e01e1465d73cf77e6110","observation_id":"6ffc1c56-86aa-4cdc-afb8-16d051fcac33","resolution":{"observed_at":"2026-08-12T12:54:19.389243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16963","last_updated":"2024-11-25T22:01:30Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T12:39:20.052556Z","submitted_at":"2024-11-25T22:01:30Z","title":"On the Complexity of Combinatorial Optimization on Fixed Structures"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":13},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2411.16963."}