{"as_of":"2026-08-15T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0fdb1972bb355502612e4921823e216d5cb8e39e9aab2af377f4d0050071899d","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T14:34:59.783624Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2501.15301/citation-record","integrity":"/paper/2501.15301/integrity","json":"/paper/2501.15301/citation-record.json","paper":"/paper/2501.15301"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.929819Z","title":"Prediction and entropy of printed englis h,","venue":null,"work_id":"0e5bb1f5-f23a-47c9-b70d-ddbcdf1ed9cb","year":1951},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.744437Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:4d94cdcd3da92201963b26bac3e05e33eaf4b03ed6f7d592deaaf4712a8b8572","observation_id":"b1411cc5-0ffc-4a9b-8418-2b7f26d24e79","resolution":{"observed_at":"2026-08-10T14:34:59.933599Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.919178Z","title":"Mutual information neural esti mation,","venue":null,"work_id":"c0a6dbfd-2dfb-4310-83a8-5ad941a543fb","year":2018},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.748409Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:b9729c1db01ff92761958bef36441ded5c839db38a916183e414970dce860636","observation_id":"9e28801c-418c-4a0d-8d8e-a5b72031b3ac","resolution":{"observed_at":"2026-08-10T14:34:59.923042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.907477Z","title":"Approximating mutual information of high-dimensional variables using le arned representations,","venue":null,"work_id":"4dece28d-0384-4ae5-9259-091328d317ba","year":2024},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.751860Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:d78569091cca3d966c902f66e814523845fec2f7b845e7fe00675bcc84693270","observation_id":"9b43bca3-5a92-4a11-a02f-fde7df921339","resolution":{"observed_at":"2026-08-10T14:34:59.911244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.895684Z","title":"Dependence induced representations ,","venue":null,"work_id":"df92deab-1b5c-45a9-9322-5823953fed3c","year":2024},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.755553Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:902ec39b8eb2ff27c61750178cf0fce4687529b4ba2293d303ff8a5e9494db6d","observation_id":"2ed67868-b656-47c5-a0fa-d6e389a4a042","resolution":{"observed_at":"2026-08-10T14:34:59.900071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.884790Z","title":"The common information of two dependent rando m vari- ables,","venue":null,"work_id":"f630f3fe-ced2-488f-8881-c393e2ba2664","year":1975},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.759427Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:42ed2a8d5fbdadad6c3763fe112bb639320e1965df70099ba511b20b0fcf5113","observation_id":"37bbe660-bf39-45c6-b8b5-45024af93ace","resolution":{"observed_at":"2026-08-10T14:34:59.888865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.872267Z","title":"Common information is far less t han mutual information","venue":null,"work_id":"76bed934-2abb-422b-a867-ac49ec8cbb19","year":1973},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.763101Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:2d4e8c76f1a7c47da3d4588889a7203f57c238ab73ead8b20f200add32f328be","observation_id":"4b86ffe1-a607-48fd-886b-4280587cace0","resolution":{"observed_at":"2026-08-10T14:34:59.876036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-08-12T16:03:20.142135Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-10T14:34:59.766736Z","title":"The information bottleneck method,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.766736Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:6bf0dd9725d70141c9b104137fdeb556d9afc7d85c6ebe7a51f68d4940f418df","observation_id":"38adb9d4-de62-4373-9234-0217c9b2c96f","resolution":{"observed_at":"2026-08-10T14:34:59.766736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.770339Z","title":"Universal features for high-dimensional learning and inf erence,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.770339Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:a32ac8446d00533d0632fcffebee52a97d02275d874667417acf81fd6127d6db","observation_id":"58284b08-532e-4c4e-aaa5-3326b2059654","resolution":{"observed_at":"2026-08-10T14:34:59.770339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.860121Z","title":"Neural feature learning in function s pace,","venue":null,"work_id":"74983160-0359-4fc0-878d-9fdbf3891f78","year":2024},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.773699Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:6fcf65379010228f29a05f41784f0b31db408afde56918021e62fdf0aee68d2a","observation_id":"b2abc8e4-1027-4ca6-9629-6e49d76afbe6","resolution":{"observed_at":"2026-08-10T14:34:59.864122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.777024Z","title":"On sequences of pairs of dependent random variables,","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.777024Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:4f23e2b766bc1e8bc70d2e1606abe3a2223724a45e748e1eb4317335175d92cb","observation_id":"1078400a-dba3-4c90-ad01-26077a0574fe","resolution":{"observed_at":"2026-08-10T14:34:59.777024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.837541Z","title":"Hypothesis testing with co mmunication constraints,","venue":null,"work_id":"849c5128-bf6e-4f2f-9e9b-a4f5106d7a7b","year":1986},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.780363Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:8a914ebb0511fc82f882efff0ff232d85a00b548cba4c12176312d98e53b5eeb","observation_id":"fbd20f35-47d3-4d7a-bd76-544816db9c2c","resolution":{"observed_at":"2026-08-10T14:34:59.841838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T14:34:59.825658Z","title":null,"venue":null,"work_id":"ac8c1449-b1a6-4038-8947-ffd91dc9b128","year":2006},"citing_paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:34:59.783624Z"},"links":{"citing_paper":"/paper/2501.15301"},"observation_digest":"sha256:7efb21395fbeb9da8a81e80185b59caf0a1bf11cb6944e7c3e65bc8c30e5dde3","observation_id":"28c06b81-dcf5-4553-99b3-0e984dcc28c3","resolution":{"observed_at":"2026-08-10T14:34:59.830118Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}}],"paper":{"arxiv_id":"2501.15301","last_updated":"2025-01-25T18:53:55Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T14:22:47.206307Z","submitted_at":"2025-01-25T18:53:55Z","title":"Separable Computation of Information Measures"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":8},"total_outbound_references":12},"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 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2501.15301."}