Pith. sign in

Paper Citation Record · LEDGER

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates

As of 18 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2607.02150.

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

pith.paper-citation-record.v1
2607.02150 v1

Coverage vector

measured 35 of 35 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-03T03:58:08.678247Z

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+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

35 of 35 outbound references displayed

  • verified exact0
  • verified fuzzy31
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b8d3a818-8d78-4aef-bd3d-e5262d9bc986 · outbound

This paper cites SIAM Journal on Computing 43(2):930--972.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates SIAM Journal on Computing 43(2):930--972

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.383427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:8dd2634e7f90532ac24d2eabc08411f68f861a2595666a5feadd170b998e8eee

Observation 83739d46-6f31-4bbe-9700-a0ef4824826f · outbound

This paper cites Stochastic Systems 9(3):231--260.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Stochastic Systems 9(3):231--260

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.410986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:354ad209816091e7cbb1242cd71931c278eabdba9f16748b304ba9f52307b244

Observation 623fb386-7ecd-4e1d-aed5-f631123683b4 · outbound

This paper cites Stochastic Systems 10(2):170--191.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Stochastic Systems 10(2):170--191

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.365487Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:0a8b877158988c83e7e329afc237fc3b3036cc53ffb71524bfda7bbaca4fb122

Observation 5fdf51c2-38ce-4410-87db-895af8197e34 · outbound

This paper cites Management Science 71(6):4877--4894.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science 71(6):4877--4894

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.362928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:55d8d2a7bd8a5c6508cdbb31380f1d67905160eb7e6942f1dd5d4d73d804ed83

Observation 6bde9866-c1af-441a-94ad-f30f88455154 · outbound

This paper cites Operations Research 72(5):2168--2189.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 72(5):2168--2189

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.429126Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:30f40f6c4dfcc623763dc48add4aec1ec7bfc7d0d2843d78f0174eb2b91350cc

Observation 3f333585-f54c-4617-904e-ca28ce84d64b · outbound

This paper cites Operations Research 73(3):1273--1288.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 73(3):1273--1288

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.431749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:15f29b17eb99dfd4fa32ebff0080637c663a14695daba848e70c2e1a42ccac7b

Observation 1ed1668c-9469-4f3f-8f9a-6ccc3aee07bc · outbound

This paper cites Oxford University Press.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Oxford University Press

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.426269Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:e36be2d2dd221c05f5994cc2768f75982062414aee360e92d1fa5e87c2ec71ce

Observation 710111dc-0e0b-472a-999e-529a358710e6 · outbound

This paper cites Operations Research 73(4):2188--2203.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 73(4):2188--2203

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.360400Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:523a669ec9bac0e3c2b1e4191d3c992f50870f0e521ef3b5ff043ccca5bb5e5c

Observation 536ea0ca-2cb1-49ec-b921-708a04711a93 · outbound

This paper cites Management Science 66(7):2993--3009.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science 66(7):2993--3009

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.420227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:24251c866f194546a7295c9c84de1e8648ed9a076e17ba963c00703db631341d

Observation fba575db-7c7e-4ff2-826f-e9087618d576 · outbound

This paper cites Proceedings of the 42nd ACM Symposium on Theory of Computing, 311--320.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Proceedings of the 42nd ACM Symposium on Theory of Computing, 311--320

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.416796Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:4ab20570bace97f95388bcfa6848b3406018597462a000e71cf7caf20a14f8b0

Observation ed1f0538-d867-4e4a-aa00-84a9f2a9d7f7 · outbound

This paper cites Operations Research 72(3):1124--1138.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 72(3):1124--1138

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.367818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:6ae119861113f172e5b8db48bf2804672816f08f85883113d967e85a8c99a380

Observation 2c2cd026-2760-4633-a74b-f337cdca3518 · outbound

This paper cites Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming

Reference 12

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T04:07:36.535700Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:70fd7a4b75aeac2906bfd81d574dbe895806d41c6ce3657acef52056cb703f4b

Observation a0bf3468-6482-4ba4-affd-d0a2386ac4d4 · outbound

This paper cites Proceedings of the 2017 ACM Conference on Economics and Computation, 169--186.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Proceedings of the 2017 ACM Conference on Economics and Computation, 169--186

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.405312Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:bae3e7c93d62e4052791975a40d888516968b80f7c93b29322ccf99c480fd2b3

Observation fcf9e853-5a65-4b0c-b2c3-21970afa8377 · outbound

This paper cites ACM SIGecom Exchanges 17(1):61--70.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates ACM SIGecom Exchanges 17(1):61--70

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.434477Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:a1318c83cef023892fefd79287784620826e4beac42a6cfc096b196b6926ffdc

Observation 51006790-c3d9-4627-bffd-26da951f27c6 · outbound

This paper cites II, 2nd ed.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates II, 2nd ed

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.439867Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:b97ff43692c9ae85983fb0552b67a5c2c532f395b2dc04601c5c7f2ac3c03f9f

Observation b717a703-4f84-4dc0-ab36-a2f33f394ed6 · outbound

This paper cites Mathematics of Operations Research 48(3):1344--1363.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Mathematics of Operations Research 48(3):1344--1363

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.423285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:b503a2841d1fca8e08c64a5eac32a73c14e0ec51f9cbe8b1e1d5be22df6229a7

Observation c0eef06b-6f3b-419c-99e8-781d12637439 · outbound

This paper cites Management Science 40(8):999--1020.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science 40(8):999--1020

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.437384Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:9c6aef979037df1be71e25e5df546c8d2fe7d5241d7397c546cdc004dbca808f

Observation 4a6f4820-0c07-42c6-8b35-c16df151343a · outbound

This paper cites Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming

Reference 18

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T04:07:36.538541Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:cccc3d400fbde50f5e6c8a8e4741ac3d9917c6c703d2979d243b6b7741a2873b

Observation feae2ebe-66ef-4b90-971d-883b7f266582 · outbound

This paper cites Operations Research 72(3):1139--1155.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 72(3):1139--1155

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.400513Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:48f9dddf9b37f1fc48dc9d1455558c46076e4b46ad4bf895352bd7d6d396b8be

Observation 3408e7e7-f4c7-4a01-9fd8-acc489ad1f02 · outbound

This paper cites Working paper, SSRN 5133857.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Working paper, SSRN 5133857

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.402853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:dceb2eca93ec59257fe514b94e416697486bd84b0048a73514c32f28bf8cfdec

Observation c9e18e0a-45e0-419f-97ff-c34f50f84ed9 · outbound

This paper cites random variables.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates random variables

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.413894Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:4aea298afcf89157a747a35e76981c2a6e43629b0f0ed5b4b4ba7bc10ec36b2c

Observation 8d025d59-20ba-4719-aeba-8a8da26c19a5 · outbound

This paper cites Mathematics of Operations Research 37(2):313--345.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Mathematics of Operations Research 37(2):313--345

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.395350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:62d28139cee83da5ff6458639aba003c9cea9770cc0e2d42dee48fdcc711f8bc

Observation 0e9d5186-3d53-412d-af5d-30fdf550a149 · outbound

This paper cites Online Resource Allocation with Stochastic Resource Consumption.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Online Resource Allocation with Stochastic Resource Consumption

Reference 23

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T04:07:36.541382Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:a6040821b87a39d9df14365a9b5a8ea0869a5f233320f2ba112cf300440308bc

Observation 89bbfbc0-7319-46d8-8973-b1db4610c20c · outbound

This paper cites Operations Research 73(3):1703--1721.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 73(3):1703--1721

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.393077Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:0c4d8de86dabd7b806c3d9ea24d87ae93f7a1a7b4b700889333ad67604db0c9b

Observation 70904cc6-bea7-4989-8a07-dead9314e46f · outbound

This paper cites Operations Research 73(6):3405--3420.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 73(6):3405--3420

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.390572Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:599e019859e27cabb3d27e588244ff7175a9026e571f0f1b2d09e36b0878ff36

Observation 0a7d280a-a5db-49df-b512-9a7aba8d9c6c · outbound

This paper cites Mathematics of Operations Research 51(2):956--987.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Mathematics of Operations Research 51(2):956--987

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.397736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:13e41772e7878cdc8e7208bb980593960915c0016150567e75dcaa2180842c11

Observation 133db64e-ad0e-4fb5-958e-af517789fa68 · outbound

This paper cites Infrequent resolving algorithm for online linear programming.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Infrequent resolving algorithm for online linear programming

Reference 27

Resolution
metadata mismatch
arxiv_id, observed 2026-07-03T04:07:36.542488Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:64004678ce618b3bd5ebab701d2531108c24805523202d6bee9b0bacf5a3070c

Observation ca282ec6-e5fd-4664-9fe0-f1de09d71b5e · outbound

This paper cites Operations Research 70(5):2948--2966.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 70(5):2948--2966

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.408334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:6fc3acdfbf6383b13bc8d0670c0606d5e3b94ce76887409ba18b1fe579d80f3f

Observation 3be92a16-f50e-4247-a3e2-3e9ba366909c · outbound

This paper cites Journal of Algorithms 29(2):277--305.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Journal of Algorithms 29(2):277--305

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.377840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:29c3d7dd52a6e4f08c03fc3b5330324c6eba3434979b79326fbea6fc87a5027a

Observation 743fefd7-c721-471f-a457-815e9ae6c10f · outbound

This paper cites The Annals of Probability 12(4):1213--1216.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates The Annals of Probability 12(4):1213--1216

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.380934Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:890df0872eea96b53782098b2a0d499efc7608c46dd4ab5c8ef63e5087ad4c18

Observation a45e448b-607f-4e05-a902-6258fa0f7ad0 · outbound

This paper cites Management Science 44(11):1577--1593.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science 44(11):1577--1593

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.385482Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:d5ae429863baf0d35fb85532c8d29cbacef9834cb62905b545ac4696901636c6

Observation b5b2b5c7-53ed-49fa-b2ea-b749961a3cae · outbound

This paper cites Management Science 67(3):1368--1391.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science 67(3):1368--1391

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.388155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:1bfb27ec065b0543fb5a985dabb61abb91faf5801211bb9f73a4752f11b59e03

Observation 1a7cce97-19d7-4514-ac01-e231d46a32f9 · outbound

This paper cites Operations Research 69(3):821--840.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Operations Research 69(3):821--840

Reference 33

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.370272Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:73f07d9f4707e3139f072a3faac79a07072f0c115e00846f35d1a9b112e75a40

Observation 27681686-727b-4d59-befb-b651edba39aa · outbound

This paper cites Working paper, SSRN 4357216.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Working paper, SSRN 4357216

Reference 34

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.373056Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:abce2650eae597b5d20189daa985c324cd89e69a975a5a46c2af962f2d62b4eb

Observation 2c34fe72-9068-40ba-8f5a-d48fdcee40ec · outbound

This paper cites Management Science, forthcoming.

Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates Management Science, forthcoming

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-07-05T14:51:11.375285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

source=arxiv_source observed=2026-07-03T03:58:08.678247Z digest=sha256:24b7bddaa348140ea68b9c5096942375be0803fa1962cd6cad659e187e9a401d

Pith citing papers

No inbound Pith citation observations are available.