{"as_of":"2026-08-16T09:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc49eb19da4a33530bce3d625b6e57c0886b458bb9a028a6db69b6767b9c496b","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:22:17.047762Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.07584/citation-record","integrity":"/paper/1908.07584/integrity","json":"/paper/1908.07584/citation-record.json","paper":"/paper/1908.07584"},"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-14T12:22:17.752650Z","title":null,"venue":null,"work_id":"c280953d-e04a-41bf-9d70-5142c77caebf","year":2007},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.861482Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:1a2fa85dd9d0a7d89a666003195242159c0ddecb044030379aedade0c8331883","observation_id":"d92b0f3f-3417-4bf0-831a-2624cdeb164b","resolution":{"observed_at":"2026-08-14T12:22:17.762014Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.722196Z","title":"Operations Research Letters 33(1):42--54","venue":null,"work_id":"62fcc1dc-0ee9-4d65-8221-e3d87d659110","year":2005},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.871143Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:332348ced51c968c8c83b710ef3aaa0f8033cb0c2f41c23e44dc406362702d65","observation_id":"351e7334-986c-427a-a256-23fc50cf63e0","resolution":{"observed_at":"2026-08-14T12:22:17.733440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.689049Z","title":"INFORMS Journal on Computing 29:185--195","venue":null,"work_id":"f4b5b5f0-f63a-4184-8f44-edc08afb3bd1","year":2017},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.885908Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:0a630e05c6084da5f211fca6936a54e060c7924ffbf7fbfb8e11f4a86fc67e43","observation_id":"dd051dc5-0af0-4ad0-afaa-ecb35deb76b2","resolution":{"observed_at":"2026-08-14T12:22:17.700021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.660132Z","title":null,"venue":null,"work_id":"35f1f21e-cd1b-4a75-bb37-487032c7cab0","year":2007},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.893919Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:567a8685047581df4a870e9282185a5620f7fb55f0f8b6249e8008ec23905782","observation_id":"ed5ca263-24c3-401a-9bad-a9f88f75c7f3","resolution":{"observed_at":"2026-08-14T12:22:17.668718Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.629180Z","title":"Mathematical Programming 1:76--94","venue":null,"work_id":"a473ef86-87fc-439a-afbe-881ad182c7d9","year":1971},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.900888Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:0c8b595a0098781c7d073ad2af0f498633d07fa8c809b85250d05535687ae85b","observation_id":"31c2b6a6-56d1-4e3c-a00e-fb095b43cf19","resolution":{"observed_at":"2026-08-14T12:22:17.635747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.604752Z","title":"Technical report CRPC-TR95554 , Center for Research on Parallel Computation","venue":null,"work_id":"09d9718c-b6e0-4a39-8cc9-617a78ab077e","year":1995},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.908739Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:349a736fc0b67c6890c9a6229139616af4b438b64d55ea00bfe34ef92bf2f216","observation_id":"4bce0ca1-37c9-42a5-bea0-8c6e1b6bdc23","resolution":{"observed_at":"2026-08-14T12:22:17.614803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.570145Z","title":"Proceedings of the thirtieth annual ACM symposium on Theory of computing, 100--105 (ACM)","venue":null,"work_id":"34d6dad4-9a7c-47dd-a3a7-7f5bc68e78f3","year":1998},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.917414Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:74d2a906f934ee843d15a81691ae020377446d40080de2c5fa1fb86acdc75414","observation_id":"09330e8e-0cea-4de3-bf0d-1ed30cab82a4","resolution":{"observed_at":"2026-08-14T12:22:17.578404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.540161Z","title":"INFORMS Journal on Computing 23:26--40","venue":null,"work_id":"5ec7138b-337e-49da-866a-a7c3ebabb204","year":2011},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.924495Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:1d39aca63212d3e9db2c7a28aef2f5d0ea0a8645ec93592e24802806682e1177","observation_id":"840e9cfe-b1eb-4029-bbec-64b2446b8cf2","resolution":{"observed_at":"2026-08-14T12:22:17.548158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.514146Z","title":"INFORMS Journal on Computing 17:356--373","venue":null,"work_id":"69c3552f-0848-4913-85c1-8d0b9fc5cd3e","year":2005},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.933983Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:dd5d7e74904d962886ca6fd1eff326b5257ef5aa253bd5a0b19ef1da2ede81c2","observation_id":"2df46a16-fa8e-44f6-b363-b525877c3d2a","resolution":{"observed_at":"2026-08-14T12:22:17.523170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.491655Z","title":"Czechoslovak Mathematical Journal 20(1):109--111","venue":null,"work_id":"027cc640-0cd5-4420-bfad-cbb724df77a4","year":1970},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.941097Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:c68985709aa54dd87cbfdf8f1f8a68840fe8a765f9769d00c55ce18b7493edcf","observation_id":"44caa51e-c49a-4f5a-91f5-af10f6f39044","resolution":{"observed_at":"2026-08-14T12:22:17.497831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.461981Z","title":"Operations Research 48:623--634","venue":null,"work_id":"ee88ccb3-d672-4c4f-b94e-b97d8350df74","year":2000},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.952240Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:1adaabb7c181cfa914362079b7377f2427515db7dcdd54f9ee54c5ed5fe0cb0e","observation_id":"b7186cfb-12a0-467c-b4b1-f3edf423a33b","resolution":{"observed_at":"2026-08-14T12:22:17.469922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.430986Z","title":"Mathematical Programming 12:26--47","venue":null,"work_id":"dd83f965-2fa1-4e52-85d9-bc20a91bab80","year":1977},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.967862Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:6f1ed16efab6ff323f6ae558424b680ea01095740723bc5a9d5f76feece26022","observation_id":"c318a361-1089-49f4-a441-f83430c4de55","resolution":{"observed_at":"2026-08-14T12:22:17.441271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.399687Z","title":"IJCAI Proceedings, 607--615","venue":null,"work_id":"e2ad27f9-4b29-41d6-85e5-8c05af2b3ca2","year":1995},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.979314Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:7b2e4c14dad5bdc5c2d78b3152ee2f4010a73ab66342a0efb859de7a16df899e","observation_id":"b066fd3c-06d8-4fae-81dc-b945f845df7f","resolution":{"observed_at":"2026-08-14T12:22:17.415832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.372910Z","title":"Freuder EC, ed., Principles and Practice of Constraint Programming (CP 1996), volume 1118 of Lecture Notes in Computer Science, 224--236 (Springer)","venue":null,"work_id":"779702c2-a59b-4473-b14e-2ff93e43d98a","year":1996},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.991612Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:1069e14df5c1f29852932f618361d7a952661f089bacc321759733050791ab52","observation_id":"3679df6d-1aa1-439b-b392-200bdcda4985","resolution":{"observed_at":"2026-08-14T12:22:17.379379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.345478Z","title":"(Springer)","venue":null,"work_id":"6d71d622-acb7-46ad-b8e1-030545a00fe4","year":2012},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:16.998325Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:1d79149dc421a092b1f42c51aefca91764ac13e17b342dd030f91986b7846c1b","observation_id":"08fd6461-f2ef-409d-be40-e04574cabd0b","resolution":{"observed_at":"2026-08-14T12:22:17.358312Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.314471Z","title":"AAAI Proceedings, 724--731","venue":null,"work_id":"3c66d5fd-69a2-4a16-81e9-a03dc7427b86","year":2016},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.008547Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:ecec23840f0f14d1dea6aeff223ef77c5ca1d90d750c3c3bcef60ab74a7a182a","observation_id":"cb4238e2-1c36-463c-a303-8bb5b272cd56","resolution":{"observed_at":"2026-08-14T12:22:17.328378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.276775Z","title":"Artificial intelligence 27:97--109","venue":null,"work_id":"6427d575-b3c1-4cf6-8d9e-80e83a140de6","year":1985},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.014636Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:07d0865055287858cb403344b73c09cfb808cf4164d562dc30dcfb2bf72bdf04","observation_id":"45d5eab1-6ef6-4b44-bd53-9d2b325559ec","resolution":{"observed_at":"2026-08-14T12:22:17.289606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.247233Z","title":"INFORMS Journal on Computing 11:173--187","venue":null,"work_id":"d6a9e864-93c2-44b5-b5a5-0769244214a6","year":1999},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.020592Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:e622f6689a2caef9c5e9fb282d5ba17fd465b66b400dedbf70c495cb9bad3d33","observation_id":"75d8135c-5282-44a9-97b8-de5474618da0","resolution":{"observed_at":"2026-08-14T12:22:17.253449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.217778Z","title":"Mathematical Programming 126:147--178","venue":null,"work_id":"cdeba5fd-929f-44d8-a1ed-d00c18057910","year":2011},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.027109Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:2296bed2cfed870a6ae717c972aee98dcc1b079065f0a38313b779e7e9204082","observation_id":"e17d7a75-6f70-4ecf-bff7-5a5df0d46162","resolution":{"observed_at":"2026-08-14T12:22:17.227686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.188307Z","title":"User documentation","venue":null,"work_id":"5b8ae969-1cfc-419b-b856-0764a05c7e55","year":2017},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.034754Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:ed6f49920bce530bb6aac8eac275f79a17a2a222bbf1bf48338d04a4a53c62b9","observation_id":"fcce2ed8-1f74-4578-b02b-537ebeaedbdb","resolution":{"observed_at":"2026-08-14T12:22:17.195145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.153876Z","title":"SIAM journal on computing 15(2):561--580","venue":null,"work_id":"938bc742-77a1-4ebe-87fd-a67fc128d396","year":1986},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.040819Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:3bc405e43cb6689c7ad2381674b230909690d189250a5c9c88d2f045fad8d039","observation_id":"9b70fc94-e645-4320-8366-6219d1e280e4","resolution":{"observed_at":"2026-08-14T12:22:17.169244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T12:22:17.113431Z","title":"Michel L, ed., CPAIOR Proceedings, volume 9075 of Lecture Notes in Computer Science, 437--453 (Springer)","venue":null,"work_id":"bb4bc206-0cd8-4eb4-817c-2bfb78823958","year":2015},"citing_paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-14T12:22:17.047762Z"},"links":{"citing_paper":"/paper/1908.07584"},"observation_digest":"sha256:f2e5134637a8c2a17053b729be75398f5df55418fad074a80937e020956837dc","observation_id":"c7790246-0b65-4891-b13b-2e22dde4e7af","resolution":{"observed_at":"2026-08-14T12:22:17.124324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07584","last_updated":"2019-08-20T19:45:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T12:00:15.844641Z","submitted_at":"2019-08-20T19:45:46Z","title":"Optimization Bounds from the Branching Dual"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":20},"total_outbound_references":22},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:1908.07584."}