Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T05:51:31.678108Z
Paper Citation Record · LEDGER
Lower bound of computational complexity of knapsack problems
As of 19 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2506.12080.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
59 of 59 outbound references displayed
- verified exact27
- verified fuzzy4
- unresolved24
- parse uncertain0
- malformed identifier2
- metadata mismatch2
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 2f7b6444-1ad9-478e-af5b-a786caad829c · outbound
This paper cites Huang, Statistical mechanics, New York: Wiley, 2008.
Lower bound of computational complexity of knapsack problems Huang, Statistical mechanics, New York: Wiley, 2008
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:51:33.714373Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation cb5397f2-f983-4d44-9cd2-0686dffe5b15 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 2
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-07T05:51:30.945927Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3f9abfa8-897f-4788-ba99-6628bcc63151 · outbound
This paper cites Barahona, On the computational complexity of Ising spin glass models, J.
Lower bound of computational complexity of knapsack problems Barahona, On the computational complexity of Ising spin glass models, J
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:30.952713Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 85f4531a-2a9f-4374-8d63-8747faa66e55 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:30.960590Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 713bbd9d-4f70-45ce-9583-b7e178bb0876 · outbound
This paper cites Istrail , Statistical mechanics, three -dimensionality and NP -completeness: I.
Lower bound of computational complexity of knapsack problems Istrail , Statistical mechanics, three -dimensionality and NP -completeness: I
Reference 5
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:51:33.437267Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8ebc215e-61bc-4bb8-92a8-68fc290da7d7 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.683083Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 1b318685-3644-4ddd-b9fc-ab918cc01e8f · outbound
This paper cites Ising, Beitrag zur theorie des ferromagnetismus, Z.
Lower bound of computational complexity of knapsack problems Ising, Beitrag zur theorie des ferromagnetismus, Z
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:30.991423Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 55132d88-0675-42db-98b5-719aa6229ffb · outbound
This paper cites Onsager, Crystal statistics I: a two -dimensional model with an order -disorder transition, Phys.
Lower bound of computational complexity of knapsack problems Onsager, Crystal statistics I: a two -dimensional model with an order -disorder transition, Phys
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.003478Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0ded23e1-9d31-42c1-90de-39230822202b · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.013382Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7145c306-a900-44a7-a925-823fedd94a64 · outbound
This paper cites Garey, D.
Lower bound of computational complexity of knapsack problems Garey, D
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:51:33.658799Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 4dddc203-6455-4ea3-9438-96a3a583f274 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 11
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.633573Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation a0c91697-4430-4e2d-803e-0401a07c2463 · outbound
This paper cites Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , 1971, 151 –158.
Lower bound of computational complexity of knapsack problems Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , 1971, 151 –158
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.032091Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 253d7a27-adf7-463f-ad0b-732f1e7a2de1 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 13
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.604261Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation f3de960e-dd5b-4f35-8aae-0b8bdae1dd6f · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 14
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.548266Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 4c1e1f24-4d5b-4787-9f1a-dce99f255dce · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 15
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.524379Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 3d367796-e3cd-4fae-8a5a-c9277567d0a7 · outbound
This paper cites Dantzig, Numbers: the language of science, London: George Allen & Unwin, Ltd., 1930.
Lower bound of computational complexity of knapsack problems Dantzig, Numbers: the language of science, London: George Allen & Unwin, Ltd., 1930
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:51:33.575063Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation f22aeb39-8355-4f5e-9562-541d6316d0be · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 17
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.503073Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation e1e9041d-bcf4-4234-844a-ca1216e9a850 · outbound
This paper cites Mar tello, D.
Lower bound of computational complexity of knapsack problems Mar tello, D
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.465948Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 9bba41b9-bd0f-4ab9-a42f-230a26afcae4 · outbound
This paper cites Pisinger, Where are the hard knapsack problems? Comput.
Lower bound of computational complexity of knapsack problems Pisinger, Where are the hard knapsack problems? Comput
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.080773Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 800f1586-b8f9-4803-ae5b-0365ba7052bd · outbound
This paper cites Fayard, G.
Lower bound of computational complexity of knapsack problems Fayard, G
Reference 20
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.426160Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation afca7d5f-1cd7-4428-a10c-3d387c2c0ee6 · outbound
This paper cites Al -Shihabi, A novel core -based optimization framework for binary integer programs- the multidemand multidimesional knapsack problem as a test problem, Oper.
Lower bound of computational complexity of knapsack problems Al -Shihabi, A novel core -based optimization framework for binary integer programs- the multidemand multidimesional knapsack problem as a test problem, Oper
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.105588Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4a70dae9-b111-4d4c-92c6-24bf15ac41b8 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.401167Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 42f5af2b-c5db-4f0a-9aaa-02af878ecd01 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 24
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.118656Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 60291dfd-a8d6-4991-958b-b6622c2c0bc5 · outbound
This paper cites Toth, Optimization enginee ring techniques for the exact solution of NP -hard combinatorial optimization problems, Eur.
Lower bound of computational complexity of knapsack problems Toth, Optimization enginee ring techniques for the exact solution of NP -hard combinatorial optimization problems, Eur
Reference 25
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.358102Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 3c22afc1-99f6-4842-8930-3b0c425ea35f · outbound
This paper cites Venkataraman, G.
Lower bound of computational complexity of knapsack problems Venkataraman, G
Reference 26
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.339505Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 42436a86-a564-4283-9bbd-928b22f75e79 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 27
- Resolution
- malformed identifier
- doi_truncated, observed 2026-08-07T05:51:32.319835Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 7254e908-550a-4859-a374-7ba4e5dded67 · outbound
This paper cites Suzuki, Z.
Lower bound of computational complexity of knapsack problems Suzuki, Z
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.301311Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 050d3acb-67f2-4778-97c8-375209b0b20e · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 29
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.281634Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 6c3e3f26-fde8-40d7-99c1-b263fdbc22ef · outbound
This paper cites Ghosh, C.
Lower bound of computational complexity of knapsack problems Ghosh, C
Reference 30
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.257442Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation ace4666f-671c-41aa-be98-8459bf04d697 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 31
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.227172Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 4a3c2b3f-37b5-44ee-82bc-f3641a8b49af · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 32
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.195140Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation d5fac23d-d3b0-40ae-9d6a-223c2f59f1ed · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 33
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.167585Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation e2ced49d-6858-44a8-915b-2a94505898a0 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 34
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.140098Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation a6263670-0c89-47de-8015-fd32bb28f032 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 35
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.115286Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8fbd07bb-bc0a-4535-b9a4-66efb2b431b6 · outbound
This paper cites Ladner, On the structure of polynomial time r educibility, J.
Lower bound of computational complexity of knapsack problems Ladner, On the structure of polynomial time r educibility, J
Reference 36
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-07T05:51:33.203941Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 4afa2839-ff7e-4d06-9b2a-571d1404587d · outbound
This paper cites Jonsson, V.
Lower bound of computational complexity of knapsack problems Jonsson, V
Reference 37
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.085129Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 7150838b-fdfe-4773-9595-29cc6c1a7b68 · outbound
This paper cites Bellman, A Markovian decision process, J.
Lower bound of computational complexity of knapsack problems Bellman, A Markovian decision process, J
Reference 38
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.258265Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 9b8ebbf6-cc0f-489b-9009-07d1a3a94618 · outbound
This paper cites Kyriienko, H.
Lower bound of computational complexity of knapsack problems Kyriienko, H
Reference 39
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.048964Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 12d00436-440b-4f1f-81c7-ae8b5446db8c · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 40
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.550467Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation fc5cb31b-cede-4cb9-9d02-942aea44d5f6 · outbound
This paper cites Bellman, Letter to the Editor–Comment on Dantzig’s paper on discrete-variable extremum problems, Oper.
Lower bound of computational complexity of knapsack problems Bellman, Letter to the Editor–Comment on Dantzig’s paper on discrete-variable extremum problems, Oper
Reference 41
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.999597Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 9741ba24-b4c1-402b-914f-2674cc1c2dc2 · outbound
This paper cites Cacchiani, M.
Lower bound of computational complexity of knapsack problems Cacchiani, M
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.351647Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c919d3bb-756f-4748-a120-39aa83e82e5b · outbound
This paper cites Kellerer, U.
Lower bound of computational complexity of knapsack problems Kellerer, U
Reference 44
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.368647Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3fad99de-fbf5-4e9b-8030-ff371e157cda · outbound
This paper cites Nishimori, Statistical physics of spin glasses and information processing: an introduction, Oxford University Press, 2001.
Lower bound of computational complexity of knapsack problems Nishimori, Statistical physics of spin glasses and information processing: an introduction, Oxford University Press, 2001
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T05:51:33.518976Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 851a3394-3147-414a-889e-0933405599ff · outbound
This paper cites Kirkpatrick, D.
Lower bound of computational complexity of knapsack problems Kirkpatrick, D
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.565117Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6badbebc-56a1-4712-88e7-e6fbde2f83f9 · outbound
This paper cites Sherrington, S.
Lower bound of computational complexity of knapsack problems Sherrington, S
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.602810Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 777ca0b4-9cd0-4e8d-b340-5adb8cb5278d · outbound
This paper cites Boccaletti, V.
Lower bound of computational complexity of knapsack problems Boccaletti, V
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.607906Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 14d40a88-239d-4c5d-9de6-f476657ec99e · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.612688Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 7ef9f044-8d89-4d0e-b2af-d983529578fa · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 50
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.490427Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 2cccff25-110f-4fc2-9f7c-ca78d8130b2b · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 51
- Resolution
- unresolved
- raw_fallback, observed 2026-08-07T05:51:33.466560Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 726b8f03-8d1c-4127-8084-2d4638bbf017 · outbound
This paper cites Bertsimas , R.
Lower bound of computational complexity of knapsack problems Bertsimas , R
Reference 52
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.638071Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 23725bb5-0059-449e-a20c-8d4d9c6479b0 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 53
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.856376Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 16c75b9d-b8b7-4c1a-9d98-07826a7aa786 · outbound
This paper cites Balas, N.
Lower bound of computational complexity of knapsack problems Balas, N
Reference 54
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.830244Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8d41ffe9-49f9-46b5-81cb-84918a4bf763 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 55
- Resolution
- verified exact
- raw_fallback, observed 2026-08-07T05:51:32.779247Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 119657dc-47b5-4d38-a0e2-f5ecee25ef83 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 56
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.808611Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 8cfaf676-9302-4d2a-96a1-2756d2f97f77 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 57
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.787815Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 0797d8f7-09f2-4d55-8a98-5a55bf63af75 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 58
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:31.764605Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation f3a5067e-e4b7-4870-8e08-7b376c819a38 · outbound
This paper cites Larranaga, C.
Lower bound of computational complexity of knapsack problems Larranaga, C
Reference 59
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T05:51:31.678108Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 95235410-0577-40d8-85c5-d6892a2263df · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 306
- Resolution
- verified exact
- doi, observed 2026-08-07T05:51:32.024489Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Observation 56c022e9-a663-47fd-9855-1a6099099783 · outbound
This paper cites an unresolved cited work.
Lower bound of computational complexity of knapsack problems Unresolved cited work
Reference 743
- Resolution
- verified exact
- raw_fallback, observed 2026-08-07T05:51:32.900435Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.
Pith citing papers
No inbound Pith citation observations are available.