{"as_of":"2026-08-15T17:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f30f19cdaead3344203f71edf01f136be426116eb5b11376483d6fea4f140dce","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T11:47:34.480411Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2509.02409/citation-record","integrity":"/paper/2509.02409/integrity","json":"/paper/2509.02409/citation-record.json","paper":"/paper/2509.02409"},"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-05T11:47:34.758829Z","title":"Cocchi, M","venue":null,"work_id":"44f045bf-83f1-4586-8d4b-0576093c8f04","year":2021},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.404714Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:a651688b92c7e8451dfcb24b15e7c5d5101db6f6973381d729d99e95670e2b03","observation_id":"5e90c244-ee02-4c8f-b2ed-ee8775c85be0","resolution":{"observed_at":"2026-08-05T11:47:34.761952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.748917Z","title":"Cocchi, G","venue":null,"work_id":"803fe4fc-4cec-40fc-966f-24013ba3a820","year":2020},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.408434Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:1922f4ef77eeb969d784630667c2e6aa887dd096a6da408039893c5b00653041","observation_id":"d4cd729b-f97f-43ac-8bc2-572820cc7ae7","resolution":{"observed_at":"2026-08-05T11:47:34.751994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.737667Z","title":null,"venue":null,"work_id":"5458ed49-40d0-4f97-a231-1c1235b0d3b5","year":2011},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.411993Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:ed9002455682924190fe77b0e43a23c6541d9e4b5519ca8ad0dd48ba50d3ecfb","observation_id":"846e4f58-c192-4e40-9586-6ac663c9516a","resolution":{"observed_at":"2026-08-05T11:47:34.741018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.415338Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.415338Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:960fcd659ef8bd2137a98faf50efc82cf5c2c2dbbb922878d0fdd609c499a4aa","observation_id":"f54ece76-a94f-4b7c-95fc-9bcf158b609f","resolution":{"observed_at":"2026-08-05T11:47:34.415338Z","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-05T11:47:34.720303Z","title":null,"venue":null,"work_id":"e41c0ee2-1136-40ea-9d41-4ee6f4142f3c","year":2002},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.418512Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:1a30d4d649729c02ceabe716612d0db2b03878dfc06843f471183bc6a20a67cc","observation_id":"34003279-b0b5-47ab-879c-0232e2fce3a0","resolution":{"observed_at":"2026-08-05T11:47:34.723173Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.710265Z","title":null,"venue":null,"work_id":"4ea2fc3a-2446-42d5-bf63-fe9f1cb92b07","year":2004},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.422206Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:d7a1539e3fafde5da2d0481b0e694bd8c47d766dc1ee7dcb8f8a72d6b030be4a","observation_id":"5d2d2a2a-721f-45aa-bd32-aeec4e2002e7","resolution":{"observed_at":"2026-08-05T11:47:34.713581Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.699830Z","title":"Eichfelder","venue":null,"work_id":"d4797f9b-c1dc-414e-a52b-83aa3b24d99c","year":2009},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.425438Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:43024bb789cb98fe9cfdffb16755c5b544a1c3ca504feb6f4271145ec183fb31","observation_id":"295b8662-61b4-40df-a3c7-cbf666f63d76","resolution":{"observed_at":"2026-08-05T11:47:34.703387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.689410Z","title":"Eichfelder","venue":null,"work_id":"7b3b272e-70f2-4382-b212-374aa6f9acf8","year":2021},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.428373Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:2f5d6aa761312d9fac79721d781b3ff821a8e29749a54cc6af79a2c742e6f4ed","observation_id":"c80f1ff0-1154-4a23-8195-553ba86d23dc","resolution":{"observed_at":"2026-08-05T11:47:34.692569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.679608Z","title":null,"venue":null,"work_id":"4a2da63b-33d5-42fe-89a6-f4952ef03b75","year":2019},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.431376Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:8187a24a7e2eed961f1a0341c6b036796b6b85c5ecacba9ad96f762d30ae65aa","observation_id":"47ac4af7-9034-486d-8b66-036b5618d5d7","resolution":{"observed_at":"2026-08-05T11:47:34.682659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.669633Z","title":"Fliege, L","venue":null,"work_id":"123487a8-39fb-4640-825f-f6e1f0b9b7b1","year":2009},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.434229Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:0abf3a4fa73a498c3444e1103532acb7ff0295af5263a86c22f2ae9cbd654886","observation_id":"5c25c2c3-fe69-4f47-b06f-4b3c56816f8c","resolution":{"observed_at":"2026-08-05T11:47:34.672683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.659062Z","title":"Fliege and B","venue":null,"work_id":"2c36131a-b53e-48c3-b2ce-d1d8259ded6b","year":2000},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.436980Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:3a53b50f7d065a3c9e2c99f109e279ff9445f0170be2e6efe088e718434082b9","observation_id":"a5b531a7-3915-40f8-9c65-52de00364d26","resolution":{"observed_at":"2026-08-05T11:47:34.662363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.648785Z","title":"Grippo, F","venue":null,"work_id":"311111c4-ec86-4067-b50f-79e54456e73c","year":1986},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.439657Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:f90b84a48219ae7c65ea336a67defe4166c0f8be72d2a58a496d0c09c6135447","observation_id":"5ad6d21d-5574-401c-8f3b-44b352ac2d7b","resolution":{"observed_at":"2026-08-05T11:47:34.652178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.442298Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.442298Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:bc3fa5df2e770604458b0f50b4561645f86e10bc299c99d2306144fdb1c4d461","observation_id":"4ffbe51e-cc88-49ad-a1af-4ae8c4da34c0","resolution":{"observed_at":"2026-08-05T11:47:34.442298Z","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-05T11:47:34.629790Z","title":null,"venue":null,"work_id":"c74892a6-5d1c-47dd-a83a-3fbd32b73984","year":2001},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.445306Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:613e432d7e5ee73d5c6c39ace62fa536312d4f045164ae26a236acda4f9dd1f8","observation_id":"ca1738fb-7fef-421b-8bfb-c7c08d612e05","resolution":{"observed_at":"2026-08-05T11:47:34.632879Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.619883Z","title":"Lapucci and P","venue":null,"work_id":"0bced807-b641-4b94-a087-0f1a6dff09fa","year":2023},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.448011Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:64618ee455b36e77b340fd54a63bde12bddf1fcf5e7158a6021a762c00743ac1","observation_id":"e9259298-eab2-489a-9796-baf12b8277ca","resolution":{"observed_at":"2026-08-05T11:47:34.622840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.609989Z","title":"Lapucci and P","venue":null,"work_id":"aaf70040-39e2-4c83-9cf1-e6d14c5134b1","year":2023},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.450764Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:202ff7a472e272da887328db4d1390649f29e877b2ec7e6df452bad836a237b8","observation_id":"281f8de1-4c3e-4a43-afab-5f5832505e4c","resolution":{"observed_at":"2026-08-05T11:47:34.612907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.600572Z","title":"Lapucci, P","venue":null,"work_id":"589e84cf-3d75-4c12-ab8c-eeaaa3180be4","year":2025},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.453325Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:d6971ccfd4e69ec69f9e60658db4c256fe821c03e2e1a1aa6e3a621a79948b20","observation_id":"53c2cdf9-7f85-42ff-aba7-683429de7f65","resolution":{"observed_at":"2026-08-05T11:47:34.603413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.590890Z","title":"Lapucci, P","venue":null,"work_id":"19055eef-07d7-4a37-80a3-f54240d66596","year":2022},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.456395Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:9059fe4fa485071182faf5e0978690ecad88946834bd847dbd73c240fa40db93","observation_id":"6b7d2ebe-44b7-450e-92b0-0a660a2b3f5f","resolution":{"observed_at":"2026-08-05T11:47:34.593855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.580641Z","title":null,"venue":null,"work_id":"06fb824f-80dd-4ae3-99dc-d70029e7b6c2","year":2019},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.459223Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:b2de63f3d5e89ef084755c047dcc8db5ff568e7b1318dce8906ac2a54a4c495e","observation_id":"2f651bda-32ba-41f5-8097-fca2b5692c79","resolution":{"observed_at":"2026-08-05T11:47:34.583757Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.570292Z","title":"Pascoletti and P","venue":null,"work_id":"a29d1c0d-148d-4a56-a805-c6e55e7ee952","year":1984},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.461680Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:e75301c74e57a18aef0821aff3459bb7818e034537880abda7d653bf1aba881a","observation_id":"0cefe926-a05f-4548-ab3b-560f033bc5b9","resolution":{"observed_at":"2026-08-05T11:47:34.573332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.559462Z","title":null,"venue":null,"work_id":"69df586d-346e-4ef8-97cf-f9202c434b81","year":2024},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.464470Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:b3be2a88d5a592513a4a8cb46fc127a6aa8f5ec1fefff3ce43e8ff2dc92c8821","observation_id":"ec2779c6-ac2d-4a69-8e85-0c638b82b244","resolution":{"observed_at":"2026-08-05T11:47:34.562736Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.549131Z","title":null,"venue":null,"work_id":"51b32ee9-d32a-44d2-841f-3cce5695c14d","year":2017},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.467372Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:5f129fc23cb8f285ddfd905efff77b455802bbf90a04930fc99067aceca144e1","observation_id":"02a0da32-5794-4a27-9a3d-43b47f2452ca","resolution":{"observed_at":"2026-08-05T11:47:34.552022Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.539452Z","title":"Zhang and W","venue":null,"work_id":"97a61a2f-7e2b-46b2-b7fd-b6876d52f371","year":2004},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.470429Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:2c0522f2ded7427bf99352382edd310746b36ca6eb01f529381f626f2d3de47c","observation_id":"434ddc7e-6fb4-4c4d-bf4c-ebad829d64d3","resolution":{"observed_at":"2026-08-05T11:47:34.542397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.528978Z","title":"Zhang, A","venue":null,"work_id":"adc4c07b-23b9-4150-a138-f6ced4b647c4","year":2009},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.473795Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:85a40db3e60f863e15d2fbe94166b6383cb1db1b1cc50a4cb52a5ea7f1866acc","observation_id":"5eea372c-3c5c-4dab-a4f9-d3185eb75478","resolution":{"observed_at":"2026-08-05T11:47:34.532158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.518479Z","title":"Zitzler, K","venue":null,"work_id":"f47e3b47-4377-4d12-81a7-6ab4764be6fc","year":2000},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.477438Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:58d530bc7771eb3788ae1851680bee23e16e17ce8f4146861a71d4cfea3fd5f8","observation_id":"413f6920-a508-4002-a38c-c2add86f12a0","resolution":{"observed_at":"2026-08-05T11:47:34.521586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-05T11:47:34.506070Z","title":"Zitzler and L","venue":null,"work_id":"89d31f31-f459-4823-8268-312cdc5915be","year":1998},"citing_paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T11:47:34.480411Z"},"links":{"citing_paper":"/paper/2509.02409"},"observation_digest":"sha256:0e80f7e2e18e18f36a66951e64d744cac271b97fce85cc8ed498136c4c4c4ccd","observation_id":"b2cd8576-bb27-41aa-a7b6-5a4da9730851","resolution":{"observed_at":"2026-08-05T11:47:34.510670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.02409","last_updated":"2025-09-02T15:19:10Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T10:48:38.145020Z","submitted_at":"2025-09-02T15:19:10Z","title":"A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":26},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2509.02409."}