{"as_of":"2026-08-15T18:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:75ee86522848f673c6fd2f2c6bd5304bcd1bc4530798df5b3f11568c15c402e8","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:53:52.300235Z","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-13T21:08:17.745153Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-12T16:53:52.300235Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.13348","last_updated":"2025-06-06T18:36:31Z","snapshot_observed_at":"2026-08-15T13:29:28.223300Z","submitted_at":"2024-11-20T14:19:30Z","title":"Parameterized Complexity of the Star Decomposition Problem","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T16:53:52.300235Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2411.13348"},"observation_digest":"sha256:70db04055e96dc58e72964b8db4d5ae0ba17eb54f7eb05ad8f10637771e8eb72","observation_id":"d443c60e-e5fe-4e75-9c6a-1c24ef807651","resolution":{"observed_at":"2026-08-12T16:53:52.300235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-12T11:31:19.141526Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2411.18367","last_updated":"2024-11-27T14:15:38Z","snapshot_observed_at":"2026-08-15T18:14:46.815861Z","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T11:31:19.141526Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2411.18367"},"observation_digest":"sha256:0aeb0dcc3280da5603449fa152751d62aaa5c711970b6fcb4cc62ddb3ef7ac5c","observation_id":"80e6c981-b25b-4d40-828f-ec6f887df1a1","resolution":{"observed_at":"2026-08-12T11:31:19.141526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-07T13:25:59.195132Z","title":"CoRRabs/1904.01361 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.22212","last_updated":"2025-05-28T10:39:56Z","snapshot_observed_at":"2026-08-13T08:34:36.288834Z","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:59.195132Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2505.22212"},"observation_digest":"sha256:cace054ab9a2978feb253cc9ecda0045fc8ec1b5b6fbcea71f152a08baac7f5e","observation_id":"fcac3ed5-c353-4e64-9b7c-09c7be57c7f1","resolution":{"observed_at":"2026-08-07T13:25:59.195132Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-06T20:19:07.623391Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2507.03766","last_updated":"2026-07-17T16:25:12Z","snapshot_observed_at":"2026-08-12T22:12:56.741398Z","submitted_at":"2025-07-04T18:33:19Z","title":"A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T20:19:07.623391Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2507.03766"},"observation_digest":"sha256:1ab227600818c012895450c50858f87730e36962dade9baa4ac8f150b4d83225","observation_id":"38481124-33c9-4f3a-9305-9807364feaaa","resolution":{"observed_at":"2026-08-06T20:19:07.623391Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":"1904.01361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":"7a03cbe2-cbae-4768-a539-75e10a5b4df9","year":1904},"citing_paper":{"arxiv_id":"2604.02395","last_updated":"2026-07-22T19:26:19Z","snapshot_observed_at":"2026-08-02T17:02:34.801401Z","submitted_at":"2026-04-02T13:14:08Z","title":"Complexity of Eliminating (Majority) Illusion in Directed Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T21:05:41.511674Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2604.02395"},"observation_digest":"sha256:a61c30a16d3ce1a8ee7597db5ba87e0bb1e4d8f341ca45c76af6bb3bbeb4ab51","observation_id":"17e3c3c2-ec16-4249-ac50-35acbb47b7d3","resolution":{"observed_at":"2026-05-13T21:08:17.748431Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-08-02T17:02:37.109812Z","title":"An algorithmic theory of integer programming.arXiv preprint arXiv:1904.01361, 2019","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2604.02395","last_updated":"2026-07-22T19:26:19Z","snapshot_observed_at":"2026-08-02T17:02:34.801401Z","submitted_at":"2026-04-02T13:14:08Z","title":"Complexity of Eliminating (Majority) Illusion in Directed Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T17:02:37.109812Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2604.02395"},"observation_digest":"sha256:9c08b8ff0907aa9a1a5cc0650e14af310374ef9fe3877420dfbba0b0722895b2","observation_id":"5d5c5777-6472-4357-b30e-d4092b2d97b0","resolution":{"observed_at":"2026-08-02T17:02:37.109812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer Programming","version":3},"cited_work":{"arxiv_id":"1904.01361","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1904.01361","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An algorithmic theory of integer programming","venue":null,"work_id":"7a03cbe2-cbae-4768-a539-75e10a5b4df9","year":1904},"citing_paper":{"arxiv_id":"2604.18746","last_updated":"2026-04-20T18:49:44Z","snapshot_observed_at":"2026-08-13T18:17:43.268723Z","submitted_at":"2026-04-20T18:49:44Z","title":"Parameterized Capacitated Vertex Cover Revisited","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-10T03:09:41.266174Z"},"links":{"cited_paper":"/paper/1904.01361","citing_paper":"/paper/2604.18746"},"observation_digest":"sha256:b895b82130d821835ff5c73dbe8278c0ae8d03a154a76dc3b0d8f29165dfbfc6","observation_id":"1c1c857f-6461-4efb-83a7-de17b5a8d74f","resolution":{"observed_at":"2026-05-11T12:41:05.098785Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1904.01361/citation-record","integrity":"/paper/1904.01361/integrity","json":"/paper/1904.01361/citation-record.json","paper":"/paper/1904.01361"},"outbound":[],"paper":{"arxiv_id":"1904.01361","last_updated":"2022-07-29T16:31:59Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-14T16:53:03.354778Z","submitted_at":"2019-04-02T12:14:02Z","title":"An Algorithmic Theory of Integer 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-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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:1904.01361."}