Pith. sign in

Paper Citation Record · LEDGER

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

As of 19 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-19T06:32:44.657259+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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

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-19T06:32:44.657259+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.