{"as_of":"2026-08-19T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e6dea0523acc07a763d7377eb4b6256f68cdb8867350f5e25a3ad4da67dd3c6","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T20:50:32.954025Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2511.18639/citation-record","integrity":"/paper/2511.18639/integrity","json":"/paper/2511.18639/citation-record.json","paper":"/paper/2511.18639"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18420/delfi2025_30","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[Jan10] Predrag Janicic","venue":"Gesellschaft für Informatik (GI)","work_id":"66331433-97d4-45e8-8b12-48dab28defae","year":null},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.288100Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:3a240236539bb49305e2281c9dad14277617fd97af44d08c1b7cf5f184660c11","observation_id":"7ae3aa63-0404-4441-bb84-0d3741c68a25","resolution":{"observed_at":"2026-08-03T20:53:26.204740Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:32.669557Z","title":"[KT07] Jon Kleinberg and Eva Tardos.Algorithm Design","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.669557Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:ff480b1dde32e791bbea4f4d2102611380b8b9f39407b036e84bc3cbee483d27","observation_id":"f1732a15-3faa-4c59-a5ab-dc9cd33be35f","resolution":{"observed_at":"2026-08-03T20:50:32.669557Z","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-03T20:50:32.206839Z","title":"Gesellschaft f¨ ur Informatik e.V.,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.206839Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:b37e69cd9ead1070eb925ce8074f94fe5160226b122957c1e939f1b57a178f38","observation_id":"f5971bed-dd30-4ad0-b8c1-e42716647caf","resolution":{"observed_at":"2026-08-03T20:50:32.206839Z","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.1145/368273","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:53:26.295962Z","title":null,"venue":null,"work_id":"73683a7a-51ff-4dcf-831d-ff774fdc2c88","year":null},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:31.820655Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:625e0c376d907a2d1438b318d32a2947e6ff9267b43bf8622523fcbaed37c225","observation_id":"3c66419f-efc8-46b1-9f69-b0054cdc3ea2","resolution":{"observed_at":"2026-08-03T20:53:26.384764Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:31.722266Z","title":"[DLL62] Martin Davis, George Logemann, and Donald Loveland","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":1971,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:31.722266Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:b5a7a5da46548dcbd0d655db2a71993523ee5dc9d8f8e319ad0d96342354b7ba","observation_id":"f31f9de2-2602-4616-ab13-b728211c4714","resolution":{"observed_at":"2026-08-03T20:50:31.722266Z","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-03T20:50:32.525269Z","title":"Analysis of boomerang differential trails via a sat-based constraint solver URSA","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":1976,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.525269Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:2a0bd394a2674db2ea5d12489130b78a239db4a3cad9cdf95f3f7c61e9805b24","observation_id":"1dbb91b3-f5cc-40d1-9716-f0517ae39323","resolution":{"observed_at":"2026-08-03T20:50:32.525269Z","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-03T20:50:32.025710Z","title":"Specification and automatic verification of computational reductions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.025710Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:6133a4a9a14e4fe019ad51c4fa1dfeeba916efd11243d3516b3e9190f8ad693b","observation_id":"be21cba9-e88e-41d8-b47c-0c3b568b6136","resolution":{"observed_at":"2026-08-03T20:50:32.025710Z","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-03T20:50:32.893618Z","title":"Automatic polytime reductions of NP problems into a fragment of STRIPS","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.893618Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:2c16783ec097d96ac39d4b3ef39b5636b2a2460db40f0ed31be5502f84d03d96","observation_id":"4541a024-370f-4662-8132-18da3cff9fce","resolution":{"observed_at":"2026-08-03T20:50:32.893618Z","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-03T20:50:32.811612Z","title":"[Pap95] Christos Papadimitriou.Computational Complexity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.811612Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:9d17150460b7e35535cb467e087455101069f7d1c1302856504ad87dcaca04b9","observation_id":"d5355cae-7f79-421c-b8e7-bdd2304c5d4b","resolution":{"observed_at":"2026-08-03T20:50:32.811612Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:31.716448Z","title":"Automatic evaluation of reductions between np-complete problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:31.716448Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:f3d2315e07c2bc44d30a1da1c34d2fc6f0d75bea4a7298f598a4c0222bb214fb","observation_id":"38419ede-26bf-473f-b1fd-4d0f61a045a0","resolution":{"observed_at":"2026-08-03T20:50:31.716448Z","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.2168/lmcs-8(3:30)2012","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[JK13] Charles Jordan and Lukasz Kaiser","venue":"Logical Methods in Computer Science","work_id":"915e0d93-42f7-487c-aa21-90d825e977e0","year":2012},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.345603Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:2ff8db24cb8a2476d8ead781148814451436bee2466ce491eea4e40c44653ee2","observation_id":"ae5d7ced-1e00-494b-b001-e59b37868a0b","resolution":{"observed_at":"2026-08-03T20:53:26.092518Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:32.724427Z","title":"[MMZ+01] Matthew W","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.724427Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:1b7c7b6ea1026f68516a157c5a94ba05051871f3a9b658911f2c836662b35283","observation_id":"33ca02ac-3196-4f2d-9e1a-35209f2101b9","resolution":{"observed_at":"2026-08-03T20:50:32.724427Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-28166-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[KRS+25] Tristan Kneisel, Elias Radtke, Marko Schmellenkamp, Fabian Vehlken, and Thomas Zeume","venue":"Lecture notes in computer science","work_id":"1c1a3807-afb9-4cfa-926e-4e52a252a44e","year":2025},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.580392Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:d409cd71c9ac87d3275c70a48ba8a4f2a9bf7268f549d885d8c49311ef4fc960","observation_id":"0b42470e-b2c3-41cc-8536-8e9eeb47c1e2","resolution":{"observed_at":"2026-08-03T20:53:25.684741Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:32.954025Z","title":"[ZHD22] Chenhao Zhang, Jason D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.954025Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:4484cfba2f84d9e1a2e63d7950f5deb29a2391e92d7148e4584478af5929e3be","observation_id":"859389e0-8457-4f3b-b5b8-41d4ec808027","resolution":{"observed_at":"2026-08-03T20:50:32.954025Z","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/s10817-022-09629-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"26 A SAT-BASED APPROACH FOR REDUCTIONS BETWEEN NP-COMPLETE PROBLEMS [Kar72] Richard M","venue":"Journal of Automated Reasoning","work_id":"218092c6-4ab9-495e-b464-0a54457a76f4","year":1972},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.432428Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:3c5b91decbc36f1959be1e7654c994059b0e895a01f7a04f154ef14141c60398","observation_id":"e374fa3e-6c2a-4dff-8c40-53a4b9e61035","resolution":{"observed_at":"2026-08-03T20:53:25.891060Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T20:50:32.122841Z","title":"MFCS.2024.56,doi:10.4230/LIPICS.MFCS.2024.56","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:32.122841Z"},"links":{"citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:32d9f5783b823446ce404547f2494c5d649b8cb457f5cced3582abef7a431ba2","observation_id":"93799006-6a78-4d3f-aca6-4a49131385a7","resolution":{"observed_at":"2026-08-03T20:50:32.122841Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14705","last_updated":"2025-01-24T18:30:19Z","snapshot_observed_at":"2026-08-16T02:18:02.647553Z","submitted_at":"2025-01-24T18:30:19Z","title":"The Karp Dataset","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14705","snapshot_observed_at":"2026-08-03T20:50:31.901768Z","title":"[ES04] Niklas E´ en and Niklas S¨ orensson","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T20:50:31.901768Z"},"links":{"cited_paper":"/paper/2501.14705","citing_paper":"/paper/2511.18639"},"observation_digest":"sha256:209eb64eadb5e773b7dd8344ec7ac93e32aeb8914e319e6e8ed655450cf18e08","observation_id":"505d3e93-9dc2-4f1a-9488-404454c91119","resolution":{"observed_at":"2026-08-03T20:50:31.901768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.18639","last_updated":"2026-06-29T07:34:53Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-18T04:27:43.519960Z","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":17},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2511.18639."}