{"as_of":"2026-08-08T05:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:edcf3ce16f813f21942b92a407f41ff9824f0716a0a7faf70676eb2e55ee0b9d","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:11:01.852694Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"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.06138/citation-record","integrity":"/paper/2506.06138/integrity","json":"/paper/2506.06138/citation-record.json","paper":"/paper/2506.06138"},"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:11:06.333958Z","title":"Knapsack Problems","venue":null,"work_id":"9db79b97-2d4b-4fbe-b950-6f67eb58c960","year":2004},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T06:10:59.758521Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:bca66e1d1bb47a2d6c556de9b4e4b593f004c91d2664d36c44f048e885e755f7","observation_id":"b9990db4-1508-4e58-a1e6-6c9fbc64b6a5","resolution":{"observed_at":"2026-08-07T06:11:06.437020Z","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-07T06:11:06.178631Z","title":"A Minimal Algorithm for the 0-1 Knapsack Problem","venue":null,"work_id":"2df7b0bc-0878-474d-bb81-1a23e521026a","year":1997},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T06:10:59.797295Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:19fad4bc4e814f4dcec64564b6700bbb628a20ce10fd0a022370de263028a862","observation_id":"e349e231-9f90-4735-874b-abb3414ed770","resolution":{"observed_at":"2026-08-07T06:11:06.266132Z","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-07T06:11:05.990956Z","title":"An Algorithm for Large Zero-One Knapsack Problems","venue":null,"work_id":"b22aaaaa-aeee-49d3-b610-1fc8fd618871","year":1980},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T06:10:59.887503Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:8d927b2382ba756392d5e24ffd87bd505a6b98f91356b7b1a2723dfa19fa93ae","observation_id":"4bb02917-74a5-4dfe-9301-70f6ab366eab","resolution":{"observed_at":"2026-08-07T06:11:06.101465Z","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-07T06:11:05.802721Z","title":"Dynamic programming","venue":null,"work_id":"c02f77f0-71de-4fc6-ae68-b5ad306ac635","year":1957},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.015970Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:3295bf14af6706726bc1e2320aa30404311e3fdbf298c6965927a9bb144dfdac","observation_id":"1862f712-73b9-4794-a3e9-f8b1b8786ade","resolution":{"observed_at":"2026-08-07T06:11:05.909733Z","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-07T06:11:05.623734Z","title":"Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem","venue":null,"work_id":"357c2ac0-04ae-43e7-98cc-a7e40e028e70","year":1999},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.131328Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:adb0b9b4532a51b33df57cb804ae6257e6337681ee8bd73c1a2521bcabf9d77b","observation_id":"1e28a5e2-5831-450c-bcc5-b49f227ba8cd","resolution":{"observed_at":"2026-08-07T06:11:05.714948Z","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-07T06:11:05.431209Z","title":"New trends in exact algorithms for the 0-1 knapsack problem","venue":null,"work_id":"b3de3e15-3e4b-4479-9619-83c67599105b","year":2000},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.203850Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:44641dea68ec963f3e4c58d4789480ffa9df04aaef245a78a272e3b8507bfbc8","observation_id":"ba34b24c-cc99-4356-8ef1-e05c847df5ef","resolution":{"observed_at":"2026-08-07T06:11:05.529025Z","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-07T06:11:05.266678Z","title":"Dembo, Peter Ladislaw Hammer","venue":null,"work_id":"a73613d5-e694-4837-b792-72d031665129","year":1980},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.315067Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:c5bb6c77def1a877c6de88b23bbaa67790434536ddb20538d8408a8e3c49c797","observation_id":"2e9f13c2-5f32-44d4-a56c-b0dc1ea21e65","resolution":{"observed_at":"2026-08-07T06:11:05.322988Z","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-07T06:11:05.088196Z","title":"An expanding-core algorithm for the exact 0-1 knapsack problem","venue":null,"work_id":"1ad61a8b-f81b-4e0f-a78d-181105af57ae","year":1995},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.424282Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:cc3d33099edb7d26e4d3edacc3dcbe679c1367b8533d25a399867b02aa8b9bf9","observation_id":"3f28a1be-61a1-4612-97ab-a41a457dcaf8","resolution":{"observed_at":"2026-08-07T06:11:05.172080Z","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-07T06:11:04.970186Z","title":"Computer and Intractablility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979: 1-338","venue":null,"work_id":"aa10a140-aea4-4b7d-9e6b-3603d55c615f","year":1979},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.524005Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:79c6de4cd037b36774eb1dce8250109c778b1694aa0f1fcb2caa10c941085e24","observation_id":"fd40c7c9-5066-48c2-ad27-a93441f458f9","resolution":{"observed_at":"2026-08-07T06:11:05.023578Z","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-07T06:11:04.765041Z","title":"Reducibility among Combinatorial Problems","venue":null,"work_id":"8fd77c2d-1469-4970-92d5-b2ac0aa01636","year":1972},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.595057Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:7e462c00f67a95edd1cbe0d2c4421d5dd169b3d831541a30f0075345d3a053f7","observation_id":"a8f4f0f6-1adb-470b-8963-6d2beb45b8a4","resolution":{"observed_at":"2026-08-07T06:11:04.857522Z","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-07T06:11:04.581854Z","title":"Tolerance analysis for 0-1 knapsack problems","venue":null,"work_id":"59ee1be5-a078-4e59-b521-77e25cc31e01","year":2016},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.705145Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:d824fb4b5fbeac97207c83082bea9e95475c491007bcd76d1fe56984fb8d5f71","observation_id":"2e075f98-cd93-40f4-b118-0dcdeac2c4e1","resolution":{"observed_at":"2026-08-07T06:11:04.673741Z","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-07T06:11:04.401761Z","title":"Heuristic approaches for the two- and three- dimensional knapsack packing problem","venue":null,"work_id":"32e53fce-feb4-438a-947a-48fc004d5d9e","year":2009},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.815240Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:d32a975f7a79ed5dfe23126ab477451617139814df74b6410485b062c124c156","observation_id":"0a1b5ccc-262e-4379-97ee-dfc1a92af82b","resolution":{"observed_at":"2026-08-07T06:11:04.479603Z","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-07T06:11:04.240918Z","title":"QoS-aware service eval- uation and selection","venue":null,"work_id":"0cf43691-7e89-48bb-9506-3784d8b968db","year":2008},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.880691Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:2a1904b5b1e8428a9cc8801b5b54a2994e00a5441bf77a35b292e9071dd4bf86","observation_id":"034cb631-6cc9-4da3-a403-902d8ec2d719","resolution":{"observed_at":"2026-08-07T06:11:04.305556Z","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-07T06:11:04.099522Z","title":"Ingargiola, James F","venue":null,"work_id":"aee5d6a5-ba44-49d8-8447-fb9977dbc07e","year":1973},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:00.967996Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:992947bc3ec7538abc0b6e3cad19fcb01d095d1ce23ba8086da8d6b24b0b1a21","observation_id":"1c695841-e4e2-4b86-92d0-6351f3d8a6e6","resolution":{"observed_at":"2026-08-07T06:11:04.169444Z","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-07T06:11:03.951110Z","title":"A New Algorithm for the 0-1 Knapsack Problem","venue":null,"work_id":"2c9e6557-7336-41b7-a19e-18499e22efcc","year":1988},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.034396Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:ef6d07a753c9589d50921474a44f4b02701872281ab989769985054eb5a40c6d","observation_id":"e1efcf9f-4acc-4b3f-b897-3fe3e0d04a81","resolution":{"observed_at":"2026-08-07T06:11:04.016419Z","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-07T06:11:03.574808Z","title":"Knapsack Problems: Algorithms and Computer Implementations","venue":null,"work_id":"432c0d10-60dd-40b9-bc7e-123e78b690e5","year":1990},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.143891Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:c12ba9239d8687213613c98bfdab868d51f22ca5d428f8413569528154de9aeb","observation_id":"6d89f8bb-68b3-47a0-ae08-35748245528d","resolution":{"observed_at":"2026-08-07T06:11:03.781086Z","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-07T06:11:03.233559Z","title":"Cost Based Filtering for the Constrained Knapsack Problem","venue":null,"work_id":"093af681-8e43-46d4-9627-b56fa47470c2","year":2002},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.238458Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:f777c36e944b23afb5182dcb2f19fd1f0a32fdfaa87ec1443684ff0be11065b6","observation_id":"e1970722-1ba3-4da0-855c-94db9263a94e","resolution":{"observed_at":"2026-08-07T06:11:03.379458Z","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-07T06:11:03.018843Z","title":null,"venue":null,"work_id":"bc1b7cc4-cd70-444a-9b2c-c33a29cbb548","year":1957},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.338494Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:7bc1d36bef1e1141b7a46c89c9ff760650c9416543a6c40fabb360da4362bd95","observation_id":"3ecc3fa3-42b1-47fb-9c67-b0de9dcd7316","resolution":{"observed_at":"2026-08-07T06:11:03.141016Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T06:11:02.724876Z","title":"Dey, Yatharth Dubey, Marco Molinaro","venue":null,"work_id":"b3e2e91f-51f1-4408-ba50-4a1a8a0cb311","year":2023},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.460170Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:4623bf5cc36d63b0b652e59fa48595e207913586691a78069718129591f31ecc","observation_id":"118f89c4-2098-4475-85e0-f6e1fe87282f","resolution":{"observed_at":"2026-08-07T06:11:02.887237Z","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-07T06:11:02.484657Z","title":"Where are the hard knapsack problems ? Computers & Opera- tions Research, 2005, 32: 2271-2284","venue":null,"work_id":"a9f8f03d-a466-40c8-914c-ebdf43a510ce","year":2005},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.555202Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:c2e15c4a56482490f2436f81efc874e3972ff21d297edf7091870ce5c7e99914","observation_id":"14364988-eed9-4578-9b50-0cb2db831941","resolution":{"observed_at":"2026-08-07T06:11:02.586531Z","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-07T06:11:02.335504Z","title":"YALMIP: A Toolbox for Modeling and Optimization in MAT- LAB","venue":null,"work_id":"e69690ef-0409-44a1-9ed0-20f88e582a47","year":2004},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.650943Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:7a4fea94aab556818cac84be61243895f093cd4ad32c0462e70085912ecc675c","observation_id":"eb5a76f6-6c2e-4ade-8ad4-4e1d162fc3bb","resolution":{"observed_at":"2026-08-07T06:11:02.404879Z","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-07T06:11:02.144083Z","title":"Iterated two-phase local search for the Set-Union Knapsack Problem","venue":null,"work_id":"38403797-5965-42a0-9b83-b60fc6f33042","year":2019},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.757259Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:603963a183ebed4c84fae965638e3cd69db367cf7e9003ba12210d2801a7c172","observation_id":"1bcdc411-8e0b-4861-9d37-987b1b368ded","resolution":{"observed_at":"2026-08-07T06:11:02.244569Z","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-07T06:11:01.961435Z","title":"A New Class of Hard Problem Instances for the 0-1 Knapsack Problem","venue":null,"work_id":"38ba4ded-bcb5-4435-adb3-d7e5fb49b538","year":2022},"citing_paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T06:11:01.852694Z"},"links":{"citing_paper":"/paper/2506.06138"},"observation_digest":"sha256:bb826fd30d97ba98ba2cdf1028f4c154b782c598a6b4e26c51984558e3868b07","observation_id":"51aa6af3-2359-429a-abb7-74e5c6edd1a8","resolution":{"observed_at":"2026-08-07T06:11:02.029924Z","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"}}],"paper":{"arxiv_id":"2506.06138","last_updated":"2025-06-06T14:55:12Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-07T05:57:29.252356Z","submitted_at":"2025-06-06T14:55:12Z","title":"An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":23},"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 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2506.06138."}