{"as_of":"2026-08-08T12:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4f40b07c6b8262541959a7687028d53f1c9bb205f93916a9073f4f05423e9cb4","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-08T06:32:00.761636+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-08-06T17:23:44.038021Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-06T17:23:46.373784Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.09444","last_updated":"2024-12-17T13:24:36Z","snapshot_observed_at":"2026-08-04T17:02:50.770662Z","submitted_at":"2024-12-12T16:57:46Z","title":"Search Strategy Generation for Branch and Bound Using Genetic Programming","version":2},"cited_work":{"arxiv_id":"2412.09444","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.09444","snapshot_observed_at":"2026-08-06T17:23:46.373784Z","title":"Search Strategy Generation for Branch and Bound Using Genetic Programming","venue":"cs.LG","work_id":"3f47fca4-d30d-4ac0-a072-3a0cd0403228","year":2024},"citing_paper":{"arxiv_id":"2507.11063","last_updated":"2025-07-15T07:55:09Z","snapshot_observed_at":"2026-08-06T17:14:56.435561Z","submitted_at":"2025-07-15T07:55:09Z","title":"A Distance Metric for Mixed Integer Programming Instances","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T17:23:44.038021Z"},"links":{"cited_paper":"/paper/2412.09444","citing_paper":"/paper/2507.11063"},"observation_digest":"sha256:73957d49725665bdaeebf48e0fe5c4147265624dbfd57c34b65e3e30ef0c9525","observation_id":"1b259f9c-b63c-48e3-8ca0-ebebbc0a8826","resolution":{"observed_at":"2026-08-06T17:23:46.434005Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.09444/citation-record","integrity":"/paper/2412.09444/integrity","json":"/paper/2412.09444/citation-record.json","paper":"/paper/2412.09444"},"outbound":[],"paper":{"arxiv_id":"2412.09444","last_updated":"2024-12-17T13:24:36Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T17:02:50.770662Z","submitted_at":"2024-12-12T16:57:46Z","title":"Search Strategy Generation for Branch and Bound Using Genetic Programming"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.09444."}