{"as_of":"2026-08-18T22:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e4c27ad5e70776f22de3f7ed5386304710119a7ba6feffd657f550fb3707368","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:35:37.243562Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2501.15345/citation-record","integrity":"/paper/2501.15345/integrity","json":"/paper/2501.15345/citation-record.json","paper":"/paper/2501.15345"},"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-10T14:35:37.522245Z","title":"Achterberg, T","venue":null,"work_id":"b7a06c7d-e52e-45a6-9aa0-c441b206c631","year":2005},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.156013Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:7658d7f61674aae1abd1663db7c0ddc7f1a8c8f5d1f483133dc8d5f5bdc51eb4","observation_id":"21beb202-8acf-46a3-a649-2e5a2bbeb66a","resolution":{"observed_at":"2026-08-10T14:35:37.525917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.511972Z","title":null,"venue":null,"work_id":"89608b61-abda-4d86-8576-81fa1cfb682e","year":1979},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.160495Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:4a63e5e355fb72ea123d32dc042ec214ca26a3f2dc3edf276a68983b4f744153","observation_id":"c492d869-a294-444d-a5d7-0c3ba2e96077","resolution":{"observed_at":"2026-08-10T14:35:37.515533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.500230Z","title":null,"venue":null,"work_id":"910c0326-6008-4984-9110-b5a6474025e2","year":1985},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.164045Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:2b68a9e38a40c16bb3d4ae29d00b693876cd831e995a2003aae768bf4be94d27","observation_id":"e07d1ac3-ba39-4135-90e3-1e1203dc7629","resolution":{"observed_at":"2026-08-10T14:35:37.505171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.489292Z","title":null,"venue":null,"work_id":"803bb238-eaff-4aa4-b5e9-1d999621a10f","year":1998},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.167786Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:80bb1f2598054508667350191d6a665d40523a7bb384b96661fad210f9c44b1f","observation_id":"97fb549c-3b01-4141-813e-fdd82f185d06","resolution":{"observed_at":"2026-08-10T14:35:37.493029Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.477169Z","title":null,"venue":null,"work_id":"5a250b1a-4795-4747-9f8b-13fc571eb846","year":2010},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.171796Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:3da7f5fb765b6e2d800c285f05dfb150ce7850b418a9eb198e3a6baa2b8e43a5","observation_id":"7233ec34-488c-4dc8-9660-330b62ee7175","resolution":{"observed_at":"2026-08-10T14:35:37.481047Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.465801Z","title":"Balas, S","venue":null,"work_id":"07b0d7b4-79e8-4745-93ba-2bc3368fb609","year":1993},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.176602Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:d676e6fb3c6b1c383700a38dc32da875fdb94d14b39d9947622bdd64ae00ae22","observation_id":"782077f5-a6fc-4c63-b61b-e79bceb4755c","resolution":{"observed_at":"2026-08-10T14:35:37.469286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.454753Z","title":"Belotti, P","venue":null,"work_id":"efdf1a9e-0f93-4ae4-a2a1-1a68c3405ed2","year":2016},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.180869Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:c0ea843b224b4ba56bc2fe4e11a3e0664605f57817742997146d4e6d77af083c","observation_id":"a1dccb29-25a7-4a1c-961f-1012059b4611","resolution":{"observed_at":"2026-08-10T14:35:37.458494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.443285Z","title":"Ben-Tal and A","venue":null,"work_id":"6db19070-46fa-4771-8023-2fc795a6d789","year":2001},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.184776Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:59e49dd4af2bd3a6235be62eb1494c0334f6947b3907104d1bbad1d2d0b62993","observation_id":"18b6b0dc-9dbe-455b-9738-7612f6fdf215","resolution":{"observed_at":"2026-08-10T14:35:37.447233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.431788Z","title":null,"venue":null,"work_id":"a49e1558-2dc2-44a7-92b8-780dfc17f23c","year":1999},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.188661Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:eb87848086aa05c19846da241e7b0bc96ea02d859454611d33c5baed587cd41c","observation_id":"7a287f63-7cdd-4690-aeb1-b4a23635e430","resolution":{"observed_at":"2026-08-10T14:35:37.435504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.420310Z","title":"Bonami, A","venue":null,"work_id":"8a72da4c-a5ac-4192-bbb5-5d1e5963217d","year":2015},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.192325Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:6c3a2ac3aaf697ad755844bd3f6e9d6dc229730864ee9f4b32338b6c049c3bd4","observation_id":"1926c4e0-a2b7-48fd-b587-9cf07196d371","resolution":{"observed_at":"2026-08-10T14:35:37.424017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.409498Z","title":"Ceria and J","venue":null,"work_id":"3fce9c6a-157e-4247-af93-489ddcf908be","year":1999},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.196095Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:d31927988ab54210da22994ee16751a8e60333e24c0fc4e3753ddf4882126822","observation_id":"6430f439-ce39-48f4-a583-341a634c0919","resolution":{"observed_at":"2026-08-10T14:35:37.413286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.398516Z","title":"Fischetti, A","venue":null,"work_id":"76af1dc9-7782-41d1-86ac-a3e277e5cbc3","year":2009},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.199732Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:8b955fc0e01502e56ec2783f4c44fe5a5c5cab21a3731ade40ede996feee6e13","observation_id":"cf8492fa-7566-4f4d-9933-3a006340801e","resolution":{"observed_at":"2026-08-10T14:35:37.402364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.387851Z","title":null,"venue":null,"work_id":"d8e355fa-5a80-460e-bbe2-36b2271f02aa","year":2013},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.203415Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:f546b3fd3e3cce5d7f2a31287f518a954b326152434cb719c91d77f4154ff4ae","observation_id":"e20d7bae-e09a-4d9f-8a1f-7901b8914d43","resolution":{"observed_at":"2026-08-10T14:35:37.391457Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.377080Z","title":"Guignard","venue":null,"work_id":"d1f85197-4a16-4e33-a6da-3dc1e6d1aa88","year":2003},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.206923Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:919fbac017e4e5bbd21040329727cdde8f6cf3990d49352f637a549119d5ec2b","observation_id":"ece42c7a-e0e2-48ec-9761-bde936b19f87","resolution":{"observed_at":"2026-08-10T14:35:37.380808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.210371Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.210371Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:8bc459c17189fad631d13a60de04332f4914096eebcd3988bf0563b2ebbdfd0c","observation_id":"fd52977c-a8d4-439e-bad4-01f52dd8f533","resolution":{"observed_at":"2026-08-10T14:35:37.210371Z","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-10T14:35:37.359528Z","title":"Perregaard and E","venue":null,"work_id":"e822a343-9bd5-41ff-b9f8-2605fee6b454","year":2001},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.213811Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:1f5a6a0db921c3020a3bc7a83503f4871248cbae5f2788133f38d8737cdd852e","observation_id":"5bb3f196-772d-4d4a-a673-832714c4fe02","resolution":{"observed_at":"2026-08-10T14:35:37.363141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.349363Z","title":"Raman and I","venue":null,"work_id":"9c3f459f-f361-4eac-98b6-ff31a7cc2c6a","year":1994},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.217886Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:2f23a6a812c71c303739793c6d77b5025fd7a8aa075404c895a0490f63ddc11e","observation_id":"67118096-131d-40b3-b407-2e529b9d28fb","resolution":{"observed_at":"2026-08-10T14:35:37.352808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.339123Z","title":null,"venue":null,"work_id":"2c20d49d-7acc-4fa3-9b64-82296dfec104","year":2012},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.221315Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:543c1e236c339159f4f9c7aa861749ea1675cf1e1c6bba8b1e81ebc368921649","observation_id":"0194d096-0635-418b-a8ea-9b663dcd4ac3","resolution":{"observed_at":"2026-08-10T14:35:37.342565Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.327852Z","title":null,"venue":null,"work_id":"80bd0e42-e144-444d-9945-1d478877235b","year":2006},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.225057Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:8f60d6c1ad49ff5ada3093524f4a7af9abd42055da79811f69ebd3d7156eb1d4","observation_id":"8d9ab294-a3bd-4397-881d-623b3a4e46d3","resolution":{"observed_at":"2026-08-10T14:35:37.331574Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.316777Z","title":"Sawaya and I","venue":null,"work_id":"4d239274-6a8a-4e68-a87e-9fe54158a67d","year":2012},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.228711Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:d8c62c1973b76ed9e4f94f66d75af71bbbf8a9a3457ccd3476eb1a7e50e6ba2e","observation_id":"80beb61b-7354-4149-8106-3b045ee1dbfc","resolution":{"observed_at":"2026-08-10T14:35:37.320241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.306403Z","title":null,"venue":null,"work_id":"27be7b91-95ee-4fae-b15a-10e4080f128c","year":1999},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.232782Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:a19b875a2392e848e89ffcf54174bc50717a83672bbf75298ec227bf9a4f950e","observation_id":"f5217195-0d4a-41f7-9c28-8d6a5a567a33","resolution":{"observed_at":"2026-08-10T14:35:37.309948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.295662Z","title":"Trespalacios and I","venue":null,"work_id":"6a5776bf-0b86-4fe7-8e01-0c8ab83f2a8f","year":2014},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.236572Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:6bee2c83782635bd80709659e48ae5d86534d68913044c154193494e2615aea8","observation_id":"a26729df-52aa-4741-b55b-33f1df6fc0ac","resolution":{"observed_at":"2026-08-10T14:35:37.299331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.284065Z","title":"Trespalacios and I","venue":null,"work_id":"be2558c4-c405-49d9-bcf3-e3df5b9b5140","year":2016},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.240050Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:dd24d0d3de2e4b3f5754db39c2100fec8c4d5e7589bee5682b38d2774fd33a14","observation_id":"ce533f03-7e10-4587-97cc-16ec883df886","resolution":{"observed_at":"2026-08-10T14:35:37.287588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T14:35:37.271346Z","title":null,"venue":null,"work_id":"c89a8f02-de67-4158-847e-7916ef528844","year":2011},"citing_paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T14:35:37.243562Z"},"links":{"citing_paper":"/paper/2501.15345"},"observation_digest":"sha256:fa73b1a960e5553a8fb29517667cac6fdc0e011799e4b1464df3c97ebc328c9d","observation_id":"20f6286a-9241-4691-91cd-9bf6794e8377","resolution":{"observed_at":"2026-08-10T14:35:37.276193Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.15345","last_updated":"2025-01-25T23:05:28Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T08:18:39.164321Z","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":24},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2501.15345."}