{"as_of":"2026-08-08T02:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aac801425929d4d03d3c179e0ae9d8d1634d22c568627fa5cc309b7d83f8ab0e","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:51:31.678108Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"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.12080/citation-record","integrity":"/paper/2506.12080/integrity","json":"/paper/2506.12080/citation-record.json","paper":"/paper/2506.12080"},"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-07T05:51:33.704452Z","title":"Huang, Statistical mechanics, New York: Wiley, 2008","venue":null,"work_id":"1c0f558d-4ce6-41fa-913f-c842adbc68bc","year":2008},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.929980Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:bd4e4f2cc12ab5b6ef574ae0bbc113a3f4796087be3d6960432f8153aec7a27f","observation_id":"2f7b6444-1ad9-478e-af5b-a786caad829c","resolution":{"observed_at":"2026-08-07T05:51:33.714373Z","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-07T05:51:30.945927Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.945927Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:36659b5b79754a57b20cb0d1f8be3bc7cca53a7724258c3ce8d02ef1efccf2b8","observation_id":"cb5397f2-f983-4d44-9cd2-0686dffe5b15","resolution":{"observed_at":"2026-08-07T05:51:30.945927Z","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-07T05:51:30.952713Z","title":"Barahona, On the computational complexity of Ising spin glass models, J","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.952713Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:81314f874aa0607f316a234843c34c58ac50eea23b55362267c927b68084db61","observation_id":"3f9abfa8-897f-4788-ba99-6628bcc63151","resolution":{"observed_at":"2026-08-07T05:51:30.952713Z","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-07T05:51:30.960590Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.960590Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:04a18c6d8c03cac9c900999829ace2235753e8791868d56b21722b12dd2009c8","observation_id":"85f4531a-2a9f-4374-8d63-8747faa66e55","resolution":{"observed_at":"2026-08-07T05:51:30.960590Z","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":"5305.33531","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:33.423228Z","title":"Istrail , Statistical mechanics, three -dimensionality and NP -completeness: I","venue":null,"work_id":"de87e792-3921-43bd-9e46-fab7b937c536","year":2000},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.968444Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:5da4122a44f92f6d6d05e12ed67cee58345090e598e6a37faf5d1dffe333970a","observation_id":"713bbd9d-4f70-45ce-9583-b7e178bb0876","resolution":{"observed_at":"2026-08-07T05:51:33.437267Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-07T05:51:33.678147Z","title":null,"venue":null,"work_id":"71b4557f-eac4-4e88-a9cd-6405e8d8f6c4","year":2013},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.982259Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:32fa13b4f3f8d738c4582f70ecd7cc809abb48d4ee2dca19e9f5a6c898d1e1cd","observation_id":"8ebc215e-61bc-4bb8-92a8-68fc290da7d7","resolution":{"observed_at":"2026-08-07T05:51:33.683083Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:30.991423Z","title":"Ising, Beitrag zur theorie des ferromagnetismus, Z","venue":null,"work_id":null,"year":1925},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:30.991423Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:0e4ee3a57c1a55abd1e00b6416c6dbdc67c5086d1b6f2dc1eef1f0f070d1ab3b","observation_id":"1b318685-3644-4ddd-b9fc-ab918cc01e8f","resolution":{"observed_at":"2026-08-07T05:51:30.991423Z","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-07T05:51:31.003478Z","title":"Onsager, Crystal statistics I: a two -dimensional model with an order -disorder transition, Phys","venue":null,"work_id":null,"year":1944},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.003478Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:64054f6f01223e44a5a99bf2531eb16c1bda3da1c0a68652e566566a856dfa23","observation_id":"55132d88-0675-42db-98b5-719aa6229ffb","resolution":{"observed_at":"2026-08-07T05:51:31.003478Z","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-07T05:51:31.013382Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.013382Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:c54d9e96da9c7862e266717c3b02efbadffdf2dd0eacb6fdeb3af2f8408245c0","observation_id":"0ded23e1-9d31-42c1-90de-39230822202b","resolution":{"observed_at":"2026-08-07T05:51:31.013382Z","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-07T05:51:33.651272Z","title":"Garey, D","venue":null,"work_id":"ab703092-545c-45c4-9c3a-15eab1f4791d","year":1979},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.019615Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:3759304f0d1ef7dea01f2514c9878154ee6f3e1b134db4ab4795ff82fc6e1063","observation_id":"7145c306-a900-44a7-a925-823fedd94a64","resolution":{"observed_at":"2026-08-07T05:51:33.658799Z","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-07T05:51:33.620276Z","title":null,"venue":null,"work_id":"6199a0db-46b9-4251-9139-d573dab08efb","year":1994},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.026220Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ccba9912031ae4dd539dcb3fd5a40b2bb520e7072af7c9c45807f7617e123fa9","observation_id":"4dddc203-6455-4ea3-9438-96a3a583f274","resolution":{"observed_at":"2026-08-07T05:51:33.633573Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.032091Z","title":"Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , 1971, 151 –158","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.032091Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:01ce99be117dbd360104499d279e1ce26d99ac8994aa5224bdd04229e6047357","observation_id":"a0c91697-4430-4e2d-803e-0401a07c2463","resolution":{"observed_at":"2026-08-07T05:51:31.032091Z","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-07T05:51:33.594538Z","title":null,"venue":null,"work_id":"dcd4fc08-1bd4-4fa9-a82f-9829f6dc2a63","year":1973},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.038518Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ef5aa5fa75acdfb681e7658065f4fa3516f1284f969ded77da45afdc822f5c6e","observation_id":"253d7a27-adf7-463f-ad0b-732f1e7a2de1","resolution":{"observed_at":"2026-08-07T05:51:33.604261Z","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":"10.1016/j.jmst.2019.12.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.541542Z","title":null,"venue":null,"work_id":"7b01f77d-af1d-4f51-870c-d1fb209b6175","year":2020},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.044676Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ecad62c9b38111dccd8a785ad7692f7cff2649bccf911a5f413fcba047beb328","observation_id":"f3de960e-dd5b-4f35-8aae-0b8bdae1dd6f","resolution":{"observed_at":"2026-08-07T05:51:32.548266Z","resolver_source":"doi","status":"verified_exact"},"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":"10.3390/math11010237","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.515941Z","title":null,"venue":null,"work_id":"ded62803-05d7-4802-9949-d2c5c20f8889","year":2023},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.050535Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:675ec6ae415ac9e8efdad4ff4ebdea79f9844dacc9feebddb11397a1e76e1b91","observation_id":"4c1e1f24-4d5b-4787-9f1a-dce99f255dce","resolution":{"observed_at":"2026-08-07T05:51:32.524379Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:33.567559Z","title":"Dantzig, Numbers: the language of science, London: George Allen & Unwin, Ltd., 1930","venue":null,"work_id":"7bfa8d1f-7f24-4793-aa99-c03e96b53dbe","year":1930},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.058942Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:0d15f75e175a7ab004f9ae47b0f63429d4c60208e9087a744e24615d519dec2d","observation_id":"3d367796-e3cd-4fae-8a5a-c9277567d0a7","resolution":{"observed_at":"2026-08-07T05:51:33.575063Z","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":"10.1112/plms/s1-28.1.486","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.488400Z","title":null,"venue":null,"work_id":"33101a05-f18a-424f-86b5-70f55e743e95","year":null},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.067757Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:0fc1403ded136a450f3a22d03deb52374c62c1c5d3ab000924952c5a42323494","observation_id":"f22aeb39-8355-4f5e-9562-541d6316d0be","resolution":{"observed_at":"2026-08-07T05:51:32.503073Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/s0377-2217(99)00260-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.459439Z","title":"Mar tello, D","venue":null,"work_id":"a4f1b728-295e-4e12-b13c-1d7c6cdf6141","year":2000},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.073608Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:43630cf5bcfb73f6b37a984a0f71ff89b91a184f329a59fbeb8dfcfb177de5fc","observation_id":"e1e9041d-bcf4-4234-844a-ca1216e9a850","resolution":{"observed_at":"2026-08-07T05:51:32.465948Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.080773Z","title":"Pisinger, Where are the hard knapsack problems? Comput","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.080773Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:5f9d18cc404ba2edb6a9ee90392d3176743807e7461c45b07a5cee99b31244df","observation_id":"9bba41b9-bd0f-4ab9-a42f-230a26afcae4","resolution":{"observed_at":"2026-08-07T05:51:31.080773Z","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/bf01580448","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.420375Z","title":"Fayard, G","venue":null,"work_id":"dd780250-70ef-4e53-ae0f-ce0f1ae9f737","year":1975},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.089134Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:684e705ae738bff728025ba6958ce33ec941006b11d95fcc19d89b1fa7266ce3","observation_id":"800f1586-b8f9-4803-ae5b-0365ba7052bd","resolution":{"observed_at":"2026-08-07T05:51:32.426160Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.105588Z","title":"Al -Shihabi, A novel core -based optimization framework for binary integer programs- the multidemand multidimesional knapsack problem as a test problem, Oper","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.105588Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:04b160d281a886eb4b54cf35388782f8c201f55f3dd7832ede3781bbd38b78f8","observation_id":"afca7d5f-1cd7-4428-a10c-3d387c2c0ee6","resolution":{"observed_at":"2026-08-07T05:51:31.105588Z","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.1016/j.dam.2004.09.007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.393949Z","title":null,"venue":null,"work_id":"3f9b7235-7ee6-4a58-9fda-0cc3b604b6ef","year":2005},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.112392Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:b320eb76b551f879f4b09b81666b1273461e305e08b4f0e311e2a453242fca87","observation_id":"4a70dae9-b111-4d4c-92c6-24bf15ac41b8","resolution":{"observed_at":"2026-08-07T05:51:32.401167Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.118656Z","title":null,"venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.118656Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:fcc499d7a85d8573fc8ff9c0bd54f5964a1a88b9128d06b2c4d092a6c73ade70","observation_id":"42f5af2b-c5db-4f0a-9aaa-02af878ecd01","resolution":{"observed_at":"2026-08-07T05:51:31.118656Z","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.1016/s0377-2217(99)00453-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.351848Z","title":"Toth, Optimization enginee ring techniques for the exact solution of NP -hard combinatorial optimization problems, Eur","venue":null,"work_id":"9ca43d20-eb91-4b17-a00e-6c0876c5b4c9","year":2000},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.125063Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:e0ec7b6cb44e4126a25b72f47a403cfee0ee7ef0fd8b8037a2042f283fa6fbb6","observation_id":"60291dfd-a8d6-4991-958b-b6622c2c0bc5","resolution":{"observed_at":"2026-08-07T05:51:32.358102Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/bf02846491","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.332671Z","title":"Venkataraman, G","venue":null,"work_id":"b902798c-9c4c-410f-a4ac-8c107d1c70d4","year":1991},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.131534Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:7f1119086a683affbf98f3a906895b5f6a8840a3f4a8a9a278ee91ca5fae71ef","observation_id":"3c22afc1-99f6-4842-8930-3b0c425ea35f","resolution":{"observed_at":"2026-08-07T05:51:32.339505Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s00006-018-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.314647Z","title":null,"venue":null,"work_id":"acf00a5a-5a78-4eed-89d4-2c4c46d189f4","year":2019},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.137909Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:c68c49edb1f32e657888b47ba2de3b3e9aba70cdaaff50f96380d55f1bcb6f14","observation_id":"42436a86-a564-4283-9bbd-928b22f75e79","resolution":{"observed_at":"2026-08-07T05:51:32.319835Z","resolver_source":"doi_truncated","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/math9070776","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.293661Z","title":"Suzuki, Z","venue":null,"work_id":"7554daed-da2f-4988-85f7-5caf787cb8d8","year":2021},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.148600Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:274bc0976d1fe8a61e1696265038d7bcfca7532a2364b46c168f6eed50594b8e","observation_id":"7254e908-550a-4859-a374-7ba4e5dded67","resolution":{"observed_at":"2026-08-07T05:51:32.301311Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.cjph.2024.05.021","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.274986Z","title":null,"venue":null,"work_id":"f4965a6e-9740-4823-a0b3-c869b8e08848","year":2024},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.158615Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:34c537995a58a7bef12cd9005715829ab20ce39b8d1010549e86de78a7bea9a1","observation_id":"050d3acb-67f2-4778-97c8-375209b0b20e","resolution":{"observed_at":"2026-08-07T05:51:32.281634Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physrevlett.81.4740","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.249449Z","title":"Ghosh, C","venue":null,"work_id":"a53c6d70-708c-471c-8432-381c0b1767b3","year":1998},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.167013Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ba8f6076bb62d552cb91281698619149524ad7e503a7b2d30c9cdcb29e06412e","observation_id":"6c3e3f26-fde8-40d7-99c1-b263fdbc22ef","resolution":{"observed_at":"2026-08-07T05:51:32.257442Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physrevlett.22.603","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.220143Z","title":null,"venue":null,"work_id":"811fe07a-6dd9-4d11-a9b6-9addaac508b0","year":1969},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.176427Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:f05d57cc9270c8350012b54cc6e6199e6a272dc50b3cd643e3d1b02f53bbefba","observation_id":"ace4666f-671c-41aa-be98-8459bf04d697","resolution":{"observed_at":"2026-08-07T05:51:32.227172Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physrevb.96.144429","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.186052Z","title":null,"venue":null,"work_id":"27720a09-6bb3-4946-8488-90bc07f3825d","year":2017},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.195335Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:bc6d34152691759f6596978955e4499ae4e51b26b98c6f1a5cc745f8c29e233e","observation_id":"4a3c2b3f-37b5-44ee-82bc-f3641a8b49af","resolution":{"observed_at":"2026-08-07T05:51:32.195140Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physreva.108.012415","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.157033Z","title":null,"venue":null,"work_id":"41dde362-7892-4a20-87ca-a53355387a33","year":2023},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.202675Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:a28a9cff8ba68fbdecdc17ad9b1a4632115937457d3f98252ec2b138385fbed4","observation_id":"d5fac23d-d3b0-40ae-9d6a-223c2f59f1ed","resolution":{"observed_at":"2026-08-07T05:51:32.167585Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physreve.109.055301","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.131643Z","title":null,"venue":null,"work_id":"ab68a799-7dbf-4d38-bc2e-4f391179cee9","year":2024},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.213849Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:2bdbd81ba39f213fed500a67d3b1e0acd1b48b9738079ed3623918dfb622e6c0","observation_id":"e2ced49d-6858-44a8-915b-2a94505898a0","resolution":{"observed_at":"2026-08-07T05:51:32.140098Z","resolver_source":"doi","status":"verified_exact"},"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":"10.3390/e25030541","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.107727Z","title":null,"venue":null,"work_id":"d220ebfd-61a1-4df4-a899-3ba00b8ccb37","year":2023},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.221474Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:655a2466cceb1a9ff61a25767e61206a61179cac7a43fb8be485141e5c7b5d1e","observation_id":"a6263670-0c89-47de-8015-fd32bb28f032","resolution":{"observed_at":"2026-08-07T05:51:32.115286Z","resolver_source":"doi","status":"verified_exact"},"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":"1864.32187","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:33.193707Z","title":"Ladner, On the structure of polynomial time r educibility, J","venue":null,"work_id":"6749496d-7120-4e47-95a8-d13e7001e880","year":1975},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.233872Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:036ccf0de27e542a6cec2445d0a2bd9afdf1beecd636dea802d53b9718be75e5","observation_id":"8fbd07bb-bc0a-4535-b9a4-66efb2b431b6","resolution":{"observed_at":"2026-08-07T05:51:33.203941Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":"10.1016/j.tcs.2015.03.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.079134Z","title":"Jonsson, V","venue":null,"work_id":"b49f1b66-a764-45dc-84fc-fa7ee6997eb8","year":2015},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.246353Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:a01ab4a4c734ff324ef83612e0d8927d95983261114147129d4ff9ca6c536e9c","observation_id":"4afa2839-ff7e-4d06-9b2a-571d1404587d","resolution":{"observed_at":"2026-08-07T05:51:32.085129Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.258265Z","title":"Bellman, A Markovian decision process, J","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.258265Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:d6816602cab02874ec983efe924dcb61aa7453b83d0d385c9894872afd71f155","observation_id":"7150838b-fdfe-4773-9595-29cc6c1a7b68","resolution":{"observed_at":"2026-08-07T05:51:31.258265Z","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.1103/physrevb.99.195301","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.041677Z","title":"Kyriienko, H","venue":null,"work_id":"3a235d4b-461f-4f54-a729-01b7185bdc83","year":2019},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.271511Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:1959d43ee474e45484747f7c69a4df32a73553f40131b546686eaf82b51297ca","observation_id":"9b8ebbf6-cc0f-489b-9009-07d1a3a94618","resolution":{"observed_at":"2026-08-07T05:51:32.048964Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:33.542049Z","title":null,"venue":null,"work_id":"430b8689-2686-4861-9cea-44822f373166","year":1957},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.287445Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:b41649e3a7db2263fbe4ff460c1be08f3bb0f71629f1791b78737421e21a0d36","observation_id":"12d00436-440b-4f1f-81c7-ae8b5446db8c","resolution":{"observed_at":"2026-08-07T05:51:33.550467Z","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":"10.1287/opre.5.5.723","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.988197Z","title":"Bellman, Letter to the Editor–Comment on Dantzig’s paper on discrete-variable extremum problems, Oper","venue":null,"work_id":"5224e11d-115d-4512-b3a1-a4ad5e70d4db","year":1957},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.313927Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:4e2503da6b277d2cf225a9081cb141136d1cb1470b6ce3006d371dfad5defc9a","observation_id":"fc5cb31b-cede-4cb9-9d02-942aea44d5f6","resolution":{"observed_at":"2026-08-07T05:51:31.999597Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.351647Z","title":"Cacchiani, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.351647Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:a508f0b594d5bcf48f28d40501dfc5cffe8ae8103807f0d22565f5a84c0b3403","observation_id":"9741ba24-b4c1-402b-914f-2674cc1c2dc2","resolution":{"observed_at":"2026-08-07T05:51:31.351647Z","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-07T05:51:31.368647Z","title":"Kellerer, U","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.368647Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:d544fe0107c5bed6ec6c5f76922e3724dbdefaf56584447b77081cde0ec934c0","observation_id":"c919d3bb-756f-4748-a120-39aa83e82e5b","resolution":{"observed_at":"2026-08-07T05:51:31.368647Z","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-07T05:51:33.511254Z","title":"Nishimori, Statistical physics of spin glasses and information processing: an introduction, Oxford University Press, 2001","venue":null,"work_id":"1e25be0c-8092-4a96-b058-90eedd87cde2","year":2001},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.452067Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:a8797a7552be25a2296e9cdac69332a5cd06ce1d6e89baceefc3717d315be898","observation_id":"3fad99de-fbf5-4e9b-8030-ff371e157cda","resolution":{"observed_at":"2026-08-07T05:51:33.518976Z","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-07T05:51:31.565117Z","title":"Kirkpatrick, D","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.565117Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:b02e640dbbcebd07b0bacfe7004adc609fa711f6548e5856b6ba768f3fde98d9","observation_id":"851a3394-3147-414a-889e-0933405599ff","resolution":{"observed_at":"2026-08-07T05:51:31.565117Z","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-07T05:51:31.602810Z","title":"Sherrington, S","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.602810Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:1cd56202cb73e2f124e179a2bc2b790c91d85e9a02c5bd62bd8f11825371199c","observation_id":"6badbebc-56a1-4712-88e7-e6fbde2f83f9","resolution":{"observed_at":"2026-08-07T05:51:31.602810Z","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-07T05:51:31.607906Z","title":"Boccaletti, V","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.607906Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:aee39f57492d0cb4485d129740593333a1f115f1bd633f3f3d9f97a378a939a8","observation_id":"777ca0b4-9cd0-4e8d-b340-5adb8cb5278d","resolution":{"observed_at":"2026-08-07T05:51:31.607906Z","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-07T05:51:31.612688Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.612688Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:c18c4fdf5b73591538722d4fe536b23cf45248a3af28f9690ae26b60b0ba2429","observation_id":"14d40a88-239d-4c5d-9de6-f476657ec99e","resolution":{"observed_at":"2026-08-07T05:51:31.612688Z","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-07T05:51:33.483959Z","title":null,"venue":null,"work_id":"947b05bc-1300-45c4-ae70-7f8f100c2a37","year":1962},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.618702Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ca4aea8c56ea123c6502ffcddd980d6d9d9b5c23be2b82d690fd665608c46556","observation_id":"7ef9f044-8d89-4d0e-b2af-d983529578fa","resolution":{"observed_at":"2026-08-07T05:51:33.490427Z","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-07T05:51:33.458008Z","title":null,"venue":null,"work_id":"011ca0e0-c42c-4374-a752-cdf5986bddd3","year":2009},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.625057Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:cc5d67489750f2a7ef155f249beb20314c33eff86dd91a0e9adc664dfdb52042","observation_id":"2cccff25-110f-4fc2-9f7c-ca78d8130b2b","resolution":{"observed_at":"2026-08-07T05:51:33.466560Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.638071Z","title":"Bertsimas , R","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.638071Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ad9ff6f1e0dc3cd2a2384bed76b9a4f6b66f4990cc42b766d6167a36da7a845f","observation_id":"726b8f03-8d1c-4127-8084-2d4638bbf017","resolution":{"observed_at":"2026-08-07T05:51:31.638071Z","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.1287/ijoc.12.1.57.11901","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.848159Z","title":null,"venue":null,"work_id":"2cc72413-3618-46f2-af2f-e38c9660dfac","year":2000},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.643752Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:8e44d6663ae67352c4e6b3c294bc2bf7ce395f10ce087facf6f7e249656cd6c4","observation_id":"23725bb5-0059-449e-a20c-8d4d9c6479b0","resolution":{"observed_at":"2026-08-07T05:51:31.856376Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1287/ijoc.13.1.56.9748","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.823416Z","title":"Balas, N","venue":null,"work_id":"be22fc9b-5a37-411a-88a8-9d985ad2d264","year":2001},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.648911Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:ea7a2cf236041132cc76db0b5585f012be1bb335c3323524f944d3dcb68bc58c","observation_id":"16c75b9d-b8b7-4c1a-9d98-07826a7aa786","resolution":{"observed_at":"2026-08-07T05:51:31.830244Z","resolver_source":"doi","status":"verified_exact"},"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":"2013.0060","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.767491Z","title":null,"venue":null,"work_id":"192c5585-d9e3-4c4d-b93f-be15cff62963","year":2013},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.653609Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:782c2206457c76048ce718ffbb34afc82be6e10e7af90e61fd7015685679b85e","observation_id":"8d41ffe9-49f9-46b5-81cb-84918a4bf763","resolution":{"observed_at":"2026-08-07T05:51:32.779247Z","resolver_source":"raw_fallback","status":"verified_exact"},"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":"10.1023/a:1009642405419","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.802787Z","title":null,"venue":null,"work_id":"1016d970-5dd7-4399-8dfe-58d097e164db","year":1998},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.659116Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:c0955a34d405fe5b68233c60ea1e43438974bc67b12fb9eac899a64e5319f380","observation_id":"119657dc-47b5-4d38-a0e2-f5ecee25ef83","resolution":{"observed_at":"2026-08-07T05:51:31.808611Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1103/physrevb.59.3617","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.781010Z","title":null,"venue":null,"work_id":"d4b7d8cd-21fc-4fa1-b1b2-436a4c004e0f","year":1999},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.665549Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:3cbe3e632abf2181930af85f510d32089019466bb4a26c22e751b0a34110385c","observation_id":"8cfaf676-9302-4d2a-96a1-2756d2f97f77","resolution":{"observed_at":"2026-08-07T05:51:31.787815Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.ejor.2004.09.057","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:31.754067Z","title":null,"venue":null,"work_id":"f971aefd-b1b1-4ed4-bd38-fceb87805f02","year":2006},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.671610Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:8013f9b8c8ed80a9fc322c72f82983d2908c10d82d079769136b236b31b99857","observation_id":"0797d8f7-09f2-4d55-8a98-5a55bf63af75","resolution":{"observed_at":"2026-08-07T05:51:31.764605Z","resolver_source":"doi","status":"verified_exact"},"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-07T05:51:31.678108Z","title":"Larranaga, C","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.678108Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:e88582278e928ccc96cdc084875e95febbbfad21598b38787781c4fb73575832","observation_id":"f3a5067e-e4b7-4870-8e08-7b376c819a38","resolution":{"observed_at":"2026-08-07T05:51:31.678108Z","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.1287/opre.5.2.266","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.018026Z","title":null,"venue":null,"work_id":"b5358210-e466-411d-a8c4-f01ae391a111","year":null},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":306,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.301926Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:38ad806d8b3dd6fe4ae2cd759eda0b4cadd0a689b70758dd30fcd1499a7c98bd","observation_id":"95235410-0577-40d8-85c5-d6892a2263df","resolution":{"observed_at":"2026-08-07T05:51:32.024489Z","resolver_source":"doi","status":"verified_exact"},"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":"2008.0163","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:51:32.887207Z","title":null,"venue":null,"work_id":"c49177b3-f7d0-497b-b157-3c6a49faba04","year":2008},"citing_paper":{"arxiv_id":"2506.12080","last_updated":"2025-06-08T00:40:50Z","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems","version":1},"reference_index":743,"source":"pdf_text","source_observed_at":"2026-08-07T05:51:31.632215Z"},"links":{"citing_paper":"/paper/2506.12080"},"observation_digest":"sha256:81616b1590810aae7808ab0b3bac971e963253bed968229746d6d6740991a2c7","observation_id":"56c022e9-a663-47fd-9855-1a6099099783","resolution":{"observed_at":"2026-08-07T05:51:32.900435Z","resolver_source":"raw_fallback","status":"verified_exact"},"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.12080","last_updated":"2025-06-08T00:40:50Z","latest_version":1,"primary_category":"physics.gen-ph","snapshot_observed_at":"2026-08-07T05:43:08.526672Z","submitted_at":"2025-06-08T00:40:50Z","title":"Lower bound of computational complexity of knapsack problems"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":24,"verified_exact":27,"verified_fuzzy":4},"total_outbound_references":59},"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 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2506.12080."}