Pith. sign in

Paper Citation Record · LEDGER

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs

As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2606.04746.

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

pith.paper-citation-record.v1
2606.04746 v3

Coverage vector

measured 15 of 15 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T12:25:17.465435Z

measured 15 of 15 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

15 of 15 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved15
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e6307400-2e5e-46a6-93df-1304cc5b2987 · outbound

This paper cites Multi-agent path finding with delay probabilities,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Multi-agent path finding with delay probabilities,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.423244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.423244Z digest=sha256:c9e353594311597d30d413668b4d5f5ad6b1fdeda8482bb805bdfde71d85f853

Observation 50d082af-7990-4153-a942-e512ef6a8d26 · outbound

This paper cites Persistent and robust execution of mapf schedules in warehouses,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Persistent and robust execution of mapf schedules in warehouses,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.427098Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.427098Z digest=sha256:55ddd5fbf74c29b276be0f4edf9cb6cb0081b24266a5cf098ce410d7ef23f6d7

Observation 41e899a8-d65f-4730-a756-200d04562b6c · outbound

This paper cites Bidirectional temporal plan graph: Enabling switchable passing orders for more efficient multi-agent path finding plan execution,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Bidirectional temporal plan graph: Enabling switchable passing orders for more efficient multi-agent path finding plan execution,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.430308Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.430308Z digest=sha256:57e8e25b716a6fc72239607863231491235532d8d8a7d77493fe8c31c29da483

Observation d5943479-da53-45bd-9362-e952cfc64cff · outbound

This paper cites Multi-agent pathfinding: Definitions, variants, and benchmarks,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Multi-agent pathfinding: Definitions, variants, and benchmarks,

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.433572Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.433572Z digest=sha256:2a85f83d44eca0b2b279bb269b86a1eb6956e3826b76ea0bbfa3fd7c7cf58aa4

Observation 23771bed-2a51-440c-9fb7-644f0fb64859 · outbound

This paper cites Conflict-based search for optimal multi-agent pathfinding,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Conflict-based search for optimal multi-agent pathfinding,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.436566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.436566Z digest=sha256:de9271a17c772bdab86c32add969045b553b13ae81f801def642c3a16e4b582a

Observation b3ba0739-b0bc-4b51-b6cc-077204634fdf · outbound

This paper cites Coordinating hundreds of cooperative, autonomous vehicles in warehouses,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Coordinating hundreds of cooperative, autonomous vehicles in warehouses,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.440158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.440158Z digest=sha256:b1bc6992541b4d65931c0f13ac8f6f494679cdf60a00a97615d1d281c5563675

Observation 4e82d540-ff93-4f92-92ac-3deffbe23012 · outbound

This paper cites Analyzing planner design trade-offs for mapf under adg-based realistic execution,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Analyzing planner design trade-offs for mapf under adg-based realistic execution,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.443622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.443622Z digest=sha256:91bc4f5c8e848582da2ce3404ec2c8cfe0e57b5d814f71a342d25896561ad32d

Observation 72db8582-43f7-4227-a8fa-20a7e12f3ba9 · outbound

This paper cites Which mapf model works best for automated warehousing?.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Which mapf model works best for automated warehousing?

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.446356Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.446356Z digest=sha256:f8053256e13f8e1972a8d338b710b363ac556979a266c14d2f70ccd679828258

Observation 9b85a664-a347-4aa3-a249-068190a09706 · outbound

This paper cites Traffic flow optimisation for lifelong multi-agent path finding,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Traffic flow optimisation for lifelong multi-agent path finding,

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.449026Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.449026Z digest=sha256:f547ad9dd2aca7a0fb9b1032a270144fb4a646104a5936ed4ec7c459edd72c58

Observation 39c4a703-d523-41c7-92a5-ea00c727b75f · outbound

This paper cites P3gasus: Pre-planned path execution graphs for multi-agent systems at ultra-large scale,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs P3gasus: Pre-planned path execution graphs for multi-agent systems at ultra-large scale,

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.451622Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.451622Z digest=sha256:626d02c9cc166ca145a30f0191a344a5e5213a92b4b9dfb4cecd54e2c5d42f20

Observation c5ac0e19-7e95-4e0b-9432-63b89293fa08 · outbound

This paper cites Improved heuristics for multi-agent path finding with conflict-based search,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Improved heuristics for multi-agent path finding with conflict-based search,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.454387Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.454387Z digest=sha256:8b9def4d7771d17a9ce90a62045e83ba4c46cb369b18f9582ad719dd272d5dbd

Observation 4dad38d0-2fec-4ac9-ac71-ff531de101a5 · outbound

This paper cites Eecbs: A bounded-suboptimal search for multi-agent path finding,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Eecbs: A bounded-suboptimal search for multi-agent path finding,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.457047Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.457047Z digest=sha256:2be67bf4b47f2910b059bc6fc22ecf1e20d16191a522a7d355156b1c12010f1f

Observation b330fd0a-1d02-4948-a66d-f63162336803 · outbound

This paper cites Lacam: Search- based algorithm for quick multi-agent pathfinding,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Lacam: Search- based algorithm for quick multi-agent pathfinding,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.459863Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.459863Z digest=sha256:f3141396615f67ae9f385c9e3e449d3c1250a727e8b35e92ac8bca0ea5484269

Observation fa1f04d4-8598-4a4c-8331-1425b7885f9f · outbound

This paper cites Engineering lacam*: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Engineering lacam*: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.462510Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.462510Z digest=sha256:259b01d24ae5a4e84a65f11f487691c70e15aa8a330034e6cf449fc8b2f6ee4e

Observation 5fccc8ec-0282-42db-af1f-29163fce26ad · outbound

This paper cites Engineering LaCAM$^\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding.

CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs Engineering LaCAM$^\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-02T12:25:17.465435Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T12:25:17.465435Z digest=sha256:dec17b81add83a98194a979312f0d440971bca2f227a75fa3288e5aa02755d51

Pith citing papers

No inbound Pith citation observations are available.