{"as_of":"2026-08-18T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:279d68c2a1117dfd226685dfc7a453a3aa54ce2ba4fbc0a8c12c9df0b0a989a6","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:26:15.793217Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2509.10587/citation-record","integrity":"/paper/2509.10587/integrity","json":"/paper/2509.10587/citation-record.json","paper":"/paper/2509.10587"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:26:15.670521Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.670521Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:fe4c6ef608af18d7d080d86acc4b76989c23c7d3131f0628c1df202aafefd575","observation_id":"a1d78851-215d-4d0a-b374-be02728b274e","resolution":{"observed_at":"2026-08-04T18:26:15.670521Z","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-04T18:26:15.674068Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.674068Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:4f789f52859732b7ba6d6f75b3028c60c5479dbfc0f31ef901bc7a67852df87b","observation_id":"a2036dbe-cf4c-4e84-9e03-789f42b93ee5","resolution":{"observed_at":"2026-08-04T18:26:15.674068Z","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-04T18:26:15.677128Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.677128Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:2154c1043f3b79d7b4bbbb6642303c125277c9b0a24e8cc38a12d6b700525156","observation_id":"472e699c-7ede-439a-9f56-2506c88b43c2","resolution":{"observed_at":"2026-08-04T18:26:15.677128Z","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-04T18:26:15.680215Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.680215Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:04ed3f83b8801b1663daa883fd396d4e24e3a248230a565883c2e920d07e0710","observation_id":"bb5baa56-a166-451e-81f9-5ca99ae8608e","resolution":{"observed_at":"2026-08-04T18:26:15.680215Z","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-04T18:26:15.683240Z","title":"Lectures on functional equations and their applications, volume 19","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.683240Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:3f6df1e7b6ed0fa6cc4ca697d23f4048b5e6bec89cf9c430921ef53f512cda45","observation_id":"cac280fa-9c42-4d5d-b28f-c587fa6f8aa1","resolution":{"observed_at":"2026-08-04T18:26:15.683240Z","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-04T18:26:15.686158Z","title":"Neural network learning: Theoretical foundations","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.686158Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:6ef7efbc370b165772976ea40ce2b44e4c1da6612834a8def27c285050054205","observation_id":"f4b77600-849f-4287-8d43-ed8115de8c51","resolution":{"observed_at":"2026-08-04T18:26:15.686158Z","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-04T18:26:15.689236Z","title":"Variational convergence for functions and operators","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.689236Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:f76eccb6babebd895b81db5458e1b1da51456d7371e628ab28f91ae7d3b79fa4","observation_id":"29eb2eb9-1b5e-43e8-958d-19b33d53e97d","resolution":{"observed_at":"2026-08-04T18:26:15.689236Z","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-04T18:26:15.691988Z","title":"Information and exponential families: in statistical theory","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.691988Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:a64016f28b28da37c248c7ab1f6a6ab152e5383c5f3a9ea867a24c2f7817f4d6","observation_id":"073c778f-1b74-4272-9b4a-51e6e1d63cc0","resolution":{"observed_at":"2026-08-04T18:26:15.691988Z","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-04T18:26:15.694801Z","title":"Rademacher and G aussian complexities: Risk bounds and structural results","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.694801Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:a5bc4d37e4661f581e9bfef5ddeee9d4a8d7d54fb4614f43124da2a7c0636a84","observation_id":"13a0fb88-16e2-423b-a8bb-8e62b910b6e4","resolution":{"observed_at":"2026-08-04T18:26:15.694801Z","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-04T18:26:15.697663Z","title":"Rate distortion theory: A mathematical basis for data compression","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.697663Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:96b283a26664f9d5ef190ff9d23447b0c2ac01c33896d4f9982e3378b78a1f03","observation_id":"39ef0688-7423-4a9f-882c-0b040fc80f37","resolution":{"observed_at":"2026-08-04T18:26:15.697663Z","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-04T18:26:15.700960Z","title":"Concentration inequalities: A nonasymptotic theory of independence","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.700960Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:acc10c5cc673273da8283ff495dfa7818749931f74f2360a84692b900a3a25bb","observation_id":"558719c1-b6cd-4fe7-aaf4-123a898aff25","resolution":{"observed_at":"2026-08-04T18:26:15.700960Z","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-04T18:26:15.703797Z","title":"On L ipschitz embedding of finite metric spaces in H ilbert space","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.703797Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:e17a6253bfa2d98ffec146f601c8f9ddec8a500d25b4dd0925ec1c0e015c7f74","observation_id":"f6359e10-6baf-4dce-b157-c8896b2e213a","resolution":{"observed_at":"2026-08-04T18:26:15.703797Z","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-04T18:26:15.706713Z","title":"Convex optimization","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.706713Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:5a2ce0c0eb746dbe5e530fec9b3f526f6bfdd5f30a570518aaa2fddfeb4f5c74","observation_id":"497e34d8-4b24-469b-b88d-98c2dfd58e0c","resolution":{"observed_at":"2026-08-04T18:26:15.706713Z","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-04T18:26:15.709330Z","title":"Introduction to strong mixing conditions, volume 1","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.709330Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:34199637c1b8147423ddecae8cd85e44d034a4e150f3babb05e61c63c3ac3ae8","observation_id":"86068b90-99b1-49fc-b726-94805bd56226","resolution":{"observed_at":"2026-08-04T18:26:15.709330Z","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-04T18:26:15.712058Z","title":"Hyperbolic graph convolutional neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.712058Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:360b09d61115b3a79ebd130c4f922e961ac84a7f7c71fe96c0b5ed2b9da4f4b5","observation_id":"07e74fc1-e96e-4848-af75-bfcdf8a38b6d","resolution":{"observed_at":"2026-08-04T18:26:15.712058Z","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-04T18:26:15.714703Z","title":"Refh: A reference-based framework for hyperbolic knowledge graph embeddings","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.714703Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:8d62847f9af1775911623708bb9469233d95550e3f2321ce5da4436603e52881","observation_id":"4fdf93d8-6ed8-4433-9c52-db189878642a","resolution":{"observed_at":"2026-08-04T18:26:15.714703Z","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-04T18:26:15.717357Z","title":"Elements of information theory","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.717357Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:bc1a0f109ec9e4ef92ef3fff03229502dd7088a83f9ad32416a9fe745affb40b","observation_id":"2ce174de-c0c1-49ac-8479-d3f5efb7f094","resolution":{"observed_at":"2026-08-04T18:26:15.717357Z","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-04T18:26:15.719925Z","title":"Analysis of survival data, volume 21","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.719925Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:f00395dd370d325556db54cf4aa9e622f03d5f5d8fb4c98d8e8216cf0b244950","observation_id":"94eab408-fca5-4234-ad9b-975e71add494","resolution":{"observed_at":"2026-08-04T18:26:15.719925Z","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-04T18:26:15.722732Z","title":"An introduction to the theory of point processes: volume I : elementary theory and methods","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.722732Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:3f5f649871e1a09f0204974ff51d75fb32f584d4751824ac85bc648755ca3847","observation_id":"63066e75-55b3-41c8-a5e0-97766332a4f7","resolution":{"observed_at":"2026-08-04T18:26:15.722732Z","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-04T18:26:15.725310Z","title":"Differential geometry of curves and surfaces, volume 2","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.725310Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:463e3af17ebe70c36b09d6d78c12c3153ecb52f9c7eb597bd545ba04aeb1dba4","observation_id":"a883c653-1a5d-4e57-bbcb-faa7d947ae1f","resolution":{"observed_at":"2026-08-04T18:26:15.725310Z","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-04T18:26:15.728251Z","title":"Hyperbolic groups","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.728251Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:4c5edd890476ff411502bbdd652abde49a642a4533fce7bb3ff6a9c46456bcb4","observation_id":"d8e58b92-dd50-4cf8-a1c8-5e9d2901ecec","resolution":{"observed_at":"2026-08-04T18:26:15.728251Z","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-04T18:26:15.730943Z","title":"The minimum description length principle","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.730943Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:7d5e3cb901082f5619aaaf4715482ea0be857a2ee853037edef3b8354f137357","observation_id":"ecb8991f-91c4-4434-892a-94a7baacd704","resolution":{"observed_at":"2026-08-04T18:26:15.730943Z","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-04T18:26:15.733608Z","title":"Dyre: A dynamic reasoning network for temporal knowledge graph completion","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.733608Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:f0dc4e37eb946a4196b1401885b5d2ae1e59b148dc1455e27b993320f919ef49","observation_id":"9a2e2d46-0244-4534-a15b-73d0f4afb4d1","resolution":{"observed_at":"2026-08-04T18:26:15.733608Z","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-04T18:26:15.736247Z","title":"Chronor: A time-aware embedding model for temporal knowledge graph completion","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.736247Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:919f54db2becffe06abfb90f927456284c7724bb0de48ccca9034b3339666fb5","observation_id":"83cc2215-f7c6-4d81-ad1f-d625021a0fa7","resolution":{"observed_at":"2026-08-04T18:26:15.736247Z","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-04T18:26:15.738987Z","title":"Roth: Relation-wise rotation for hyperbolic knowledge graph embedding","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.738987Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:334f6b161ed54ce189e81552b13c91db01e46a8e3723b08e2c8eb0f07a68efc9","observation_id":"332b9167-921c-4104-a087-18415517b82e","resolution":{"observed_at":"2026-08-04T18:26:15.738987Z","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-04T18:26:15.741606Z","title":"Spectra of some self-exciting and mutually exciting point processes","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.741606Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:6c3bc23e2c57088159e2b06b5df21abb7354d17900a532e100b6f561ee323fcb","observation_id":"88cbef89-20d0-41a8-bb98-b22335721d75","resolution":{"observed_at":"2026-08-04T18:26:15.741606Z","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-04T18:26:15.744314Z","title":"Probability theory: the logic of science","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.744314Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:c20a3dd832467126762e3856faaf22f5d0d2ddc6b1f927ecd866cecadaf8b789","observation_id":"e0b0444e-e5d0-4b57-8d90-c235223d7145","resolution":{"observed_at":"2026-08-04T18:26:15.744314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05537","last_updated":"2020-04-12T03:43:47Z","snapshot_observed_at":"2026-08-18T21:21:19.380726Z","submitted_at":"2020-04-12T03:43:47Z","title":"Gevrey stability of hydrostatic approximate for the Navier-Stokes equations in a thin domain","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05537","snapshot_observed_at":"2026-08-04T18:26:15.747210Z","title":"Recurrent event network for reasoning over temporal knowledge graphs","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.747210Z"},"links":{"cited_paper":"/paper/2004.05537","citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:9af7a83dc8aea415c56a9c7b88106c3c5352b2717e4da12fc44921eeb40ffe63","observation_id":"0c9a7d74-58d4-4620-8346-34aa6f5ab78c","resolution":{"observed_at":"2026-08-04T18:26:15.747210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09142","last_updated":"2020-04-23T09:31:29Z","snapshot_observed_at":"2026-08-07T18:12:27.295824Z","submitted_at":"2020-04-20T09:07:59Z","title":"The Lyman Alpha Reference Sample XI: Efficient Turbulence Driven Ly{\\alpha} Escape and the Analysis of IR, CO and [C II]158 {\\mu}m","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09142","snapshot_observed_at":"2026-08-04T18:26:15.751342Z","title":"Tensor-based temporal knowledge graph completion","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.751342Z"},"links":{"cited_paper":"/paper/2004.09142","citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:acf42fd8028f739765d70e1d45459f5cf70e3d0f8578c9253ee90a763ff9cc92","observation_id":"ca46e59a-1a33-4710-ab29-b3bf424e159e","resolution":{"observed_at":"2026-08-04T18:26:15.751342Z","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-04T18:26:15.754501Z","title":"Introduction to R iemannian manifolds , volume 176","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.754501Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:8fc9a4fb1e53f19ca9b513902978518ddf5e9d359b8474210eaf5b7eb95e5891","observation_id":"25fa656b-7007-4dd0-b547-513dbc1a49ee","resolution":{"observed_at":"2026-08-04T18:26:15.754501Z","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-04T18:26:15.757257Z","title":"xerte: a cross-modal entity and relation type enhanced model for temporal knowledge graph completion","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.757257Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:919e294bf4829380f2d71de4e9dde21259cc2f76eb97d031228c46782dc9098f","observation_id":"1d0f56d1-419e-4e21-bdb0-eab2c015b0ae","resolution":{"observed_at":"2026-08-04T18:26:15.757257Z","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-04T18:26:15.759948Z","title":"On the method of bounded differences","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.759948Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:aac26ca57dfa80d65f0e68162b24bd36bc0dab89d2246e195eac9e3f7ba2e93c","observation_id":"7aee80e3-6d78-4003-9bda-378766beb713","resolution":{"observed_at":"2026-08-04T18:26:15.759948Z","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-04T18:26:15.762738Z","title":"Foundations of machine learning","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.762738Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:519d52533a2015c74371f8f4ece8777db21e2b155a8b4736a94ed11025a61d32","observation_id":"f083fbe1-e947-414a-9f24-f34af776cc9b","resolution":{"observed_at":"2026-08-04T18:26:15.762738Z","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-04T18:26:15.765503Z","title":"Poincar \\'e embeddings for learning hierarchical representations","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.765503Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:cb087c27594fcd1d16e5959749a2710468839dcf7e932221012e1171de81f505","observation_id":"0ca5935a-caff-4ab4-b913-51680d8f7680","resolution":{"observed_at":"2026-08-04T18:26:15.765503Z","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-04T18:26:15.768235Z","title":"A generalization of the probit and logit methods for dose response curves","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.768235Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:0dcd036d6419d33a6354d72b22629e8f3180668a12565eb5840e7a91beaa344d","observation_id":"0aaf56bd-842a-4243-a83f-0090b0b9c12f","resolution":{"observed_at":"2026-08-04T18:26:15.768235Z","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-04T18:26:15.770994Z","title":"Convex analysis","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.770994Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:ecbf92ba341e1ee9d4c726e0ec34b996290db44fa3d8fbbc771043822ee7ef0e","observation_id":"d71d4221-32e3-4ca0-a0a7-d7ad6fbd63cc","resolution":{"observed_at":"2026-08-04T18:26:15.770994Z","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-04T18:26:15.773915Z","title":"Variational analysis, volume 317","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.773915Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:781ebb5b0c508b2c9d9d12d7346cb6f7dbd0e03c770fe3efdd35cd971d97ad68","observation_id":"40e92a9a-9c26-403b-b309-31df0fd8e919","resolution":{"observed_at":"2026-08-04T18:26:15.773915Z","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-04T18:26:15.776460Z","title":"On the density of families of sets","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.776460Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:b9ffb3fbb1cd0259dbc06acaa8cccc4592c931784e9f883de1fc7cecf367bd98","observation_id":"8080e5a5-c0d3-481c-a5dd-8e1bdb91d77a","resolution":{"observed_at":"2026-08-04T18:26:15.776460Z","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-04T18:26:15.779198Z","title":"A mathematical theory of communication","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.779198Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:7140ae37ed3905be3907f07ad75c58ac34aeb2ff098dc31e527fb563aed29760","observation_id":"73a99a49-bdb0-4a4d-b565-5337b90e1462","resolution":{"observed_at":"2026-08-04T18:26:15.779198Z","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-04T18:26:15.781794Z","title":"Rotate: Knowledge graph embedding by relational rotation in complex space","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.781794Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:44e18f8ecc66b05cddf7197676b3b1d616d21295bfd2074f2efebf0893a52ebe","observation_id":"28d186a7-cd7e-4e57-8c8f-7a78c9308338","resolution":{"observed_at":"2026-08-04T18:26:15.781794Z","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-04T18:26:15.785210Z","title":"Asymptotic statistics, volume 3","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.785210Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:d3da4855b6963c3ce3252df52aacef89790dc4984d542882a75c5d1dae27b049","observation_id":"61910c60-ede6-4394-a019-cc86f8c402e5","resolution":{"observed_at":"2026-08-04T18:26:15.785210Z","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-04T18:26:15.787856Z","title":"Statistical learning theory, volume 1","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.787856Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:309d4ab92b2d4c6586a2186d638070ed03f65ecc19030688e0ded15baa59dd6c","observation_id":"8a05fb11-904c-49d1-914e-41060dfaa9f0","resolution":{"observed_at":"2026-08-04T18:26:15.787856Z","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-04T18:26:15.790491Z","title":"Maximum likelihood estimation of misspecified models","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.790491Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:bfd58e5041d1095a419cbd3fc259b774a3a86b6801edeb8db444eb4667d89fcc","observation_id":"eb66d22c-fb54-4714-9f95-14826f768bf8","resolution":{"observed_at":"2026-08-04T18:26:15.790491Z","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-04T18:26:15.793217Z","title":"Rates of convergence for empirical processes of stationary mixing sequences","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T18:26:15.793217Z"},"links":{"citing_paper":"/paper/2509.10587"},"observation_digest":"sha256:56408c174cfbf842ba7b0337861485cce6458f4beca3c7e96eb20d0963ba64d9","observation_id":"cc8d661b-0f03-472e-beb3-95b3c52d2e27","resolution":{"observed_at":"2026-08-04T18:26:15.793217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10587","last_updated":"2025-09-12T07:25:57Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T05:56:24.994686Z","submitted_at":"2025-09-12T07:25:57Z","title":"MAGNET-KG: Maximum-Entropy Geometric Networks for Temporal Knowledge Graphs: Theoretical Foundations and Mathematical Framework"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2509.10587."}