{"as_of":"2026-08-08T04:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bda29b5618a661f74899f616ccf31350eb88b60d822809125cc5ed8a2d94949a","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:10:18.334797Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.03330/citation-record","integrity":"/paper/2506.03330/integrity","json":"/paper/2506.03330/citation-record.json","paper":"/paper/2506.03330"},"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-07T11:10:18.601286Z","title":"Martello and P","venue":null,"work_id":"2b07aa67-c76e-4298-bb98-72db06c73dc1","year":1990},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.627811Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:7818aff23b656a8657a7f387886794b5b88bf64cf35db869640fa795f8fde709","observation_id":"65096775-e2f6-401a-9e3c-76e508c9d179","resolution":{"observed_at":"2026-08-07T11:10:18.606363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.584773Z","title":"A new branch-and-price-and- cut algorithm for one-dimensional bin-packing problems,","venue":null,"work_id":"3b54ee41-52fc-4bdd-85c0-2d9912db7b0d","year":2019},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.680870Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:807043e0e4ed24e964e5e166dceb492c31e8510aadffbcfc3cd638e7eb5b7a6f","observation_id":"43dffdd9-6cc7-4a16-b311-fc7be059f33c","resolution":{"observed_at":"2026-08-07T11:10:18.589246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:17.723516Z","title":"A branch-and-bound algorithm for the knapsack problem with conflict graph,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.723516Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:1dfe3a3f3992bc58e8d38cd71e75cd7ebfb1a02108868657a5f0c0c2042f5738","observation_id":"3678c4fc-0ddd-4726-8bf2-b2bf0c92623f","resolution":{"observed_at":"2026-08-07T11:10:17.723516Z","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-07T11:10:18.559282Z","title":"Heuristic and exact algo- rithms for the disjunctively constrained knapsack problem,","venue":null,"work_id":"d72701a4-8747-4c8d-87e4-1cf3ba9630ea","year":2002},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.805365Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:ec9abf4fedff4338a3633e26596112be187b09eb4112e871c688b639980e870a","observation_id":"7af128db-0354-4687-b875-e6f083101716","resolution":{"observed_at":"2026-08-07T11:10:18.564401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.543148Z","title":"Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem,","venue":null,"work_id":"dfbab7c1-0e74-480a-97a2-2be4eb42f39a","year":2007},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.855531Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:958a943dd9fb0bbb34c823fec75f392a9d533b4647ac9b6556243d959eee0674","observation_id":"3d51e311-630a-4909-b5b4-337f6cbe30d5","resolution":{"observed_at":"2026-08-07T11:10:18.548056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.529127Z","title":"A reactive local search-based algorithm for the disjunctively constrained knapsack problem,","venue":null,"work_id":"bd0b57eb-e312-4402-bd08-fb610da51408","year":2006},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.915029Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:608952dc8ef855e21e42117824533c7135406facaaf41aa8a34bdaab2dba374a","observation_id":"d7b20c50-5be0-44a9-b0f1-39ed60e21051","resolution":{"observed_at":"2026-08-07T11:10:18.533586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.513500Z","title":"Local branching- based algorithms for the disjunctively constrained knapsack problem,","venue":null,"work_id":"73855f13-5de2-4b3f-adfd-46d638352b84","year":2011},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:17.995368Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:18205cb3930a4f415c98818a92440476e253967ecc677702360156ab996c6c3b","observation_id":"a8062cdc-1593-4e54-b49e-31a8cc21cc2b","resolution":{"observed_at":"2026-08-07T11:10:18.518186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.499713Z","title":"An algorithm for the disjunctively constrained knapsack problem,","venue":null,"work_id":"44d7ca2f-05ce-40f1-bb8c-2d170da2c27b","year":2012},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.032588Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:d7a7c07f535d1bc9dfa742906311f934794fef6cea2799acae8572efd24b458b","observation_id":"46e8feeb-00eb-4b13-b84b-5c891ce907a1","resolution":{"observed_at":"2026-08-07T11:10:18.504380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.485035Z","title":"An iterative rounding search-based algorithm for the dis- junctively constrained knapsack problem,","venue":null,"work_id":"d8db9379-7ac7-4ec3-b66c-aa7dfc595871","year":2014},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.052577Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:84ee5723f2d476435fa934c5726acb9f56b9a684cbf78d8bfb6f3b88b1edd154","observation_id":"39afa873-d0c2-4d83-9e36-6908fac911f2","resolution":{"observed_at":"2026-08-07T11:10:18.489534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.102080Z","title":"A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.102080Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:5e43c02c3a7aa2c29871b75d8eb4ee3deba85a9221e9e93a46013a3f4053adca","observation_id":"b60ac19d-0b51-4eb4-9805-6c2b6687170e","resolution":{"observed_at":"2026-08-07T11:10:18.102080Z","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-07T11:10:18.155383Z","title":"Google OR-Tools - CP-SAT,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.155383Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:1917123b72fc7f4b890351eff196c8b80fbc0f25e83f1b227b545af6364db417","observation_id":"c8c5e6a2-ccd0-476d-90d1-57182e946ef7","resolution":{"observed_at":"2026-08-07T11:10:18.155383Z","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-07T11:10:18.213670Z","title":"Solving the parallel drone schedul- ing traveling salesman problem via constraint programming,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.213670Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:994cad07f01a8bbfd189c8de79c542c89440a503eabf31bbd2ec22e9f0677205","observation_id":"f2d44a72-8b27-4f00-987a-e3bae8477929","resolution":{"observed_at":"2026-08-07T11:10:18.213670Z","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-07T11:10:18.271325Z","title":"Parallel drone scheduling vehicle routing problems with collective drones,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.271325Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:a6f5e3f855e74b5cdcde7955d5a344454fde3605c0a4b8bc5483581888d72cf3","observation_id":"6734d488-9713-4709-a2bd-9823ad81efcc","resolution":{"observed_at":"2026-08-07T11:10:18.271325Z","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-07T11:10:18.296222Z","title":"Solving a home healthcare routing and scheduling problem with real-world features,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.296222Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:c5f677ca88830e0c1e98a806a22185305f345753ba9373657e9d805503a1cc3e","observation_id":"30dfefc9-39d3-4f0f-849c-8163e9ac02ff","resolution":{"observed_at":"2026-08-07T11:10:18.296222Z","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-07T11:10:18.403957Z","title":"A hybrid grouping genetic algorithm for bin packing,","venue":null,"work_id":"5af20d13-e3de-4ae5-ba8f-b7cb17a90026","year":1996},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.307409Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:9e32e3e664fdc637d514c16740af9c79abcdeadc2e8d9416764e8999e59df552","observation_id":"8ecec115-e812-46e7-abfb-1d4e52a1c3c6","resolution":{"observed_at":"2026-08-07T11:10:18.409365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:10:18.388365Z","title":"IBM CPLEX Optimizer,","venue":null,"work_id":"1b6e8ef9-914c-4238-98f4-e667a70b7e01","year":2024},"citing_paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:10:18.334797Z"},"links":{"citing_paper":"/paper/2506.03330"},"observation_digest":"sha256:221c5941677e52bc5b60864456136213723d5d4703b60961514183da834ff661","observation_id":"02e152b9-3eba-4d84-ac05-be732b4088f9","resolution":{"observed_at":"2026-08-07T11:10:18.393835Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03330","last_updated":"2025-06-03T19:22:04Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T11:03:29.991257Z","submitted_at":"2025-06-03T19:22:04Z","title":"On Solving the Knapsack Problem with Conflicts"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":9},"total_outbound_references":16},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.03330."}