{"as_of":"2026-08-21T10:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4247395e06cd71e716280a523353eb79b06111feefb4d029df6884db6f839ebb","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:42:24.653298Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T05:00:02.957536Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-10T12:15:01.137692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2502.07496","doi":"10.48550/arxiv.2502.07496","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.07496","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"Exploring","venue":null,"work_id":"ef365cda-819a-460d-8e80-655961d7fbbc","year":2025},"citing_paper":{"arxiv_id":"2605.11873","last_updated":"2026-05-12T09:51:59Z","snapshot_observed_at":"2026-08-17T11:11:48.016918Z","submitted_at":"2026-05-12T09:51:59Z","title":"Maximizing Reachability via Shifting of Temporal Paths","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-13T05:00:02.957536Z"},"links":{"cited_paper":"/paper/2502.07496","citing_paper":"/paper/2605.11873"},"observation_digest":"sha256:85b9c1606431d3e16eef6774f6bdb2db250fa7e063b81a8cc5891a646c7a0a89","observation_id":"c3bab33b-4e81-4299-ae0c-428501174443","resolution":{"observed_at":"2026-05-13T05:02:17.399878Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.07496/citation-record","integrity":"/paper/2502.07496/integrity","json":"/paper/2502.07496/citation-record.json","paper":"/paper/2502.07496"},"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-08T12:42:25.105239Z","title":"Faster exploration of some temporal graphs","venue":null,"work_id":"c9087720-9be3-4c79-ab6d-f3a132ba9dd4","year":2022},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.555686Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:1c8cc3009890212cf2b5ed1800c8c0185e663d78b65bab9eacd46d17be5f4cb6","observation_id":"e6d1602c-7a20-4c0a-bf52-6d16a565e680","resolution":{"observed_at":"2026-08-08T12:42:25.110438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10110","last_updated":"2023-02-20T17:14:06Z","snapshot_observed_at":"2026-08-20T16:45:30.538553Z","submitted_at":"2023-02-20T17:14:06Z","title":"Kernelizing Temporal Exploration Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.10110","snapshot_observed_at":"2026-08-08T12:42:24.560163Z","title":"Kernelizing temporal exploration problems","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.560163Z"},"links":{"cited_paper":"/paper/2302.10110","citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:c53b5fe79ff3a1c6c0d7b84ce01ac55288a7e608440be76541624a6275f511fc","observation_id":"0c67e65f-94f7-40e2-952e-60b13151c7bb","resolution":{"observed_at":"2026-08-08T12:42:24.560163Z","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-08T12:42:25.091827Z","title":"New results on word-representable graphs","venue":null,"work_id":"5389c0c6-806b-4330-a5db-1adfdf8832b2","year":2017},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.564564Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:478690bdb0583aa09ce1fbe76b01dd6df55961e0daa767d6adef3112b5d03b76","observation_id":"e78a8022-7885-4315-9a3d-6ae7f38962d1","resolution":{"observed_at":"2026-08-08T12:42:25.095784Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jal.2007.05.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Circle graphs and monadic second-order logic","venue":"Journal of Applied Logic","work_id":"eabe5cc4-d0d2-4c7f-a04c-589dd171cb23","year":2008},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.568615Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:e4c0d172b3c3b8f7bb0256864cfcb59385f8f7078a5060b3774c613e174513a8","observation_id":"c51fcdc2-f10f-4149-94db-47a0f9737b6a","resolution":{"observed_at":"2026-08-08T12:42:24.733186Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:25.077806Z","title":"Optimizing reachability sets in temporal graphs by delaying","venue":null,"work_id":"dce58cf6-2165-4da8-bdfe-d7202132991a","year":2022},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.573738Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:e18f95885ca933bcd8bee217eb0022a310a82075d76ccb5535a6901555488355","observation_id":"e0d72bc5-a5db-47f5-90b9-82a4405e7ebf","resolution":{"observed_at":"2026-08-08T12:42:25.082459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07140","last_updated":"2024-07-18T07:48:03Z","snapshot_observed_at":"2026-08-20T19:12:12.871089Z","submitted_at":"2023-12-12T10:23:03Z","title":"Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.07140","snapshot_observed_at":"2026-08-08T12:42:24.578691Z","title":"Exploiting automorphisms of temporal graphs for fast exploration and rendezvous","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.578691Z"},"links":{"cited_paper":"/paper/2312.07140","citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:5ad40c85cdbed08e7c8e8d9a8911b7fee2519b3eb48262f992a4945c2c2f7773","observation_id":"f83dde3e-fd96-4560-a89e-fabdeabf9c4b","resolution":{"observed_at":"2026-08-08T12:42:24.578691Z","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-08T12:42:25.064070Z","title":"Deleting edges to restrict the size of an epidemic in temporal networks","venue":null,"work_id":"13811586-aee5-48bf-9d55-874798d1f0b8","year":2021},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.584300Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:e0f5da8a729694e72ac9a47ea565d3e6d98ebee70a9fa5b4ea4a08fa80409f16","observation_id":"aec9d322-1070-492e-bb4e-b99be845e5bd","resolution":{"observed_at":"2026-08-08T12:42:25.068652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:25.050117Z","title":"On temporal graph exploration","venue":null,"work_id":"5121ec0c-bd2d-42b8-93d3-c061ffc74a7d","year":2021},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.588785Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:92ba10ffb4d8c3480872f2e2592d71c4947fcdfe279979577297f08951a36d52","observation_id":"61911ab9-b83a-42f1-beff-b7b8775ff5f5","resolution":{"observed_at":"2026-08-08T12:42:25.054496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:25.035371Z","title":"Two moves per time step make a difference","venue":null,"work_id":"678d5304-4b35-41fe-bce8-ab8985351ce1","year":2019},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.593509Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:4f9772dc96ae77c53511833ad232cd9faa0ee7a0c6fc04f2222b20157c07f461","observation_id":"bd7441fc-d017-4515-9d2f-7b57594c9e0c","resolution":{"observed_at":"2026-08-08T12:42:25.040018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:25.020388Z","title":null,"venue":null,"work_id":"bba947d1-ebf5-469b-af2f-ec2bda2c0c3a","year":2021},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.597807Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:6612caef3bfa61f50fc41184e6db6adb266c8fe3fee6b4905dcaab7eaf2586a8","observation_id":"f960ebee-f04e-4ffb-8c56-dca279135abd","resolution":{"observed_at":"2026-08-08T12:42:25.025221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:25.006357Z","title":"Parameterised temporal exploration problems","venue":null,"work_id":"111a4809-76f3-4553-b1eb-1f0317c9c1cf","year":2023},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.602010Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:97562f6279cdfb75419c0188ec9060d2a3b26fd70a606f293880f5f530b0fa1e","observation_id":"b311efd8-1a77-4ae0-b0aa-2929acf90bdd","resolution":{"observed_at":"2026-08-08T12:42:25.010752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03274","last_updated":"2024-11-05T17:17:30Z","snapshot_observed_at":"2026-08-16T13:02:41.482939Z","submitted_at":"2024-11-05T17:17:30Z","title":"Generalized Word-Representable Graphs","version":1},"cited_work":{"arxiv_id":"2411.03274","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.03274","snapshot_observed_at":"2026-08-08T12:42:24.747840Z","title":"Generalized Word-Representable Graphs","venue":"cs.DM","work_id":"c9f46216-d101-4575-b645-fa6c20cfa667","year":2024},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.606506Z"},"links":{"cited_paper":"/paper/2411.03274","citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:c78d7aaab03d6de765b72694c72291ccac853712372fe53f66e411966387b1d2","observation_id":"c0ef385e-8d65-4885-a088-780ded0767d6","resolution":{"observed_at":"2026-08-08T12:42:24.753022Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00236-024-00462-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Word-representable graphs from a word's perspective","venue":"Acta Informatica","work_id":"552ebd38-6f50-458e-8e66-4169a7dd17be","year":2024},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.611407Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:c34c23fa9811d311aa20211eac81970de932a800ed970ce78ff26393786c5453","observation_id":"a017cbf6-8ab0-449c-92c3-4a84fca88fd4","resolution":{"observed_at":"2026-08-08T12:42:24.718575Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.992200Z","title":"Enumeration and extensions of word-representants","venue":null,"work_id":"85c02b1c-23e4-4e66-862e-b39b1cc21bfe","year":2020},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.615857Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:2030502a8fce22001d743a20daf62f0bbd0b780b12a66f5c22e66bba8ce15a63","observation_id":"13c66ec2-f54c-4f99-bebd-344fa9512300","resolution":{"observed_at":"2026-08-08T12:42:24.996808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.977810Z","title":"On the representation number of a crown graph","venue":null,"work_id":"cf6f720c-150a-4cbf-9c56-9fe7f63fc67a","year":2018},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.620126Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:f0b67f70558b70e501c17d512524343c5c146bed0939c1f3ce6e48f25aaa95a9","observation_id":"b4ba0a91-8702-4784-8a2b-3564a0953266","resolution":{"observed_at":"2026-08-08T12:42:24.982448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.963575Z","title":"Alternation graphs","venue":null,"work_id":"f6ca4ce3-4f43-45b2-ad50-e9543b442883","year":2011},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.624363Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:37d9cb25e39da7130d025feb69b0d1835d30e80313a9bb1d3cad040e285fc832","observation_id":"bf6686f4-09cb-4a26-bdd0-ac1275b8a3f8","resolution":{"observed_at":"2026-08-08T12:42:24.968094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2015.07.033","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Halldórsson, Sergey Kitaev, and Artem Pyatkin","venue":"Discrete Applied Mathematics","work_id":"6dd1aa5b-944e-4782-9796-87a535defe6c","year":2016},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.628600Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:29f900deada19f8ed49f1d6a042285eb93a2326d55a2baf9c445d997cdaa1634","observation_id":"df282585-b929-4366-a441-985d5f111ce7","resolution":{"observed_at":"2026-08-08T12:42:24.704289Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.949099Z","title":"A comprehensive introduction to the theory of word-representable graphs","venue":null,"work_id":"b090c4eb-024a-46c7-8273-27e46882847f","year":2017},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.632877Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:2b86a081531deb72b00aba398fe918c0adeef103ea2b414518967e2bed4f7d0a","observation_id":"60a6d37a-17a2-4d60-bb4f-30bb4b4cc10e","resolution":{"observed_at":"2026-08-08T12:42:24.953759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.637244Z","title":"Words and graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.637244Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:c54412194db9e3099736a846b05557896ab6ad4f399c935038dda832b9d7678d","observation_id":"5ba3f826-d7c8-4207-9ad5-54a52bb3832a","resolution":{"observed_at":"2026-08-08T12:42:24.637244Z","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":"10.25596/jalc-2008-045","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"On representable graphs","venue":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","work_id":"0e5920e9-4515-4199-ba0b-e450aa36f90d","year":2008},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.641365Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:2dc55592c96fb2baba8ebf8686f21beb2df968e67384d1c869c183b7b0915bdc","observation_id":"d5b248f2-0cef-4336-8faf-774d4679c836","resolution":{"observed_at":"2026-08-08T12:42:24.688468Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.817614Z","title":"Reducing reachability in temporal graphs: Towards a more realistic model of real-world spreading processes","venue":null,"work_id":"65fd771c-7143-4ecd-bd6d-b3122e601ece","year":2022},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.645497Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:c3f850f5e8e4862442fc515585a0b9a3feb630817ab7638d972b4d059b5ed05e","observation_id":"3e5d91d2-d196-4f75-b1eb-306fa44616d3","resolution":{"observed_at":"2026-08-08T12:42:24.822282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-08T12:42:24.649177Z","title":"Traveling salesman problems in temporal graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.649177Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:bbadac2f7ee3debbab0319c4d297c8b5bd502df4e89c91bb83464d2cd70ec0e9","observation_id":"a22d649b-6796-4d97-8ead-d3b5fbfc84d3","resolution":{"observed_at":"2026-08-08T12:42:24.649177Z","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-08T12:42:24.792729Z","title":"Minimum length word-representants of word-representable graphs","venue":null,"work_id":"8f63ad0c-59dd-436d-89f4-131c067388d5","year":2024},"citing_paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T12:42:24.653298Z"},"links":{"citing_paper":"/paper/2502.07496"},"observation_digest":"sha256:1e3708ebc7a7a0d6dfc0455675637bf595fb2dc570bbffd069189360477606e8","observation_id":"8c7a7f08-34c4-4a96-8b34-131fa819b858","resolution":{"observed_at":"2026-08-08T12:42:24.797346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.07496","last_updated":"2025-02-11T11:58:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T12:30:29.612020Z","submitted_at":"2025-02-11T11:58:37Z","title":"Exploring Word-Representable Temporal Graphs"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":5,"verified_fuzzy":13},"total_outbound_references":23},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2502.07496."}