{"as_of":"2026-08-16T07:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c0fea01fecf9e9fe4d04f0bc6cdd8d92983bce8ae3f2c8a4318266f9eb125f1","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:54:39.542386Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2608.10005/citation-record","integrity":"/paper/2608.10005/integrity","json":"/paper/2608.10005/citation-record.json","paper":"/paper/2608.10005"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:54:39.542386Z","title":"Solving Large Scale Max Cut Problems via Tabu Search","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.10005","last_updated":"2026-08-07T20:59:54Z","snapshot_observed_at":"2026-08-14T23:09:56.204306Z","submitted_at":"2026-08-07T20:59:54Z","title":"Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach","version":1},"reference_index":146,"source":"pdf_text","source_observed_at":"2026-08-12T00:54:39.542386Z"},"links":{"citing_paper":"/paper/2608.10005"},"observation_digest":"sha256:1d3d05fab9e801ec4da8c614bed487aaa1838cff668b6317ff531edb90691da8","observation_id":"04a3f049-afaf-4976-a7b2-3d2d40a5f2f8","resolution":{"observed_at":"2026-08-12T00:54:39.542386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:54:39.433793Z","title":"Max-sum Revisited; The Real Power of Damp- ing","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.10005","last_updated":"2026-08-07T20:59:54Z","snapshot_observed_at":"2026-08-14T23:09:56.204306Z","submitted_at":"2026-08-07T20:59:54Z","title":"Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach","version":1},"reference_index":209,"source":"pdf_text","source_observed_at":"2026-08-12T00:54:39.433793Z"},"links":{"citing_paper":"/paper/2608.10005"},"observation_digest":"sha256:ca98b1a589d514af21263d4ff7cdd29321f304325609bc75609cfd0eed44d36f","observation_id":"2c567a5c-46ad-4db5-91f7-2c2b0c935d4e","resolution":{"observed_at":"2026-08-12T00:54:39.433793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02178370","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:08:50.044864Z","title":"Constraint Networks","venue":"Journal of Statistical Physics","work_id":"dba14b9d-490f-4344-a27c-24d7d26b041b","year":1992},"citing_paper":{"arxiv_id":"2608.10005","last_updated":"2026-08-07T20:59:54Z","snapshot_observed_at":"2026-08-14T23:09:56.204306Z","submitted_at":"2026-08-07T20:59:54Z","title":"Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach","version":1},"reference_index":496,"source":"pdf_text","source_observed_at":"2026-08-12T00:54:39.462084Z"},"links":{"citing_paper":"/paper/2608.10005"},"observation_digest":"sha256:a3d3098f5c54f789915a73c73ec50b1e0361fbe33b2a6a1af92cae41a2990db1","observation_id":"c3dc5178-34e5-42a0-8773-7a6abb79c28c","resolution":{"observed_at":"2026-08-12T00:54:39.765299Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-14T22:08:06.614949+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-14T22:08:06.614949+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2008.47831","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:54:40.354740Z","title":"Power-law Citation Distributions are not Scale-Free","venue":null,"work_id":"13a5eb58-4960-4ce1-8f11-40935840fb70","year":2017},"citing_paper":{"arxiv_id":"2608.10005","last_updated":"2026-08-07T20:59:54Z","snapshot_observed_at":"2026-08-14T23:09:56.204306Z","submitted_at":"2026-08-07T20:59:54Z","title":"Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach","version":1},"reference_index":1178,"source":"pdf_text","source_observed_at":"2026-08-12T00:54:39.504747Z"},"links":{"citing_paper":"/paper/2608.10005"},"observation_digest":"sha256:4f72c6e3905740a39238df6da4df2563e25cff97fc835e8ce193e9f95c720db0","observation_id":"f3471421-d19d-4739-8449-28ac1d06b373","resolution":{"observed_at":"2026-08-12T00:54:40.432036Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.10005","last_updated":"2026-08-07T20:59:54Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-14T23:09:56.204306Z","submitted_at":"2026-08-07T20:59:54Z","title":"Exploiting Structure in the Boolean Weighted Constraint Satisfaction Problem: A Constraint Composite Graph-Based Approach"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":4},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2608.10005."}