{"as_of":"2026-08-20T18:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ef05a06bbc3427214afa549573c938b0da9756b554e1899f4e069456572ca74b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:31:07.966988Z","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-09T11:37:34.881514Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1803.09621","last_updated":"2019-02-15T14:24:04Z","snapshot_observed_at":"2026-08-20T09:02:12.708356Z","submitted_at":"2018-03-26T14:29:42Z","title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks","version":2},"cited_work":{"arxiv_id":"1803.09621","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.09621","snapshot_observed_at":"2026-08-09T11:37:34.881514Z","title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks","venue":"cs.LG","work_id":"5a5b6b40-51fb-4506-a882-75f47b608dbc","year":2018},"citing_paper":{"arxiv_id":"2502.02666","last_updated":"2025-02-04T19:11:02Z","snapshot_observed_at":"2026-08-17T08:36:33.387095Z","submitted_at":"2025-02-04T19:11:02Z","title":"Deep Reinforcement Learning Enabled Persistent Surveillance with Energy-Aware UAV-UGV Systems for Disaster Management Applications","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T11:37:34.718877Z"},"links":{"cited_paper":"/paper/1803.09621","citing_paper":"/paper/2502.02666"},"observation_digest":"sha256:96ae2c0bde41634a158ae90a62e98a8f3ae618e9f702c4c9e6682efab88d27c9","observation_id":"8e86d275-52b2-43fc-8d95-ccf7d796d649","resolution":{"observed_at":"2026-08-09T11:37:34.885025Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"1803.09621","last_updated":"2019-02-15T14:24:04Z","snapshot_observed_at":"2026-08-20T09:02:12.708356Z","submitted_at":"2018-03-26T14:29:42Z","title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.09621","snapshot_observed_at":"2026-08-15T18:31:07.966988Z","title":"Learning the multiple traveling salesmen problem with permutation invariant pooling networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.19703","last_updated":"2025-07-11T17:51:51Z","snapshot_observed_at":"2026-08-16T05:30:13.106695Z","submitted_at":"2025-06-24T15:12:45Z","title":"Learning-aided Bigraph Matching Approach to Multi-Crew Restoration of Damaged Power Networks Coupled with Road Transportation Networks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:31:07.966988Z"},"links":{"cited_paper":"/paper/1803.09621","citing_paper":"/paper/2506.19703"},"observation_digest":"sha256:f2a33ecb92e26d268848a2f3cb5c052bac4fd86f551865d1b41fe7fc7645cac2","observation_id":"6ec6dc5a-988f-4048-baa7-71acd30d2610","resolution":{"observed_at":"2026-08-15T18:31:07.966988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1803.09621/citation-record","integrity":"/paper/1803.09621/integrity","json":"/paper/1803.09621/citation-record.json","paper":"/paper/1803.09621"},"outbound":[],"paper":{"arxiv_id":"1803.09621","last_updated":"2019-02-15T14:24:04Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T09:02:12.708356Z","submitted_at":"2018-03-26T14:29:42Z","title":"Learning the Multiple Traveling Salesmen Problem with Permutation Invariant Pooling Networks"},"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 2 inbound Pith citation observations for arXiv:1803.09621."}