{"as_of":"2026-08-23T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2b2e50a654ad966e790ae50be27412ac4b6fc23f55ddaca8171b13b08c08c92f","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T01:56:40.792940Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+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/2607.05164/citation-record","integrity":"/paper/2607.05164/integrity","json":"/paper/2607.05164/citation-record.json","paper":"/paper/2607.05164"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T02:04:26.964849Z","title":"International Conference on Integer Programming and Combinatorial Optimization , pages=","venue":null,"work_id":"ad5359cd-5e8a-455c-b9a4-c23e65d51caa","year":2010},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:52ce6cc3fe39b916b93afef5a377fe2025da1a5d1785dc4eebe583ec135dbb0d","observation_id":"7e64af29-10c1-41d2-b11c-8cb5906d7101","resolution":{"observed_at":"2026-07-08T02:04:26.966100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.961141Z","title":"Birge and Varun Gupta , title =","venue":null,"work_id":"5f16f507-9ade-4157-8d9a-ad8269ec32db","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:15b3ff3b94216246b8f1deaddce20d31d82d3d99576856a3a2fec29f6f82652d","observation_id":"bd5e674b-dfd4-481d-b8de-de74c75c4dfe","resolution":{"observed_at":"2026-07-08T02:04:26.962266Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.963025Z","title":"Handbook of Approximation Algorithms and Metaheuristics , pages=","venue":null,"work_id":"20269c76-ae41-4ab5-bd4f-d730125d0f99","year":2018},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:e48ea4cc4ba499cb0f3dee7892e0d94fe7fd446fa63a37e81f49e2b9e9f72941","observation_id":"9e99febb-60fa-41ac-b5b6-c0bd71ca4c09","resolution":{"observed_at":"2026-07-08T02:04:26.964268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.959109Z","title":"Operations Research Forum , volume=","venue":null,"work_id":"d89b45f5-fad8-4fbd-81cb-db7e5396f656","year":2022},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:603d634dbfee12f520297df29f87bcbb2af4342bfb453a98c8c8910095797bf1","observation_id":"4f2e9881-f965-460d-86ff-fa2cd5ed2462","resolution":{"observed_at":"2026-07-08T02:04:26.960536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.947677Z","title":"Improved algorithms for orienteering and related problems , year =","venue":null,"work_id":"f3198fb4-c1a7-45ca-96f7-fb2a5a85f09d","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:9381ebfadf1f25b1c4eb0c959b3671a02724aa50a0093aec6a88b5df042769b7","observation_id":"b7f01a96-75c7-4023-b93e-60f8d55468d0","resolution":{"observed_at":"2026-07-08T02:04:26.948821Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.931957Z","title":"SIAM Journal on Computing , volume =","venue":null,"work_id":"d7a43b41-8e19-4c83-874e-e4f35995515a","year":2008},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:a30b7e199f3abdb995ee44416072b20e7f77cf245aebd5c90f4a11dd2661e4e0","observation_id":"a75170bc-df63-4dbb-8cc0-781c40c4110f","resolution":{"observed_at":"2026-07-08T02:04:26.933332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1043.2020","doi":"10.1109/infocom41043.2020","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"mmTrack: Passive Multi -Person Localization Using Commodity Millimeter Wave Radio","venue":null,"work_id":"aa0a571c-1088-4a93-a1d0-b591ae52ac9c","year":2020},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:5122937a1438d6098384b235e57e9919ca86408766be9ce1c47a02bf28e3862f","observation_id":"61acf664-fb51-463b-8a3a-f5a6ee0a73e5","resolution":{"observed_at":"2026-07-08T02:04:25.972394Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.936852Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":"68ea22fb-f13e-490f-b09d-8cee34079269","year":2015},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:161e78010715d3a5f71de210d4e2b8e4ca2cc5e9ec328f2bb7abc4ca7d41592a","observation_id":"998e5e5e-4e6d-424c-bb0c-28dada34eda3","resolution":{"observed_at":"2026-07-08T02:04:26.938016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.943869Z","title":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":"02565616-24ff-40d9-a45e-ceea8b339736","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:529b8a5b23530f6831482a5242126ad0efbafd0efab59e5b04b2c72dfd673f65","observation_id":"03af9a64-718d-4a70-9897-3269dfd92aa8","resolution":{"observed_at":"2026-07-08T02:04:26.945304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.953205Z","title":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003","venue":null,"work_id":"b014d4db-4729-4e72-b438-872d66b8ca44","year":2003},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:ba347145f0af243a8bcafc128f8408b794db6c1ec7fb29276c8e754b6b4e08b7","observation_id":"14af38ad-99ad-47f8-bc99-22f840e9f8e7","resolution":{"observed_at":"2026-07-08T02:04:26.954429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.942227Z","title":"A 2+ approximation algorithm for the k-","venue":null,"work_id":"a3fc63f2-0700-4379-9014-05f45f9ecc43","year":2006},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:aa42adf5109ae38f66e7187e7adb4bd2ceeb3b85ee9c8cd57a6d79b9b6d236e5","observation_id":"ce47030d-b7b2-46af-beb5-2b4be012d849","resolution":{"observed_at":"2026-07-08T02:04:26.943278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.951514Z","title":"International Conference on Evolutionary Multi-Criterion Optimization , pages=","venue":null,"work_id":"07d7e98c-7b51-4c10-a39f-fb2e06cd0460","year":2017},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:4a76aa63780d4afc2bef828cf34260510aa6fa62f83a86dbc2f77475dd286bbc","observation_id":"2ac81bbb-0d71-4a0e-9e39-01509d0a47bd","resolution":{"observed_at":"2026-07-08T02:04:26.952666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.930731Z","title":"2022 , doi =","venue":null,"work_id":"2ab82f82-8342-45bd-aef6-0471ee6d902e","year":2022},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:a5c71163b911f41b93fac42f327f54e8d12f217cc8c0caa86a0b1cb8a03391e2","observation_id":"547c9925-ece8-4b9c-85cb-fd0467a4257c","resolution":{"observed_at":"2026-07-08T02:04:26.931773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9480.275471","doi":"10.1145/2739480.2754716","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/2739480.2754716","venue":null,"work_id":"c934e1de-246d-4589-bf78-cc277db04bf0","year":2015},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:3361fbc422b0dd10eab79669104444579e762f19d049ce8a64b14c1262361270","observation_id":"bb7055b5-f13e-4775-9fc8-7bcefb2e5f73","resolution":{"observed_at":"2026-07-08T02:04:25.978891Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:50:31.915179+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:50:31.915179+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6768.259824","doi":"10.1145/2576768.2598249","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1145/2576768.2598249","venue":null,"work_id":"8b609b9d-93d1-4d88-8214-8ba04f4d65c5","year":2014},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:18d02df060c4db84cd6f3d842706b0232bef857fbf44803e59cb75c76b2d609d","observation_id":"05cd175e-1cda-4dc3-8c77-48f9c3958d68","resolution":{"observed_at":"2026-07-08T02:04:25.976143Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:50:32.164416+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:50:32.164416+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.930301Z","title":"Przybylek and Adam Wierzbicki and Zbigniew Michalewicz , title =","venue":null,"work_id":"1e879e17-849b-458b-b583-74985b495c1b","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:2470370d6554d096ce6a5260986716bf3ea33596c5d8e9756ad7d4f77b68b52c","observation_id":"a946d6e0-e000-4e9a-8d78-4350d1d5e306","resolution":{"observed_at":"2026-07-08T02:04:26.931381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.918173Z","title":null,"venue":null,"work_id":"27d09483-1492-4d1c-8d55-ecae0aec5a96","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:8317d8e2be307ca730ac6257b369968e9cbd4eeb10ff80c3f03388359d3a663a","observation_id":"7ec1557d-b555-4902-85a7-313b3bbe418f","resolution":{"observed_at":"2026-07-08T02:04:26.919370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.933685Z","title":"Swarm Evol","venue":null,"work_id":"fa4ecd88-3645-456c-b3ce-2fea30b9c1f7","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:d2ec66f699d8626f0046ba67841207a092e97a22bef61cdfd52c6a79d42a3fcf","observation_id":"0e38b38e-6a67-418f-8c4c-e4579c868e0e","resolution":{"observed_at":"2026-07-08T02:04:26.935596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.941488Z","title":"Papadimitriou and Mihalis Yannakakis , title =","venue":null,"work_id":"a1bb4920-4ea9-472c-a047-9467e5a11d30","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:1a556cc4347ee91b0e27efa4cce46c05faf6042e24f274bec2a80b0fe7d8157b","observation_id":"13f17d00-ab6c-4f0e-9309-feb57f37b041","resolution":{"observed_at":"2026-07-08T02:04:26.942967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.923775Z","title":"Pulleyblank and Prabhakar Raghavan and Madhu Sudan , title =","venue":null,"work_id":"698cc89a-efbb-4695-8521-8c6d44f17c11","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:67dd0bbef58f82ce3ac8fb59fdd658940b86ab77fafd23cfc09d7a3a5cd9b18d","observation_id":"33f60b41-9aab-4077-b944-c77c644aeef1","resolution":{"observed_at":"2026-07-08T02:04:26.924965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.918366Z","title":null,"venue":null,"work_id":"18dbc166-fd93-4b3e-9414-e1d036f84177","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:daaef00bedac4edfe499d4794f6fe3056b2a7603f99d38814c3a95a5f5a1645f","observation_id":"cab8bc8f-d28e-42b9-b9ff-775ba565da01","resolution":{"observed_at":"2026-07-08T02:04:26.919525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.945786Z","title":"Optimization in Industry , pages =","venue":null,"work_id":"ee20fa8a-db75-453d-ba85-9624af9670f3","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:8244f8d39fc0eb4ec0b3c3dda6617c101de284ad4c6f7821573e3e1d2f91f04d","observation_id":"9d0b17fa-1746-4af2-a68b-7860e305a409","resolution":{"observed_at":"2026-07-08T02:04:26.947366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.914789Z","title":null,"venue":null,"work_id":"ce83f2cd-9eb0-4cba-b1b1-dd85f40116c1","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:d09488c70dd3b07e0c52a0fa980fe5fd418ed3d2dcc819767ca746c584611945","observation_id":"d94e34b0-d91d-4f57-b7e9-817cd4b69c51","resolution":{"observed_at":"2026-07-08T02:04:26.915874Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.955104Z","title":null,"venue":null,"work_id":"b9487c54-c210-44bc-bc31-fea759cf999a","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:22f692134b556068408ec696c6fa79d9e86e5c83dfd40fd5738042084251f981","observation_id":"4018d874-945e-45b2-b916-beb8023f5f74","resolution":{"observed_at":"2026-07-08T02:04:26.956551Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.916450Z","title":"Genetic and Evolutionary Computation Conference,","venue":null,"work_id":"9be44461-7e3a-43a4-9f6b-3d0484d9192c","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:2f3059bb47737fd3a0e20cc975c08ac4f7a8be8552a0b8a168eeb17ade6ec0ba","observation_id":"8b96096c-9046-46fa-be3a-16051a545144","resolution":{"observed_at":"2026-07-08T02:04:26.917794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.945990Z","title":null,"venue":null,"work_id":"a0a5137c-4911-48bd-80c2-7fa0a7472c62","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:56fa8946abb22e19eb2d5d00bc52c8237d84e648a6e30a81ff59cf9b27481993","observation_id":"e2d64ea6-1c6d-4507-b60a-5c24439731bd","resolution":{"observed_at":"2026-07-08T02:04:26.947104Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.943582Z","title":"Proceedings of the Genetic and Evolutionary Computation Conference Companion , pages=","venue":null,"work_id":"f98a8c2a-ce81-4e1c-bed9-e6e4ee6daadf","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:444d3f5b4f0c6367fe5a413bf2d2963cb1dc4152fc112916a76e6fa1d2588c52","observation_id":"19280932-4476-4027-8445-fed52b427775","resolution":{"observed_at":"2026-07-08T02:04:26.945096Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.939357Z","title":"Proceedings of the genetic and evolutionary computation conference , pages=","venue":null,"work_id":"235d38a9-2f7a-43ea-b6c4-9e709ccb5b37","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:bf78a635145f8b0eb5fa06aa5fab986b80004c1d71f1e29ac0929097abbb641c","observation_id":"768fba60-031b-4f33-bcc0-135e1255834c","resolution":{"observed_at":"2026-07-08T02:04:26.940857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2013.655768","doi":"10.1109/cec.2013.6557681","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"URLhttps://doi.org/10.1109/CEC.2013.6557681","venue":null,"work_id":"1733b927-e60f-4ef6-a859-541ed09ce1fa","year":2013},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:299265434b0257b29111b38aee7f53f063ae421d63076f1fff5ffb8dc9c33499","observation_id":"8974633a-3cb2-492d-b033-997c82cd374d","resolution":{"observed_at":"2026-07-08T02:04:25.982580Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-07-11T19:50:32.404279+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T19:50:32.404279+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.928439Z","title":"2007 , publisher=","venue":null,"work_id":"4aafe6e7-eaf3-4939-a626-daa081d9461c","year":2007},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:f5ff8a04bb97d4352ad7fecff61952a0795fcc1315dd6e91ec6013b2c8fd3cdc","observation_id":"5778a20b-1dbf-40fa-b40c-b3d65a4362e1","resolution":{"observed_at":"2026-07-08T02:04:26.929535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-09T20:16:29.635499Z","title":null,"venue":null,"work_id":"c37cea56-4a27-4ca4-aeee-10e0025c1577","year":1979},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:d820923a43ba4d8502283c6ba5948eaacd6e9ff483db06cf02a72c2b62a7d979","observation_id":"6946f7b1-f2b5-42a0-9f42-2af4b1bd54e3","resolution":{"observed_at":"2026-07-08T02:04:26.958495Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.949598Z","title":"Ibarra and Chul E","venue":null,"work_id":"740d2e73-cb21-4cee-9ede-61f331a5f954","year":null},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:5d3639d7fea6e4cc009fe7943c0f7678e522b7e6fab62e0792f18dc04931601d","observation_id":"b67799e0-e119-4b47-920e-c69d9773d0d2","resolution":{"observed_at":"2026-07-08T02:04:26.950973Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-07-08T02:04:26.940630Z","title":"2026 , eprint=","venue":null,"work_id":"4de0d3d0-b333-4482-852b-8c9212011147","year":2026},"citing_paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-08T01:56:40.792940Z"},"links":{"citing_paper":"/paper/2607.05164"},"observation_digest":"sha256:ea89fce0474175a87bbd07f3871b2f8bafbeaa29bb08e8a4c652352d42f5f9bb","observation_id":"7e002070-14e9-4670-a049-5aa28e11ee88","resolution":{"observed_at":"2026-07-08T02:04:26.941692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05164","last_updated":"2026-07-06T14:47:30Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-19T17:53:48.313579Z","submitted_at":"2026-07-06T14:47:30Z","title":"Approximation Algorithms for the Traveling Thief Problem"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":33},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.05164."}