{"as_of":"2026-08-13T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4b0d6736815b607021a8a02a31b271b662143a047dd75b537bb750855f627b3","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T13:12:26.858249Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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.16547/citation-record","integrity":"/paper/2411.16547/integrity","json":"/paper/2411.16547/citation-record.json","paper":"/paper/2411.16547"},"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-12T13:12:27.165240Z","title":"N.: Complexes of graph homomorphisms","venue":null,"work_id":"27f2af2c-12d4-41d0-9087-f0c2566349ac","year":2006},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.771007Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:a5967230930fd3b7ca7861b19db4cd4e921e880103a3147278e70537c9cd871f","observation_id":"0f60c5d9-d6fc-4a54-bdc6-b5f84c7325b0","resolution":{"observed_at":"2026-08-12T13:12:27.170746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.149551Z","title":"F.: Topología del problema de migración de datos","venue":null,"work_id":"fe8e1610-ef3f-41bf-b7cb-f391bb889004","year":2023},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.778744Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:9ccf34b79b9fd1e4f9ce5d951c9d5a9e0160104fa9a9b1906d0bf6bab49bff2a","observation_id":"e443d017-8e43-4904-848e-7fa14e2c06ea","resolution":{"observed_at":"2026-08-12T13:12:27.155026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.132618Z","title":"W., & Pósa, L.: The representation of a graph by set intersections","venue":null,"work_id":"e2d8251d-9a38-43d0-aedd-76b8f587ad5b","year":1966},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.783981Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:11dd50daae703e3eed2749ca132281d059ab333ccafe8ff1979b4b9cc8068127","observation_id":"69a0b15d-1dcc-4f46-9b5e-72d2e5ce644d","resolution":{"observed_at":"2026-08-12T13:12:27.138425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.117709Z","title":"C., & Hammer, P","venue":null,"work_id":"91a609cf-1c20-44bc-aefa-5da8ef6f8149","year":1996},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.789833Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:2a988ee3c65e7dd061783fbed94b05d92f7c3e68584da5b8e222232a4d020f91","observation_id":"8e81a729-1f1e-43ac-b967-50a49f22f6b7","resolution":{"observed_at":"2026-08-12T13:12:27.122691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.097957Z","title":"A., & Pullman, N","venue":null,"work_id":"369e991a-e4c0-48f1-ab3e-88a60102ce95","year":1982},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.795407Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:e68567abdb53aa06e022a74ffe4f16b894f253cb86fa7c2813b26386226fabc4","observation_id":"17338c25-9057-4443-a817-ae9eebdacfff","resolution":{"observed_at":"2026-08-12T13:12:27.104053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.083002Z","title":null,"venue":null,"work_id":"6ca274d0-3f0e-4e44-8a24-9405edab8e83","year":1990},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.800837Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:1b63f7f521c152312a1f61d1deab2a3fcc4e61a07ec9c3c9cc08952590a8472d","observation_id":"0abd495a-ba01-491d-96f6-9247fe3c3261","resolution":{"observed_at":"2026-08-12T13:12:27.087737Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.067166Z","title":"Annals of the New York Academy of Sciences, 175(1), 198-205 (1970)","venue":null,"work_id":"ec296471-7ac7-44a5-bc44-08099fe5f03c","year":1970},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.806360Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:a3af5e836165d48149ccebda87a03da4eba83952697acb1865839f7f36ceace0","observation_id":"1ed47f62-a4bb-4884-a44b-e42a875d6bb2","resolution":{"observed_at":"2026-08-12T13:12:27.072757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.052018Z","title":"Journal of Graph Theory, 1(2), 131-133 (1977)","venue":null,"work_id":"9f5ea259-99ff-40a1-9748-b8566d9748e1","year":1977},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.810959Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:1c4e6f4b68bc97cf54357e26e33cffa59ca628f33730c74a938ba275a8a0af3b","observation_id":"ed421546-3c2c-432d-b8e8-8f8aa6e7ea4e","resolution":{"observed_at":"2026-08-12T13:12:27.056820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.036685Z","title":"Journal of Combinatorial Theory, Series B, 48(1), 92-110 (1990)","venue":null,"work_id":"e2583a4a-cc98-4727-94a1-47b2b4a8157e","year":1990},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.815738Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:f8fd9f601e7761b803813616a9f505d1b053debaf42670b706ef139e57e9420a","observation_id":"a9552a15-3a02-4e90-93ba-5fe55a7bb29e","resolution":{"observed_at":"2026-08-12T13:12:27.041619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.019911Z","title":"Graphs and homomorphisms (Vol","venue":null,"work_id":"0a8dea53-7e85-4b45-a885-3dd0456a51bd","year":2004},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.820327Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:238dc721b6c6f237cee67df641f477999df260f7ec5a6c55b2f27e8ce975194e","observation_id":"5f246755-8413-41dc-9de0-3c4ea4a4fd4e","resolution":{"observed_at":"2026-08-12T13:12:27.025887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:27.004249Z","title":"A.: Data migration: Need, strategy, challenges, methodology, categories, risks, uses with cloud computing, and improvements using suggested proposed Model (DMig1)","venue":null,"work_id":"6c32323e-d8b9-450c-9990-7a1ec4a48b05","year":2021},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.824834Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:f525e3a86706c18d7ba7eb04ec982d2579b0775eac489e664caf61b7e957b188","observation_id":"ac560290-beb7-4f04-945f-747079ca7552","resolution":{"observed_at":"2026-08-12T13:12:27.009626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.988602Z","title":"Journal of Combina- torial Theory, Series A, 25(3), 319-324 (1978)","venue":null,"work_id":"bb9d5429-bb95-4dd4-aae3-a8a6bfbf18c4","year":1978},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.829612Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:570bee423ac03d75273b312c9164d169622a9dcd56125c7bb0bbaaa2c4388bd2","observation_id":"42211904-4339-4f5c-9db9-6217248ba8f0","resolution":{"observed_at":"2026-08-12T13:12:26.994020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.971769Z","title":"In Indagationes Mathematicae (Proceedings) (Vol","venue":null,"work_id":"d7a3756d-ffb0-4528-96b4-2f8337b1a438","year":1977},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.834156Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:f825444c5f54d5ba80db362bdc6a34b5757e27d5d8f1b6a132ae1cf2e58800b9","observation_id":"aa335248-5d29-4819-86ac-0e5e316a3bd6","resolution":{"observed_at":"2026-08-12T13:12:26.977045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.955834Z","title":"Discrete Mathematics, 345(8), 112884 (2022)","venue":null,"work_id":"34d69d36-8834-4c62-9d30-4a0f368eee78","year":2022},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.839457Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:fe3f204c95245886443d971ac4e3e2e170d28792f9b4c18a35d6a398cab12179","observation_id":"b1f1e945-1f7a-4478-b1a5-a0ef8a1f8cd7","resolution":{"observed_at":"2026-08-12T13:12:26.960744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.940572Z","title":"I.: Functorial data migration","venue":null,"work_id":"5f933b90-45a1-42ea-9f31-51a3051f7dee","year":2012},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.844355Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:7a027687c97f6683584f81f0927eeee5286be49fc993648ad0843ba6819701cc","observation_id":"c14d821e-5706-4446-8a7c-d9510716deee","resolution":{"observed_at":"2026-08-12T13:12:26.945457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.925079Z","title":"B.: Introduction to graph theory (Vol","venue":null,"work_id":"2ae1c01d-6cb8-4291-ab68-5f566929cbad","year":2001},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.848917Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:aee710f7be5ed1d7cee2f79c2e4b3d4e275dbda471cd337509439ca97fee9ca2","observation_id":"4a58eb1d-bfdf-480d-9bd6-7fd2856bfe42","resolution":{"observed_at":"2026-08-12T13:12:26.930000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.907869Z","title":null,"venue":null,"work_id":"849c787b-5520-44ab-b166-33256724c0a6","year":2023},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.853559Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:bce46b3b20295ab3497c6f2dff52f492aa9e0145bc050a5d2ea90e162225c3ab","observation_id":"a30839cd-b344-481d-9e80-d35bb4bb2b04","resolution":{"observed_at":"2026-08-12T13:12:26.913715Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T13:12:26.889815Z","title":"H., Imrich, W., & Klavžar, S.: Handbook of product graphs (Vol","venue":null,"work_id":"6065a1f8-78c3-4ae1-9d5c-5f0eb5c53577","year":2011},"citing_paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T13:12:26.858249Z"},"links":{"citing_paper":"/paper/2411.16547"},"observation_digest":"sha256:42080666e2ad93d73858a441993c441b2f8ccbdb1b3350b5ca798ce143bc0538","observation_id":"025731c7-97cc-41c3-be22-0f85d3f9acc4","resolution":{"observed_at":"2026-08-12T13:12:26.896621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16547","last_updated":"2025-07-04T01:11:31Z","latest_version":3,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T12:57:15.797370Z","submitted_at":"2024-11-25T16:31:17Z","title":"(Injective) hom-complexity between graphs"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":18},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2411.16547."}