Pith. sign in

Paper Citation Record · LEDGER

Exploring Temporal Graphs with Frequent and Regular Edges

As of 20 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2505.14046.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.14046 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:44:31.518204Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-05-13T05:00:02.957536Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

25 of 25 outbound references displayed

  • verified exact6
  • verified fuzzy19
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

Observation a79fa560-860b-401c-83a8-02a586e91ccd · outbound

This paper cites Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:33.888599Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:28.905413Z digest=sha256:5a7de18e7f94f90bdffb7f8ba343a01923e56c19ae11d814857c6ee303793a9f

Observation 7994b7df-0567-494f-b5a2-069de403bb46 · outbound

This paper cites Multi-species temporal network of livestock movements for disease spread.Applied Network Science, 2021.6:1–20.

Exploring Temporal Graphs with Frequent and Regular Edges Multi-species temporal network of livestock movements for disease spread.Applied Network Science, 2021.6:1–20

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:39.902068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:28.992424Z digest=sha256:e4ea407b006a020e347e00d89ab20413910e170e4502f5d2f7f1755d724cead4

Observation a3b37e93-3aef-4108-a486-34e37548c49d · outbound

This paper cites Traveling salesman problems in temporal graphs.Theoretical Computer Science, 2016.634:1–23.

Exploring Temporal Graphs with Frequent and Regular Edges Traveling salesman problems in temporal graphs.Theoretical Computer Science, 2016.634:1–23

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:39.614605Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.092315Z digest=sha256:674ca85b969cceb9ea5bd8933ac479b9f3f52b7b9135936a8ea321848f9165d7

Observation f00db556-4924-4053-9858-f672d10c4a7a · outbound

This paper cites Optimizing reachability sets in temporal graphs by delaying.Inf.

Exploring Temporal Graphs with Frequent and Regular Edges Optimizing reachability sets in temporal graphs by delaying.Inf

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:39.419803Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.245000Z digest=sha256:35aea01795e9d0dd5ff2fde29875636d39c0c0e0905a40ece18ba12c1e16b905

Observation 1577d3d2-8d9f-4db7-b75f-af85ec506ebd · outbound

This paper cites Deleting edges to restrict the size of an epidemic in temporal networks.Journal of Computer and System Sciences, 2021.119:60–77.

Exploring Temporal Graphs with Frequent and Regular Edges Deleting edges to restrict the size of an epidemic in temporal networks.Journal of Computer and System Sciences, 2021.119:60–77

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:39.185090Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.354958Z digest=sha256:7283e953e2b9f402d979ef604f95c0b0e2acc1d9a626169928b0a2b2289fdb3f

Observation e789a86f-ddb3-4002-9c53-8ac54184b56a · outbound

This paper cites Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes.

Exploring Temporal Graphs with Frequent and Regular Edges Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:38.811236Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.464861Z digest=sha256:fddd4c4eb091a1409addcc788fb5aa29bbfad9879449d0b366768d4fc1756c0e

Observation 3d84d3cf-ef12-4cbc-8daa-8b493b509d65 · outbound

This paper cites Faster Exploration of Some Temporal Graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Faster Exploration of Some Temporal Graphs

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:38.454733Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.558145Z digest=sha256:fb5300e02c12e047be33e6d83cbd55eca0f106710d76376cdd1f9117f3ae1c1c

Observation be0a2abd-91c8-4bb0-8fd0-5979caf87ef1 · outbound

This paper cites Kernelizing Temporal Exploration Problems.

Exploring Temporal Graphs with Frequent and Regular Edges Kernelizing Temporal Exploration Problems

Reference 8

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:33.544749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.685009Z digest=sha256:9b544a441561e37276cbd10dd1d2cd0726f4113f5da596e8a4d56125924d558a

Observation 97e0c8e7-2942-4193-8f0f-c5e9e19d7f47 · outbound

This paper cites Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.

Exploring Temporal Graphs with Frequent and Regular Edges Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous

Reference 9

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:33.042417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.774934Z digest=sha256:47775aa434068481d6612f62f7d12ec901d73d41e5a09da0acdca826081a9dbb

Observation 0c3669cf-6feb-471c-bfb4-1f11ed243570 · outbound

This paper cites On temporal graph exploration.Journal of Computer and System Sciences, 2021.119:1–18.

Exploring Temporal Graphs with Frequent and Regular Edges On temporal graph exploration.Journal of Computer and System Sciences, 2021.119:1–18

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:37.674124Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:29.904889Z digest=sha256:3e628da433b9dc999964a6390caafcef364fb82221576737df5c5d088d314996

Observation 6713425f-1920-4223-9195-f678125e87dd · outbound

This paper cites Two moves per time step make a difference.

Exploring Temporal Graphs with Frequent and Regular Edges Two moves per time step make a difference

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:37.357192Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.017905Z digest=sha256:54ae069ca929582123cf21a4dfad0450ed825945146b6bc278ff6b2a0ba5e2b5

Observation 5498e8fb-3abe-4cf7-be61-5497800b909d · outbound

This paper cites Exploration ofk-Edge-Deficient Temporal Graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Exploration ofk-Edge-Deficient Temporal Graphs

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:37.034327Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.152830Z digest=sha256:fc0609b6ea4b47db1e6f8305bbe0c9b9676f2f53a1ce0e2f65542c423f46471f

Observation b3c01d64-521c-4872-a10e-6f342f951d34 · outbound

This paper cites Parameterised temporal exploration problems.Journal of Computer and System Sciences, 2023.135:73–88.

Exploring Temporal Graphs with Frequent and Regular Edges Parameterised temporal exploration problems.Journal of Computer and System Sciences, 2023.135:73–88

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:36.823309Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.254770Z digest=sha256:23e9e8a905bc30aeca9433b1c7000bbe044118b894cc5c98e91ea1a262e97349

Observation 509a634b-d7f5-4e7a-8c82-db2123e938d6 · outbound

This paper cites On exploring always-connected temporal graphs of small pathwidth.

Exploring Temporal Graphs with Frequent and Regular Edges On exploring always-connected temporal graphs of small pathwidth

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:36.484812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.364748Z digest=sha256:05b43f3c773561fc83e283a26866ddcd3fbbcad37e3f2a6c473f0ba3296e0c44

Observation 65e534a7-8c38-42cc-9394-d2c96a762bf0 · outbound

This paper cites The temporal explorer who returns to the base.

Exploring Temporal Graphs with Frequent and Regular Edges The temporal explorer who returns to the base

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:36.174745Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.450878Z digest=sha256:541e5395e962c18735b6de92c550a26c4bb21f5038b1899833ad708b1af917ce

Observation 70e901bd-6bb6-482a-99e0-c7c0a87cf77d · outbound

This paper cites Exploring temporal cycles and grids.

Exploring Temporal Graphs with Frequent and Regular Edges Exploring temporal cycles and grids

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:35.895478Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.575448Z digest=sha256:fe4e3d32dcdd07fbeff5fec1513811dc4ea49b89b55e8b913e6ddab823ef2661

Observation 1f3bc127-cc9a-4c9f-9c54-30d0d94f1772 · outbound

This paper cites Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:35.621601Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.665867Z digest=sha256:62127519a86ae0b724e3b4ba1a7494a8f33383c0172cde1e4c305408cd7db849

Observation eb0b44d4-7ce4-4c87-b364-dfe4f75f1bab · outbound

This paper cites Parameterized Algorithms for Multi-Label Periodic Temporal Graph Re- alization.

Exploring Temporal Graphs with Frequent and Regular Edges Parameterized Algorithms for Multi-Label Periodic Temporal Graph Re- alization

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:35.390502Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.756137Z digest=sha256:148c96e26506ad3cbd818ff5b80f8ae5b57dae0aa04ba8716e905a5b720a58a5

Observation 943860ff-9532-4b5b-af3c-9f6e6a8a6c87 · outbound

This paper cites Realizing temporal transportation trees.

Exploring Temporal Graphs with Frequent and Regular Edges Realizing temporal transportation trees

Reference 19

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:32.535581Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.831533Z digest=sha256:6dd615358c012aacf01dd8c528ef65689e21578d04611454b515064ef28fd3a6

Observation 810d3912-9854-4bea-a97a-c374e3fc5e3c · outbound

This paper cites Temporal Graph Realization With Bounded Stretch.

Exploring Temporal Graphs with Frequent and Regular Edges Temporal Graph Realization With Bounded Stretch

Reference 20

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:32.225102Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:30.994957Z digest=sha256:b8887be2efc4473eeea69a90dc036caa66a2b1a6ef2663ad5c1f30a8aca7f860

Observation a1678bb7-1f08-40cf-a7eb-1fa8bd2e0f42 · outbound

This paper cites Cop numbers of periodic graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Cop numbers of periodic graphs

Reference 21

Resolution
verified exact
local_arxiv, observed 2026-08-07T15:44:31.914882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:31.106768Z digest=sha256:92344c945375bdde11a8f66a51a264867646aa931af16f031053e8888677ce8b

Observation f42cc6f9-c331-40e7-acb1-46e2276ad1e9 · outbound

This paper cites A cop and robber game on edge-periodic temporal graphs.

Exploring Temporal Graphs with Frequent and Regular Edges A cop and robber game on edge-periodic temporal graphs

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:35.094032Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:31.222436Z digest=sha256:263054dd16b629ea273d008784dc24e2a8b8ac59243827922e7b4ba0b5ef4773

Observation 721795c2-dccc-45f1-85af-f330d948d14d · outbound

This paper cites Restless Exploration of Periodic Temporal Graphs.

Exploring Temporal Graphs with Frequent and Regular Edges Restless Exploration of Periodic Temporal Graphs

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:34.757353Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:31.354892Z digest=sha256:fae240f8d1db89df5c9ef4d7731ba4f29fd5c86675597e03914202cc79d94db5

Observation f6b2d917-f7cb-4dd9-83ab-a828a45a08d4 · outbound

This paper cites On the shortest spanning subtree of a graph and the traveling salesman problem.Proceedings of the American Mathematical society, 1956.7(1):48–50.

Exploring Temporal Graphs with Frequent and Regular Edges On the shortest spanning subtree of a graph and the traveling salesman problem.Proceedings of the American Mathematical society, 1956.7(1):48–50

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:34.455088Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:31.447485Z digest=sha256:73c8c90c5788ffd424f175f8e024da9dc01c519102f7d1ab2dae585bb903d9b6

Observation 975b4195-f498-4827-a539-6fe595a17037 · outbound

This paper cites Deterministic Subgraph Detection in Broadcast CONGEST.

Exploring Temporal Graphs with Frequent and Regular Edges Deterministic Subgraph Detection in Broadcast CONGEST

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T15:44:34.165849Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-07T15:44:31.518204Z digest=sha256:940579e3ffe117519e7c1c3b1f4c05671eb909911299818c9f711fa0ad115cd9

Pith citing papers

Observation 23da5058-5792-46a7-a5b4-aeb39c4fd182 · inbound

Maximizing Reachability via Shifting of Temporal Paths cites this paper.

Maximizing Reachability via Shifting of Temporal Paths Exploring Temporal Graphs with Frequent and Regular Edges

Reference 15

Resolution
verified exact
arxiv_id, observed 2026-05-13T05:02:16.803297Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-05-13T05:00:02.957536Z digest=sha256:aec0bffe0acfa328dd7d2911f7b3a33f4d1dcc75e812e56ab289045bf8119174