{"as_of":"2026-08-15T07:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ae5ead0b1c5981762a47bd55051757442df246ce06d4767937596189500a9c0a","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:59:23.949520Z","state":"measured"},{"denominator":62,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":62,"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/2411.11149/citation-record","integrity":"/paper/2411.11149/integrity","json":"/paper/2411.11149/citation-record.json","paper":"/paper/2411.11149"},"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-12T18:59:24.707661Z","title":"In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 1995--2010","venue":null,"work_id":"537ae8e8-e43a-4ba3-893e-95424546f239","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.719365Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:445cb0bebcd3cca5ef74c28dba82a80f7cf8b55fe644b973d348382e803b9662","observation_id":"90580bc0-8a35-4458-b0c5-b9ca17fd3b81","resolution":{"observed_at":"2026-08-12T18:59:24.711986Z","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-12T18:59:24.690515Z","title":"Chaos: An Interdisciplinary Journal of Nonlinear Science 27(4):047,404","venue":null,"work_id":"c98d94b9-c33a-4aa4-abec-5dcfbefce55f","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.724137Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:d35591293e367ce4abc7bf521ed8db2d6dca6b8ce5d4b5bc0754f4ed605fb949","observation_id":"a3b26fa1-ee96-4022-8806-b1b5dfb1a140","resolution":{"observed_at":"2026-08-12T18:59:24.695569Z","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-12T18:59:24.674243Z","title":"Physics reports 424(4-5):175--308","venue":null,"work_id":"6d52661c-5d82-4376-b3b2-980d11134a7e","year":2006},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.727823Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:593f8513c8a0f9f7e6779ee9d8598e8ccad8d4aeb6eaac6316304bff9131e05b","observation_id":"9c3502ec-49d1-4b52-bddc-e361847e8865","resolution":{"observed_at":"2026-08-12T18:59:24.678129Z","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-12T18:59:24.661774Z","title":"Physics reports 544(1):1--122","venue":null,"work_id":"a0ee6f95-51e5-49c0-8815-4bbe10c9265e","year":2014},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.732318Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:648dbd9a937b90e1f7e00465a34509e42b6aa6f0edf7879227b3cd32cdcb8cc9","observation_id":"f9c284d4-a575-491a-8f8d-6551f40c5d9b","resolution":{"observed_at":"2026-08-12T18:59:24.665804Z","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-12T18:59:24.650444Z","title":"In: 2023 IEEE 36th International Symposium on Computer-Based Medical Systems (CBMS), IEEE, pp 628--633","venue":null,"work_id":"bdf976ba-fad8-4b44-8613-3762d9b44ad6","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.735986Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:eec306f51a173cfd35d8cc2858ca4a7cd1b466ce4c72ef16a38440724e22d5cb","observation_id":"c5c42f80-00e7-4535-9b24-5f818e3304d6","resolution":{"observed_at":"2026-08-12T18:59:24.654218Z","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-12T18:59:24.638899Z","title":"In: International Conference on Complex Networks and Their Applications, Springer, pp 75--86","venue":null,"work_id":"57297328-bf77-440d-9725-cd31b21d5a8a","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.739976Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:502049ce413fda6977053c05a9ccb32c765850e2ffebe347f2edc8fe1e221d17","observation_id":"99c313e5-a33e-46ff-847d-24c79301257d","resolution":{"observed_at":"2026-08-12T18:59:24.643162Z","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-12T18:59:24.625215Z","title":"In: Twenty-Fourth AAAI conference on artificial intelligence","venue":null,"work_id":"a7157bb9-ee3f-43a2-a691-b135b8d48e21","year":2010},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.743939Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:bf5e776ebe0071e6c65ad75ae3de4200fec9af16db259db4f4f8f9de067cac65","observation_id":"602dd906-edab-4141-88cc-5872be171474","resolution":{"observed_at":"2026-08-12T18:59:24.629571Z","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-12T18:59:24.612899Z","title":"In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 179--189","venue":null,"work_id":"d18fe154-904e-4a25-8151-4ff17ef5b35f","year":2022},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.747531Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:0615c58d1ee0ba37aa9faa093c57271eee0dea8db1171565aede9d9020027579","observation_id":"f43c47e7-94dc-46f9-9762-f6b473421f3a","resolution":{"observed_at":"2026-08-12T18:59:24.617634Z","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-12T18:59:24.600230Z","title":"arXiv preprint arXiv:160506523","venue":null,"work_id":"d8cb5d58-012b-4a65-9290-14ad1cf9226d","year":2016},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.751105Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c8e4ebe9a73728ef656830fef49c9f60db9bd9b2f116696634115f87279c9d31","observation_id":"784e5324-9ceb-4e76-9250-d52b7db376c6","resolution":{"observed_at":"2026-08-12T18:59:24.604302Z","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-12T18:59:24.587621Z","title":"Michigan State University Libraries","venue":null,"work_id":"948cfc7a-a8d8-45a2-bf16-be3d230837b1","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.754892Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:b42dd781602659622417e8adcdc4875d8e6d27ef0ad6932722fdf5ea131224ef","observation_id":"d6ebdf3e-5524-4500-9c32-5360d79dfc05","resolution":{"observed_at":"2026-08-12T18:59:24.591630Z","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-12T18:59:24.575926Z","title":"arXiv preprint arXiv:160701426","venue":null,"work_id":"1894b740-dfb9-43a9-8fe4-84f790e30d20","year":2016},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.758337Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c4cc8df213ba6be85e8e370a3bbf9f8c41450e25e828ff7a9ac91f5e6953ba82","observation_id":"a93fbb73-a9bf-4202-a98c-dacb9c9cb6eb","resolution":{"observed_at":"2026-08-12T18:59:24.579883Z","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-12T18:59:24.561806Z","title":"arXiv preprint arXiv:171105851","venue":null,"work_id":"1b329f66-2368-4743-a5da-585b6170a4de","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.761758Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:88ea00737457cc28d5b49b6c9e8a0cb1dfd7523e159160a35c6c69ab72d99893","observation_id":"36efdcd0-2062-4225-862d-52184b82fdd7","resolution":{"observed_at":"2026-08-12T18:59:24.566902Z","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-12T18:59:24.549736Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence","venue":null,"work_id":"c2f3bdf7-2dfe-444f-b690-26c054423ade","year":2018},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.764810Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c90a0054dbcfd659cb161ca71da3b34bbf4b7035826e68de11178ef6672ff10d","observation_id":"928aecde-2366-4612-9e0f-34a8e992b088","resolution":{"observed_at":"2026-08-12T18:59:24.554046Z","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-12T18:59:23.767852Z","title":"arXiv preprint arXiv:201209699","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.767852Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:aad5c68fb6b09380e6fde7f485c7957d467a39f824d6967fd31743ac66b77ab9","observation_id":"c175bd3c-90d0-48f5-97b2-c745aef03c44","resolution":{"observed_at":"2026-08-12T18:59:23.767852Z","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-12T18:59:24.531184Z","title":"Advances in Neural Information Processing Systems 35:22,326--22,340","venue":null,"work_id":"d72c4ba4-31fd-4099-b886-72227f011b2d","year":2022},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.770873Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:75bd0bd134ab8af5641ee736e0e555ee13c6340c74a3becc90b7832aa1bdf64c","observation_id":"b5955aa4-39a3-4601-a35f-8c20b012b4a0","resolution":{"observed_at":"2026-08-12T18:59:24.534923Z","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-12T18:59:24.520228Z","title":"Journal of Machine Learning Research 24(43):1--48","venue":null,"work_id":"45092523-8138-42cc-af56-895ea304c139","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.773670Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:f7b27648d2e8670e4ff92d830001bd77945cb9d0b3834631973f8a8328fd30f7","observation_id":"604eaa80-a0fb-4025-b517-e3fde7b32c1a","resolution":{"observed_at":"2026-08-12T18:59:24.524162Z","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-12T18:59:24.509580Z","title":"arXiv preprint arXiv:211110625","venue":null,"work_id":"41199eb2-81eb-4775-81e7-488b077cc513","year":2021},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.776597Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:0912662c47d41d6bbfee5d6ac67a532d90628d02b43a7ad5437017470e20332a","observation_id":"39fcb191-ed86-48a9-a6c8-eed74d0dab50","resolution":{"observed_at":"2026-08-12T18:59:24.513394Z","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-12T18:59:24.498656Z","title":"Transactions on Machine Learning Research","venue":null,"work_id":"f4a657d1-b106-4c80-8ac9-1e111e7d6b59","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.780090Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:9c18ce9f47dfdc4144c26102ab8134177c8326a4d78107149f050a4a48512e8a","observation_id":"6422cd13-965d-4bd0-a6eb-17d0799d1a8f","resolution":{"observed_at":"2026-08-12T18:59:24.502470Z","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-12T18:59:24.488511Z","title":"In: Proceedings of the 22nd international conference on World Wide Web, pp 413--422","venue":null,"work_id":"c635adea-01d5-4779-aa78-01b7549de43f","year":2013},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.783288Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:cefb82cc9b6bab3bfd1be858230594350fcb60d6114ca44b397582be1db88a9e","observation_id":"851132ee-3f4b-4bbc-bf14-6d0311f0057c","resolution":{"observed_at":"2026-08-12T18:59:24.492065Z","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-12T18:59:24.477840Z","title":"Science advances 2(2):e1500,445","venue":null,"work_id":"fae239ad-fb0e-424d-88f2-89b6eb52e5fb","year":2016},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.786703Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:ed52d895d3a82708f6814c78c23950e4e1bacc639b8dfeb8362d550ccaa48445","observation_id":"c6c8a008-f662-411c-8c64-302ff18d9bd0","resolution":{"observed_at":"2026-08-12T18:59:24.481791Z","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-12T18:59:24.467323Z","title":"Courier Corporation","venue":null,"work_id":"4ea95ed6-ec3c-470f-93cf-82aeaf408a91","year":2001},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.789933Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:1985f125f2feb8b9876ff0843c3bd90adb501b3313c36a002392a123e9bbbf9e","observation_id":"15566119-647c-4ec6-babf-72dc8a8be897","resolution":{"observed_at":"2026-08-12T18:59:24.470991Z","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-12T18:59:24.456111Z","title":"In: Proceedings of the ACM Web Conference 2023, pp 511--522","venue":null,"work_id":"19a463a0-f961-4034-a208-d1d5472a8364","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.793562Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c3373162874800aa6e78cc3e2fe34c9fab77afd26a35e3db9a412b883dcf8b81","observation_id":"93b933e7-122c-48c0-b930-6cf9683056c2","resolution":{"observed_at":"2026-08-12T18:59:24.459962Z","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-12T18:59:24.445109Z","title":"Journal of big data 7(1):94","venue":null,"work_id":"4f6b3948-e831-4deb-9f53-68d0638536aa","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.796802Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:a4c3510462c996cebda654125c4a12fbf76591a12f395d6184f1ea2ea0b9e0a4","observation_id":"de2bc3e5-0956-4ebf-9798-4430350da863","resolution":{"observed_at":"2026-08-12T18:59:24.448742Z","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-12T18:59:24.434127Z","title":"In: International Conference on Machine Learning, PMLR, pp 12,724--12,745","venue":null,"work_id":"1b5ee8c7-8635-47fb-a880-4fd30e935e05","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.800194Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:cd1a457ae0553710ecdad28fd071519b9a83d048513fc1c6f16c380717c99a51","observation_id":"b1a65e0f-8c58-4d48-93de-3c67194039fc","resolution":{"observed_at":"2026-08-12T18:59:24.438037Z","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-12T18:59:24.422672Z","title":"Elife 6:e26,726","venue":null,"work_id":"39899882-a0d1-439e-bad3-1b650b0906ad","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.803760Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:407b20555e39b350bd71832c7173c4f224b8be3674b9b37a0dc2d6df2f10a861","observation_id":"d7f38f65-321f-4edf-b94c-813373148c3c","resolution":{"observed_at":"2026-08-12T18:59:24.427159Z","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-12T18:59:24.411678Z","title":"IEEE Transactions on Neural Networks and Learning Systems","venue":null,"work_id":"8b7349d4-274a-4943-b376-0274331ed3b6","year":2021},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.807227Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:061272f9eee002dd5a5c8f89b939fb54dfdf469bce6129812e1d5c211875dea2","observation_id":"f9441184-375d-41c2-a816-955bb8495e90","resolution":{"observed_at":"2026-08-12T18:59:24.415561Z","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-12T18:59:24.401773Z","title":"Journal of complex networks 2(3):203--271","venue":null,"work_id":"bb12fe2e-6307-4794-94a2-bf4ba2a4fb63","year":2014},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.810385Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:826d55d926e8d417428eb334c252b74c85a90ec3282962fe07a7e083d092b0ed","observation_id":"bd3bb41c-064e-44bf-a9ea-d3210da5200e","resolution":{"observed_at":"2026-08-12T18:59:24.405383Z","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-12T18:59:24.391236Z","title":"SIAM review 51(3):455--500","venue":null,"work_id":"a3af6ed3-bedb-451f-8328-d27e4ab8e428","year":2009},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.814413Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:bff3725753b8f073627bdc1882a7ead8cdb3dc7f773b809dbe03836f2624309f","observation_id":"6845462b-2f18-4d7a-a516-9ffc02995add","resolution":{"observed_at":"2026-08-12T18:59:24.395052Z","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-12T18:59:24.380846Z","title":"In: Proceedings of the 2011 conference on empirical methods in natural language processing, pp 529--539","venue":null,"work_id":"9fd755db-2b75-4644-a8b2-d53c9a5e4971","year":2011},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.818113Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c0c36cd9f21b7565084193129edf9f4010d0b0190d16265fe0c639ccfc8704e6","observation_id":"48e385cf-43ae-41ec-8cf7-9d9f01d68d13","resolution":{"observed_at":"2026-08-12T18:59:24.384517Z","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-12T18:59:24.370096Z","title":"In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, IEEE, pp 1698--1706","venue":null,"work_id":"4c063c03-9efe-4e3c-99b0-7794d8994653","year":2014},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.821625Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:a080707a87257bfccf5d4073696ddd464a93f52ba66abfaaec3308be8a84727d","observation_id":"8fe3324f-86e8-4b85-8fbb-b28d8b33d6de","resolution":{"observed_at":"2026-08-12T18:59:24.374028Z","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-12T18:59:24.358878Z","title":"arXiv preprint arXiv:220506454","venue":null,"work_id":"b1d7d166-fb59-4597-825d-21d643a7bb8a","year":2022},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.825132Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:df7c0846a1e39008e42f7798e9943ed4f53cc776cd36b20d3097efa15d5c7628","observation_id":"4fced7d5-8a0e-44d0-88e4-0350835beefe","resolution":{"observed_at":"2026-08-12T18:59:24.362626Z","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-12T18:59:24.347297Z","title":"The VLDB Journal 33(1):131--161","venue":null,"work_id":"2edce02e-1a4c-4f34-aba9-96e39408d9a6","year":2024},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.829122Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:1b73ca2abe8f5ac3efa574e7dcb8fa8bb74e6e550dc8c25f15a2aa6272e476ed","observation_id":"1eabf49b-abef-4fa8-8215-7aff1ab1164f","resolution":{"observed_at":"2026-08-12T18:59:24.351482Z","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-12T18:59:24.336714Z","title":"In: International Conference on Machine Learning, PMLR, pp 24,737--24,755","venue":null,"work_id":"43a24172-4bea-4726-bd4e-b16e09d9c705","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.831990Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:0bc5fa0c0e1ffdafe6b39081d9b0d6e56104bfc8c1692befd3108c9420a0c708","observation_id":"93080aff-9ca4-4e88-8f67-0c9ff755ebe4","resolution":{"observed_at":"2026-08-12T18:59:24.340371Z","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-12T18:59:24.325646Z","title":"IEEE Robotics and Automation Letters 8(3):1531--1538","venue":null,"work_id":"ed45a7df-d3a9-4ee2-81a1-a2646c650f95","year":2023},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.835087Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:0f586316c2b727906fd08776dcf2bf44cb40f2265eecf8ad1341e5af8140f570","observation_id":"70d06f89-2478-48bb-ae28-ad225ba336a1","resolution":{"observed_at":"2026-08-12T18:59:24.329400Z","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-12T18:59:24.314246Z","title":"arXiv preprint arXiv:150406662","venue":null,"work_id":"d139f6b7-078a-4923-8278-0aad9379aabe","year":2015},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.838071Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:8be185427cfee805cbcc62001117c91c3fa6bec646cfe93d455ed4fd35962ebd","observation_id":"9ed722e7-290a-4fef-ad73-3115c1419eac","resolution":{"observed_at":"2026-08-12T18:59:24.318083Z","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-12T18:59:24.302417Z","title":"In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 2975--2982","venue":null,"work_id":"a0d290f9-3cd7-4f78-91f8-b5592769bef8","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.842226Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:79110b9adfb44f94e066087a6b65ef8d9c3fe7e09b687f86a13848eaecede49a","observation_id":"58217335-c65c-4ea0-965b-aa83c80e575b","resolution":{"observed_at":"2026-08-12T18:59:24.307530Z","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-12T18:59:24.290996Z","title":"arXiv preprint arXiv:201004029","venue":null,"work_id":"fd535542-e802-4220-bccf-057806b40c91","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.846145Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:98c467d705354b46ce309aea68d1ccb65ff62349c7776287482a88ae369aabf4","observation_id":"0b49a757-1579-4ae6-83cd-4e04a5fe0fe8","resolution":{"observed_at":"2026-08-12T18:59:24.294779Z","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-12T18:59:24.280589Z","title":"In: The Semantic Web--ISWC 2016: 15th International Semantic Web Conference, Kobe, Japan, October 17--21, 2016, Proceedings, Part II 15, Springer, pp 186--194","venue":null,"work_id":"9013ccce-601d-41f7-9422-41863dac5f3a","year":2016},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.850392Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:0a2e145bcbb8a5eed4e9a1c5e530e41c6ee1f4972f1de257d9b89a59e5c9ed41","observation_id":"4b782c2e-0008-4ba4-94d3-2db961ce4f8f","resolution":{"observed_at":"2026-08-12T18:59:24.284331Z","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-12T18:59:24.269389Z","title":"Advances in Neural Information Processing Systems 32","venue":null,"work_id":"bf0f8778-21dd-4c2a-8478-d20e6fba1b2e","year":2019},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.854978Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:ed86897f062135d8d2265323237692935a53e7388962836bb3d3012bfad6972d","observation_id":"0c47d788-39b3-4ee6-bfd8-60204ca9564c","resolution":{"observed_at":"2026-08-12T18:59:24.273071Z","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":"2009.07810","last_updated":"2020-10-06T09:10:10Z","snapshot_observed_at":"2026-08-13T19:24:44.750282Z","submitted_at":"2020-09-16T17:08:23Z","title":"CoDEx: A Comprehensive Knowledge Graph Completion Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.07810","snapshot_observed_at":"2026-08-12T18:59:23.858918Z","title":"2009.07810","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.858918Z"},"links":{"cited_paper":"/paper/2009.07810","citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:f05301089623ef65ec99b4421614e1ee764b67dc13775657cd69f4ec5ec6dc19","observation_id":"0ab557a8-b0fa-46df-99dd-cb3708a3cc94","resolution":{"observed_at":"2026-08-12T18:59:23.858918Z","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-12T18:59:24.258694Z","title":"arXiv preprint arXiv:200304078","venue":null,"work_id":"a55cded5-0cf6-447b-a979-1163f2114006","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.863222Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:813bc5f0617b76d97b2354b8284eac2a4ff2b8705a054c1b8c8ee3c5b1f89d62","observation_id":"2168a6e7-0344-41a6-9541-91cfe811b67e","resolution":{"observed_at":"2026-08-12T18:59:24.262318Z","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-12T18:59:24.248137Z","title":null,"venue":null,"work_id":"322a5d32-9a48-47b3-b339-75ba741fdfe6","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.867503Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:e834d50e36ec3cc76b721f1a6028fb2dc7057c144fa9f5327b0dd10e9661ac21","observation_id":"b47bbf90-b4c6-4e3b-9baa-078049c759b1","resolution":{"observed_at":"2026-08-12T18:59:24.251712Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:59:24.235781Z","title":"Frontiers in pharmacology 8:880","venue":null,"work_id":"ee4aceb8-4000-4d01-9417-522fa2738aad","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.871456Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:1467d67253353ed32fda1127c556ed79a39ddb14cd9c9b4ec3c96cec2b4959a3","observation_id":"7d93d5fc-ac79-4f8e-bc34-95f8a4cbf94b","resolution":{"observed_at":"2026-08-12T18:59:24.240400Z","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-12T18:59:24.223636Z","title":"Journal of Machine Learning Research 12(9)","venue":null,"work_id":"3a152bd9-f730-4b85-a342-06c3dc185a68","year":2011},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.875902Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:93ca1b4bc38756ad4784aeda09155ba7f34471be757e45ad3cebb823bd259e7a","observation_id":"600f85c6-a84a-4e0d-aef6-f4f522575ece","resolution":{"observed_at":"2026-08-12T18:59:24.227867Z","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-12T18:59:24.210798Z","title":"Combinatorial scientific computing 18","venue":null,"work_id":"ab0baa8a-8393-4b16-b597-ab38bcc0f1c4","year":2012},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.880054Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c32ba41b02a3a052de22b717faade1e70f025a4e4cc1aaef8cfd1706b50490a2","observation_id":"16a9fcb7-2aa8-4f9d-93f9-33474fe56ef1","resolution":{"observed_at":"2026-08-12T18:59:24.215361Z","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-12T18:59:24.199122Z","title":"Data Mining and Knowledge Discovery 36(2):620--667","venue":null,"work_id":"0467a947-d60d-4cc9-91a0-fa49deaa7a44","year":2022},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.883684Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:8e95bf42817058f3bd4db3c090044649444b1b198937f44ef8bdefa559701923","observation_id":"c6d2cef2-ad00-48ab-9716-fafb10644287","resolution":{"observed_at":"2026-08-12T18:59:24.202859Z","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-12T18:59:24.187931Z","title":"In: Proceedings of the 2015 conference on empirical methods in natural language processing, pp 1499--1509","venue":null,"work_id":"ed90ed99-8b7b-4b10-97bf-3ef1f1be502e","year":2015},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.887701Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:b26ce25d203b6bb4b805f14f7a619a32ebfcbee89c7830be02581c9f8cd29e03","observation_id":"82f06c1f-0fb5-4d56-9260-678cfa9930a7","resolution":{"observed_at":"2026-08-12T18:59:24.191614Z","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-12T18:59:24.175587Z","title":"In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp 1434--1444","venue":null,"work_id":"376d56f9-eb5c-4daa-9a6b-223e05b04d74","year":2016},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.891330Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:18546f066f19ca94a5bb7583cb13423b93f9f907987895237bc8cb13a0aedf04","observation_id":"cd6ce350-422b-422b-b4b5-d413a0170fad","resolution":{"observed_at":"2026-08-12T18:59:24.180498Z","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-12T18:59:24.162756Z","title":"In: SEPDA2019, the 4th International workshop on semantics-powered data mining and analytics, pp 1--6","venue":null,"work_id":"4f001ee4-9404-4498-af57-97075102ad69","year":2019},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.895064Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:9d75fe6cfbeabd4528a41b840d03e974cc7fb56ac1e447737ba714f169641dbd","observation_id":"6358a8c2-f6d5-458c-bcf3-bd0535159adc","resolution":{"observed_at":"2026-08-12T18:59:24.167045Z","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-12T18:59:23.898500Z","title":"arXiv preprint arXiv:171010903","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.898500Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:d6ee3553a3fe83914f16905ec3109a54d6eb7bf970ee0e11c3a69c2d26158f54","observation_id":"347a25c7-6548-495d-a978-0122e733313f","resolution":{"observed_at":"2026-08-12T18:59:23.898500Z","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-12T18:59:24.140128Z","title":"In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","venue":null,"work_id":"1a9da912-078d-40eb-b6ed-208a86f0e9a5","year":2021},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.901745Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:3406355e47c921e498da777cebee6b63d81fa368f1ad883f89c25647f8a5aa20","observation_id":"a6576464-87ae-4a1a-ab90-d5786e2bfb0a","resolution":{"observed_at":"2026-08-12T18:59:24.144242Z","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-12T18:59:24.129008Z","title":"IEEE Transactions on Knowledge and Data Engineering 29(12):2724--2743","venue":null,"work_id":"9f824882-f72e-4b4c-ac3a-d6d70529070d","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.905519Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:d2196dc123a9388c4b3a19d53af8ed2107255ef6e7fa6d505407bb0ba5f07a01","observation_id":"c82239a2-e3c4-4d59-a93e-75b6b2c979da","resolution":{"observed_at":"2026-08-12T18:59:24.132854Z","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-12T18:59:24.116673Z","title":null,"venue":null,"work_id":"44bcc965-644c-42f0-89bc-98f8bf70326e","year":2024},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.914124Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:e6baf4a14d1d2f1855c5f0c3f70a9a8d37201d05232ff57bf4a91f36ad8bed9a","observation_id":"8ccbe87e-cb01-4527-b70c-969c9d3dd3c4","resolution":{"observed_at":"2026-08-12T18:59:24.121164Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:59:24.101692Z","title":"arXiv preprint arXiv:170706690","venue":null,"work_id":"ce323270-4c22-4f1c-8749-f98e7b04edf6","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.918655Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:649345a9042e815891259deee31307affec83173a80765b4160ba7dc541bf5d4","observation_id":"3c563068-eb46-459d-b425-e910ad22d791","resolution":{"observed_at":"2026-08-12T18:59:24.107826Z","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-12T18:59:24.087771Z","title":null,"venue":null,"work_id":"a4147176-4018-4e8c-a874-213b39accd19","year":2018},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.922820Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:ccf5f3137a208b9d04ccdad57698f36b04671a40b05c1551e8f9fa36589dcca5","observation_id":"1a25cde3-df23-4101-a311-7b93362d0108","resolution":{"observed_at":"2026-08-12T18:59:24.091977Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:59:24.067637Z","title":"Advances in neural information processing systems 30","venue":null,"work_id":"74f36932-5c89-4a89-9670-48bcd7d85fd7","year":2017},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.926365Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:748fc9a6f344f0f6169c68d847b05d2f23b974b4bb5ede0276e8c5a40a639c18","observation_id":"6edca134-c008-4df2-9729-bb6754e010b7","resolution":{"observed_at":"2026-08-12T18:59:24.074741Z","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-12T18:59:24.052975Z","title":"In: Proceedings of the ACM web conference 2022, pp 912--924","venue":null,"work_id":"a14eb979-5a9f-42fd-96e9-d8de2737547e","year":2022},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.930875Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:1057e0171d38929bd965b822bae91d4d946a727dd3b3ca5ec8d49f030895fbdf","observation_id":"0997aa52-2a75-411a-9cf7-306d1dd6e8f9","resolution":{"observed_at":"2026-08-12T18:59:24.056581Z","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-12T18:59:24.040593Z","title":"AI Open 1:57--81","venue":null,"work_id":"ae3354ee-4843-4384-bc2b-8288b889bfc6","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.934657Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:981e1cd1e11e900c4d880808fbba7c17fcd99825c9214194e6238c3e00eb7335","observation_id":"aeacdea6-513b-46ad-9979-72469f554bfb","resolution":{"observed_at":"2026-08-12T18:59:24.044537Z","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-12T18:59:24.026230Z","title":"Advances in Neural Information Processing Systems 36","venue":null,"work_id":"96c66673-8b4c-46bd-9018-bb5c40a8b1de","year":2024},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.938141Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:d6b7fb1929eb119eff57d8c1180852b75522b2c3d132a819b8f4acb99cd1d1f2","observation_id":"f4816f3a-3a6f-4919-b534-5c6ad6e757d9","resolution":{"observed_at":"2026-08-12T18:59:24.031484Z","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-12T18:59:24.011047Z","title":"In: Journal of Physics: Conference Series, IOP Publishing, p 012016","venue":null,"work_id":"433cc660-5bea-4eb0-9c07-4b6eb89c7133","year":2020},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.941990Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:55b4204752d42fffbc64b49d0c4fef3ac63d5c0886f2f38c70055245d6f36e75","observation_id":"d7e61e5a-a2b2-4e02-af8d-392b6929d4cd","resolution":{"observed_at":"2026-08-12T18:59:24.017325Z","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-12T18:59:23.945471Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.945471Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:dddc585c9ffa23e29b6c68eb2ae185b3cd227b46a828d06be715219b9a6b6675","observation_id":"3558c1bf-a48a-4b2a-9dae-78612827e629","resolution":{"observed_at":"2026-08-12T18:59:23.945471Z","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-12T18:59:23.949520Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T18:59:23.949520Z"},"links":{"citing_paper":"/paper/2411.11149"},"observation_digest":"sha256:c0dda0aaf9d7e920aa331fd52fc3e568289c444b0709c25fade4c7fe0b2b4c6a","observation_id":"5c01fdd9-d9a3-4dc7-8440-a26bcb40e597","resolution":{"observed_at":"2026-08-12T18:59:23.949520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.11149","last_updated":"2024-11-17T18:43:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T18:22:18.181682Z","submitted_at":"2024-11-17T18:43:01Z","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":54},"total_outbound_references":62},"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 62 of 62 outbound references and 0 inbound Pith citation observations for arXiv:2411.11149."}