{"as_of":"2026-08-20T10:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:09e5ec0c1b14310b12a8fc25d99706a0da48a8c707802858dd0e58e77514e449","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T04:34:45.656594Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-25T04:35:20.753096Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.24235","last_updated":"2026-08-12T03:43:59Z","snapshot_observed_at":"2026-08-18T15:12:18.615748Z","submitted_at":"2025-09-29T03:20:05Z","title":"Towards Tighter Convex Relaxation of Mixed-Integer Programs: Leveraging Logic Network Flow for Task and Motion Planning","version":2},"cited_work":{"arxiv_id":"2509.24235","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.24235","snapshot_observed_at":"2026-08-13T01:24:42.044673Z","title":"Towards tighter convex relaxation of mixed-integer programs: Leveraging logic network flow for task and motion planning","venue":null,"work_id":"b33ae4fa-2741-401e-86a4-1c6a259fc6d6","year":2025},"citing_paper":{"arxiv_id":"2605.23240","last_updated":"2026-05-22T05:19:43Z","snapshot_observed_at":"2026-08-18T13:19:53.695047Z","submitted_at":"2026-05-22T05:19:43Z","title":"Signal Temporal Logic Motion Planning via Graphs of Convex Sets","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-25T04:34:45.656594Z"},"links":{"cited_paper":"/paper/2509.24235","citing_paper":"/paper/2605.23240"},"observation_digest":"sha256:925b43d042d9ec01e62703fab09eb8cf948f0228c5a621a246ed87578544ff76","observation_id":"5e593014-87df-4b0d-ada1-ec558365bb91","resolution":{"observed_at":"2026-08-13T01:24:42.044673Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.24235/citation-record","integrity":"/paper/2509.24235/integrity","json":"/paper/2509.24235/citation-record.json","paper":"/paper/2509.24235"},"outbound":[],"paper":{"arxiv_id":"2509.24235","last_updated":"2026-08-12T03:43:59Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-18T15:12:18.615748Z","submitted_at":"2025-09-29T03:20:05Z","title":"Towards Tighter Convex Relaxation of Mixed-Integer Programs: Leveraging Logic Network Flow for Task and Motion Planning"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2509.24235."}