{"as_of":"2026-08-16T15:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b033324a2307bf42d86afca50c071885824aeb7ef90eb34d2dba41334f0028d","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:48:45.445904Z","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-10T17:39:44.343838Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1711.00108","last_updated":"2018-02-13T02:05:34Z","snapshot_observed_at":"2026-08-16T10:37:31.355107Z","submitted_at":"2017-10-31T20:55:06Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00108","snapshot_observed_at":"2026-08-14T13:48:45.445904Z","title":"Meyerson and R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04339","last_updated":"2019-08-12T19:06:32Z","snapshot_observed_at":"2026-08-16T07:08:50.994701Z","submitted_at":"2019-08-12T19:06:32Z","title":"Feature Partitioning for Efficient Multi-Task Architectures","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:48:45.445904Z"},"links":{"cited_paper":"/paper/1711.00108","citing_paper":"/paper/1908.04339"},"observation_digest":"sha256:63b238b02d5da702a74e8b22228b7f8be2e56c46d8649ce3bace980f00f224ad","observation_id":"66fb5556-903d-4335-bd44-a786089d0b55","resolution":{"observed_at":"2026-08-14T13:48:45.445904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00108","last_updated":"2018-02-13T02:05:34Z","snapshot_observed_at":"2026-08-16T10:37:31.355107Z","submitted_at":"2017-10-31T20:55:06Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.00108","snapshot_observed_at":"2026-08-04T16:07:41.564143Z","title":"Beyond shared hi- erarchies: Deep multitask learning through soft layer order- ing.arXiv preprint arXiv:1711.00108, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.16635","last_updated":"2026-05-30T19:40:10Z","snapshot_observed_at":"2026-08-11T00:10:48.562480Z","submitted_at":"2025-09-20T11:20:22Z","title":"Towards Anytime Retrieval: A Benchmark for Anytime Person Re-Identification","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T16:07:41.564143Z"},"links":{"cited_paper":"/paper/1711.00108","citing_paper":"/paper/2509.16635"},"observation_digest":"sha256:62cfe0c826243562d125368006b7ec1add461ca87b4d1a093c286fa7fb5a3c62","observation_id":"e2fcea49-bd00-4abd-a27b-605e21364c73","resolution":{"observed_at":"2026-08-04T16:07:41.564143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00108","last_updated":"2018-02-13T02:05:34Z","snapshot_observed_at":"2026-08-16T10:37:31.355107Z","submitted_at":"2017-10-31T20:55:06Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering","version":2},"cited_work":{"arxiv_id":"1711.00108","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.00108","snapshot_observed_at":"2026-08-10T17:39:44.343838Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering","venue":"cs.LG","work_id":"be59c666-3c67-4e86-9dba-1c58619cd172","year":2017},"citing_paper":{"arxiv_id":"2608.06963","last_updated":"2026-08-07T08:40:40Z","snapshot_observed_at":"2026-08-14T11:32:07.504602Z","submitted_at":"2026-08-07T08:40:40Z","title":"Learning in Deep Networks under Dale's Constraint","version":1},"reference_index":163,"source":"arxiv_source","source_observed_at":"2026-08-10T17:39:42.971801Z"},"links":{"cited_paper":"/paper/1711.00108","citing_paper":"/paper/2608.06963"},"observation_digest":"sha256:e728120729a2990642c132d4bdfbad5ad811c97155eff417a38d4b7a239b1e2d","observation_id":"90465155-a838-408c-9f10-a3c3f92e9a41","resolution":{"observed_at":"2026-08-10T17:39:44.349353Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1711.00108/citation-record","integrity":"/paper/1711.00108/integrity","json":"/paper/1711.00108/citation-record.json","paper":"/paper/1711.00108"},"outbound":[],"paper":{"arxiv_id":"1711.00108","last_updated":"2018-02-13T02:05:34Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T10:37:31.355107Z","submitted_at":"2017-10-31T20:55:06Z","title":"Beyond Shared Hierarchies: Deep Multitask Learning through Soft Layer Ordering"},"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-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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1711.00108."}