Pith. sign in

Paper Citation Record · LEDGER

Robust logarithmic lower bound on shared-resource cost for $f$-routing

As of 13 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2608.05775.

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

pith.paper-citation-record.v1
2608.05775 v1

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-08T00:02:13.135853Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

21 of 21 outbound references displayed

  • verified exact1
  • verified fuzzy13
  • unresolved7
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e7932ec2-f920-4979-9a58-da27422a048c · outbound

This paper cites Allerstorfer, H.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Allerstorfer, H

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.421257Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.058864Z digest=sha256:e03dfcc81ada4b3434a4b7e4d254cb5679ff4f3bf63c57a94757e636279acc0d

Observation 34c33434-7710-4464-9200-1e807b836fce · outbound

This paper cites Linear gate bounds against natural functions for position-verification.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Linear gate bounds against natural functions for position-verification

Reference 2

Resolution
verified exact
local_arxiv, observed 2026-08-08T00:02:13.210970Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.063345Z digest=sha256:19a0cd2378cb19f5e11a79d0f8fe630b1386ec78a98e409d945784ebbc6778a9

Observation 125df53d-01bc-4200-a2be-1fe406b570bc · outbound

This paper cites an unresolved cited work.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-08-08T00:02:13.410225Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.068499Z digest=sha256:1d4b5dfa2e5e625c3f17ce3733f3385679bcabbf2a75d4eea1bdd3f6d2d74cb5

Observation 0a5dee94-7f56-48c9-bf9b-6305034f08c7 · outbound

This paper cites an unresolved cited work.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-08T00:02:13.399176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.072576Z digest=sha256:9668f3f37c1ac2b661387d256a1c19a0036d63e2a403a098fff79254d78c253f

Observation 13786f55-dc58-4590-8b2a-a672e461d6e8 · outbound

This paper cites Bluhm, M.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Bluhm, M

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.387331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.075997Z digest=sha256:29ee798597e3d4471932d1864b8f09754af76deee2bec0d6c98bbfcfeac21c45

Observation 5fa9a0b2-fdb2-4d9e-baba-1dfe4c8bce29 · outbound

This paper cites Bluhm, S.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Bluhm, S

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.374498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.079655Z digest=sha256:cbbca5b4a6554f2318081555999701638da5d90c3ed11cf7a7aee77b78dc2fea

Observation 207c420b-6182-4142-9ae7-ca8720df51ff · outbound

This paper cites Boyd and L.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Boyd and L

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.359928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.083468Z digest=sha256:692b093dc2c360523be1669ddea7c25199be8bdd6398e3b5a78b980aee256a38

Observation cdd50fe1-147b-4e17-91a7-095fdf3eb93a · outbound

This paper cites Lower bounds on non-local computation from controllable correlation.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Lower bounds on non-local computation from controllable correlation

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-08T00:02:13.086766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T00:02:13.086766Z digest=sha256:5298c3f8c7fd14542025ba8060a30fcafd57f481dd15c49d5fa9605f56fc8038

Observation 1e43b681-6188-4280-880a-a39163d47d5e · outbound

This paper cites an unresolved cited work.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Unresolved cited work

Reference 9

Resolution
unresolved
raw_fallback, observed 2026-08-08T00:02:13.346672Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.091123Z digest=sha256:9798318bb7ff8d70aadfd4bcfc82abac81f51225855be13e005b03c31a6cf523

Observation f72cf247-57d4-4ced-a0dc-d344c0153738 · outbound

This paper cites Forster, A linear lower bound on the unbounded error probabilistic communication complexity, Journal of Computer and System Sciences 65 (2002), 612--625.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Forster, A linear lower bound on the unbounded error probabilistic communication complexity, Journal of Computer and System Sciences 65 (2002), 612--625

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.332475Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.094745Z digest=sha256:88d90df39fe1441e03cf8113d052d5c3d7e44f03cd81a4b7077b8dd37d4116a3

Observation bb323554-52b5-40aa-8aa4-7057d0260f6f · outbound

This paper cites Girish, A.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Girish, A

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.321241Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.098697Z digest=sha256:2a5b5e9aadc35baa28101eb6f491c87f83c71e3a77efef19c7567d5bad0a7230

Observation a627d4b3-a4d9-42a3-bf19-fb0c8c0c08d8 · outbound

This paper cites Hayashi, Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing, Journal of Physics A 35 (2002), 10759--10773.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Hayashi, Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing, Journal of Physics A 35 (2002), 10759--10773

Reference 12

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.310409Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.102699Z digest=sha256:f2a42e748ff19c82e5fddfd5af976214ec77a9f031edfde724d710f4d058447f

Observation 5ca3e877-481e-45d7-bb65-38fed85b3fbc · outbound

This paper cites Hiai and D.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Hiai and D

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.296955Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.106190Z digest=sha256:628ad5ee372fb57b0a79ac271a48796211418f2a22644b3d55da478943c0d5b5

Observation 05f84a9f-39eb-445b-a419-ee8d14d2d597 · outbound

This paper cites Kretschmann, D.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Kretschmann, D

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.285472Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.109985Z digest=sha256:fc6b445d8d2dcd241ec856eb62dc02de0fef577989cb65db03f37d7c45a5209e

Observation 3cdd9eed-1d3b-4f97-a1f6-8d03ac6d33d9 · outbound

This paper cites Liu, Quantum state testing beyond the polarizing regime and quantum triangular discrimination, Computational Complexity 34 (2025), 11.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Liu, Quantum state testing beyond the polarizing regime and quantum triangular discrimination, Computational Complexity 34 (2025), 11

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.272052Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.113484Z digest=sha256:1f312be80a980e4f62bccf114b28539cb664c2fdbd1ecc7e67a12def4a85eff7

Observation 9c7517a3-b244-4a94-a470-62231ba0acde · outbound

This paper cites Entanglement cost in non-local quantum computation.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Entanglement cost in non-local quantum computation

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-08T00:02:13.116897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T00:02:13.116897Z digest=sha256:e749627fc3eaf73aae78b76c0fdfa9d99046b149447a460d56ef9881622457df

Observation 768ccc23-90b3-44e5-a656-efafec6de42b · outbound

This paper cites Ogawa and M.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Ogawa and M

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.259631Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.120700Z digest=sha256:5903aa50c72fb2835bf33b16d856edb91965fd7ff5aecc9a14c550199e23dc1e

Observation 11f91891-2560-4295-9d37-ac6755c482f2 · outbound

This paper cites an unresolved cited work.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Unresolved cited work

Reference 18

Resolution
unresolved
raw_fallback, observed 2026-08-08T00:02:13.247576Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.124296Z digest=sha256:feabc290d397410c732e67ac86228c12b49f476e7eb9d0c81019749febe40ca2

Observation 7c68fec6-4fd9-40ca-9d28-853e988f42a5 · outbound

This paper cites Saad, Iterative methods for sparse linear systems, second edition, SIAM, 2003.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Saad, Iterative methods for sparse linear systems, second edition, SIAM, 2003

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.235753Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.128422Z digest=sha256:cc2950ad2d2620633a943fa93605baddbbf8a0882ffb2f462048f046853b5561

Observation 568ecb9c-6928-45bd-b4b0-fcfab718787f · outbound

This paper cites Temme, M.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Temme, M

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-08T00:02:13.223693Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

source=arxiv_source observed=2026-08-08T00:02:13.132114Z digest=sha256:b774f74a2c5be34bff5363be516f71058b18643f5113e2527714ff3753a30884

Observation 290261cf-1cef-40af-97a9-0f91ad2e6e2f · outbound

This paper cites an unresolved cited work.

Robust logarithmic lower bound on shared-resource cost for $f$-routing Unresolved cited work

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-08T00:02:13.135853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-08T00:02:13.135853Z digest=sha256:b6b3032613d2d4ebf747903a1998825ce63dc59a777a44a27f5ca3bec3bb24ec

Pith citing papers

No inbound Pith citation observations are available.