Pith. sign in

Paper Citation Record · LEDGER

Graph k-Coloring in Average Sublinear Time

As of 11 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2607.26592.

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

pith.paper-citation-record.v1
2607.26592 v1

Coverage vector

measured 58 of 58 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T13:00:58.848641Z

measured 58 of 58 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+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

58 of 58 outbound references displayed

  • verified exact16
  • verified fuzzy0
  • unresolved41
  • parse uncertain0
  • malformed identifier1
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 8e9aa171-be7d-473d-aa81-2efdec2e80a7 · outbound

This paper cites Journal of Algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Journal of Algorithms , volume=

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:53.877482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:53.877482Z digest=sha256:bd83bcfcd04c26728f571037f92111adb135ff05361ce52e7d1fe4121b91ca95

Observation 3c1fa451-6f45-4954-875e-e1d50e93d791 · outbound

This paper cites Discrete Mathematics , volume =.

Graph k-Coloring in Average Sublinear Time Discrete Mathematics , volume =

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:53.944439Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:53.944439Z digest=sha256:fb8116213fbea335e34d4cf2884f76e8e074f5a306057ee8f55b4e535e8d006a

Observation dadf0a5c-d222-48e6-8133-ea27efa4f6ae · outbound

This paper cites Discrete Applied Mathematics , volume=.

Graph k-Coloring in Average Sublinear Time Discrete Applied Mathematics , volume=

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.022198Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.022198Z digest=sha256:3005bc88a29a79e0f68618f059dd14113fb4c7c4cf9caad04f2f419a049caf04

Observation 96664393-4f99-49b5-a1df-d7e3be8f2964 · outbound

This paper cites Random Structures & Algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Random Structures & Algorithms , volume=

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.138606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.138606Z digest=sha256:416850599921fc1b5bdba0a69416fa42702854ebcd6090361b813509bff762c9

Observation 7d4ed48c-732d-4709-a0c6-95543e2bb6c3 · outbound

This paper cites Journal of Algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Journal of Algorithms , volume=

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.242608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.242608Z digest=sha256:7a8d02be938362ed14f82a61d80df11fb222c0a3b8a85b0ce5cdf75ecb26de5f

Observation 99e6c024-55f2-4778-b2c2-835dfff7a77a · outbound

This paper cites Discrete mathematics , volume=.

Graph k-Coloring in Average Sublinear Time Discrete mathematics , volume=

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.342705Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.342705Z digest=sha256:c32e236107d6bc4fd9e9ccb5bdfa44f13523d9fb642f1a105f4182e82db92f25

Observation df4a5791-7763-498d-b1d7-900176d17860 · outbound

This paper cites International Workshop on Graph-Theoretic Concepts in Computer Science , pages=.

Graph k-Coloring in Average Sublinear Time International Workshop on Graph-Theoretic Concepts in Computer Science , pages=

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.414464Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.414464Z digest=sha256:48db28eb51b5589e42bc60f73a1eaaf5f482132febd36b50ead88c359f42a0d4

Observation 765d6052-ad96-42fc-ba87-147e5761d7a2 · outbound

This paper cites Journal of algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Journal of algorithms , volume=

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.513489Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.513489Z digest=sha256:b9b803aab4dcd02ab77b921b8cfdeb4b72789ce4e9d286e716709eb061280325

Observation 3faac245-1adc-464d-a216-a5b1e88d95d0 · outbound

This paper cites Theory of Computing Systems , volume=.

Graph k-Coloring in Average Sublinear Time Theory of Computing Systems , volume=

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.697383Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.697383Z digest=sha256:f8c8b6352d44e79bae92f06881a7edb713db1e84f7e6bcdd4215b002a22ca4c9

Observation 77e568f7-cc0f-4c2a-a894-fafb10e9cb22 · outbound

This paper cites Journal of Algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Journal of Algorithms , volume=

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.750144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.750144Z digest=sha256:3213493cae31c12206f14152cf755b1dae5b192afc162ba42fec2457323be712

Observation 55bb873e-9caa-44e8-9f12-0e842faca35e · outbound

This paper cites 50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art , pages=.

Graph k-Coloring in Average Sublinear Time 50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art , pages=

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.825390Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.825390Z digest=sha256:bb01b29bbc8fb4d98fca41153bc70d76cfbdfd983ec707432601590f82ccf9f1

Observation bc2c57d3-a601-4614-bdec-9498976d120f · outbound

This paper cites Information Processing Letters , volume=.

Graph k-Coloring in Average Sublinear Time Information Processing Letters , volume=

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:54.897381Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:54.897381Z digest=sha256:4c754b7a34c974dd8f4ee65c87f19ec228226433f380f8f6fd08e7333465566a

Observation 574b45b6-b82d-468d-9668-cda4e257b52f · outbound

This paper cites an unresolved cited work.

Graph k-Coloring in Average Sublinear Time Unresolved cited work

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.050386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.050386Z digest=sha256:97130a0a0a360ecbe5d86f269e8eb84441902b2f3463049ff727e217dfe1fb83

Observation e4e15f15-6d61-4bf3-9c09-4d0642d16cab · outbound

This paper cites Karp , editor =.

Graph k-Coloring in Average Sublinear Time Karp , editor =

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.201731Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.201731Z digest=sha256:6019163c396572119da10ce549ef650fc9e6b7adbfd1c296f4ead40df81c8b56

Observation 8fe5a8c7-2776-427a-b4b4-521894bbd3be · outbound

This paper cites A Fast Coloring Oracle for Average Case Hypergraphs , booktitle =.

Graph k-Coloring in Average Sublinear Time A Fast Coloring Oracle for Average Case Hypergraphs , booktitle =

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.326350Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.326350Z digest=sha256:f3047dfb30d4815ec675c56c0e66331d521bf4657126a280aa551d069f40cd35

Observation c96b992f-6831-418f-af3d-b249c887e2d7 · outbound

This paper cites Set Partitioning via Inclusion-Exclusion , journal =.

Graph k-Coloring in Average Sublinear Time Set Partitioning via Inclusion-Exclusion , journal =

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.413852Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.413852Z digest=sha256:39be258472e16159986d3cd6d7fd5a4d5fb7578e699daed572c0e23776704e50

Observation 6e2a2b1e-d741-44f2-a3ce-46cc22ec6871 · outbound

This paper cites Fundamentals of Computation Theory: Proceedings of the 1977 International FCT-Conference, Pozna.

Graph k-Coloring in Average Sublinear Time Fundamentals of Computation Theory: Proceedings of the 1977 International FCT-Conference, Pozna

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.575638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.575638Z digest=sha256:30e425a118eb8507edb6045ad5cd158a0006f903ea18146f8e03c0b3d93a619a

Observation 0e46278a-dd0a-4a5e-999c-8bee114f2969 · outbound

This paper cites International Colloquium on Automata, Languages, and Programming , pages=.

Graph k-Coloring in Average Sublinear Time International Colloquium on Automata, Languages, and Programming , pages=

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.671087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.671087Z digest=sha256:09c05296cb4b80c7109f0c454c6a4f43a3458493efc94973a41fc2a14a032d23

Observation 9e88928e-3c19-4b18-88de-60ee4a8743f3 · outbound

This paper cites Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing , pages=.

Graph k-Coloring in Average Sublinear Time Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing , pages=

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.779372Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.779372Z digest=sha256:3e55be8ff5e9452e1c9938cf69af28caf59219035070cbffa04f49a324fce351

Observation f5ddc2de-fdc5-4141-b7b2-4c500405d23f · outbound

This paper cites Journal of Computer and System Sciences , volume=.

Graph k-Coloring in Average Sublinear Time Journal of Computer and System Sciences , volume=

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.842364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.842364Z digest=sha256:926d35907a906b2c676d76f84c698e0959c3feb36ed1a3b6cd38cb4f151ce152

Observation a7f08ad4-436b-402a-956b-a2d06405033e · outbound

This paper cites Beyond Worst Case Local Computation Algorithms.

Graph k-Coloring in Average Sublinear Time Beyond Worst Case Local Computation Algorithms

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:55.993007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:55.993007Z digest=sha256:4fcbe6f21e8b559976a7310a4a759b9a3889adf86500be286cb32bfbc613ad3c

Observation 57eb1d30-3b1f-4832-af6e-1de1f278d852 · outbound

This paper cites International Symposium on Mathematical Foundations of Computer Science , pages=.

Graph k-Coloring in Average Sublinear Time International Symposium on Mathematical Foundations of Computer Science , pages=

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.101720Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.101720Z digest=sha256:ed38de016cc1743aee34e33e47ebf23aa28df4053caa1d8d9705e35e5d099e00

Observation a4faa098-a60a-4e54-afbb-483c09906997 · outbound

This paper cites Random Structures & Algorithms , volume=.

Graph k-Coloring in Average Sublinear Time Random Structures & Algorithms , volume=

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.196446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.196446Z digest=sha256:7986fea48ed98c2a615e239b4953f91d318a6c86c340c40da25e09aabf238418

Observation 0a1d809e-92c2-4a59-9551-0f22d9afedb5 · outbound

This paper cites Surveys in combinatorics , volume=.

Graph k-Coloring in Average Sublinear Time Surveys in combinatorics , volume=

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.333044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.333044Z digest=sha256:66743da4475bd217ecb91801c084dcb65afc27f63e49a7d3a7d7bbb43ab23381

Observation 56e9003d-05f6-47e6-ae60-2f86f35bca9e · outbound

This paper cites Physical Review E—Statistical, Nonlinear, and Soft Matter Physics , volume=.

Graph k-Coloring in Average Sublinear Time Physical Review E—Statistical, Nonlinear, and Soft Matter Physics , volume=

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.418894Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.418894Z digest=sha256:b6968b7fa5fa8b4f2ac396b884ff8940c16a3095d754bc5714f6edf8d082c35a

Observation 733b9199-ea20-4194-8e79-e50f98cde3ce · outbound

This paper cites Proceedings of the Seventeenth Annual.

Graph k-Coloring in Average Sublinear Time Proceedings of the Seventeenth Annual

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.500077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.500077Z digest=sha256:7ba30de173d18b6894724b705ca233de691b4040b7b5dd0d15f74bbf836bd424

Observation d3989471-6b48-41bf-a0ee-c1239a09a05c · outbound

This paper cites Random Struct.

Graph k-Coloring in Average Sublinear Time Random Struct

Reference 27

Resolution
verified exact
doi, observed 2026-08-01T13:04:34.193854Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:56.567289Z digest=sha256:b8a9a666bf8c7c40f335d2b53c4fc37e101e74d2405de607d865317bc2aed9f9

Observation e8f309fd-faa5-4ae0-8e74-7e6b304abd58 · outbound

This paper cites A fast algorithm on average for solving the Hamilton Cycle problem.

Graph k-Coloring in Average Sublinear Time A fast algorithm on average for solving the Hamilton Cycle problem

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.634335Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.634335Z digest=sha256:b56f34473a6c3be98066053610372be34a17ff52967baf798d56dc96a2051cce

Observation 6036ae49-9cfc-4f1b-bcb7-f0e17c566a94 · outbound

This paper cites Scott and Gregory B.

Graph k-Coloring in Average Sublinear Time Scott and Gregory B

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.723142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.723142Z digest=sha256:3c3a8f04fe2db79624405485105d336586896246105d8c4813b085db163fc16d

Observation f03b6adb-75ef-4d3c-af33-aae2de5fb4e3 · outbound

This paper cites Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model.

Graph k-Coloring in Average Sublinear Time Average-case complexity of a branch-and-bound algorithm for maximum independent set, under the $\mathcal{G}(n,p)$ random model

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.770832Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.770832Z digest=sha256:902bb80d14caebe0b93c654e8218922ac6bda9dd28b073eb18a114c767f3cefb

Observation 7ccf23cc-b0a5-4be8-81d4-1ff33c2c4060 · outbound

This paper cites Duke and Hanno Lefmann and Vojtech R.

Graph k-Coloring in Average Sublinear Time Duke and Hanno Lefmann and Vojtech R

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.837537Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.837537Z digest=sha256:d9c9b3d011579d276b7ce712471197fff0033da39a2daad03c6e359aa2b0e201

Observation f67d7b42-dff1-4654-9372-7870c9e0e5cb · outbound

This paper cites Bandeira and Jess Banks and Dmitriy Kunisky and Cristopher Moore and Alexander S.

Graph k-Coloring in Average Sublinear Time Bandeira and Jess Banks and Dmitriy Kunisky and Cristopher Moore and Alexander S

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:56.924669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:56.924669Z digest=sha256:ebe777aa635f07cbd45aff98fec0fca1a5096ff2294d441ba6e9045c5b62ae31

Observation 8dc0f2c0-5571-4797-b4b2-58e6def84b4d · outbound

This paper cites Semirandom Models as Benchmarks for Coloring Algorithms , booktitle =.

Graph k-Coloring in Average Sublinear Time Semirandom Models as Benchmarks for Coloring Algorithms , booktitle =

Reference 33

Resolution
verified exact
doi, observed 2026-08-01T13:04:34.125695Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.012217Z digest=sha256:bba84253163205cf2a99805b0b6a7d02308ffcc69828006a4e8d051c1211270a

Observation b6764ef9-c270-48bd-b474-6dd3e152faa4 · outbound

This paper cites Random Struct.

Graph k-Coloring in Average Sublinear Time Random Struct

Reference 34

Resolution
verified exact
doi, observed 2026-08-01T13:04:34.066003Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.091846Z digest=sha256:0f9503491f2b19fad293ef82c1f63d50cf0505b72712f584e0e8e3fdd9614a00

Observation a3b7abb6-381d-42f0-9313-4ef4d151348f · outbound

This paper cites Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities , pages=.

Graph k-Coloring in Average Sublinear Time Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities , pages=

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:57.163760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:57.163760Z digest=sha256:e54f7f94f52307c1305ff29ff64640ff183af6810ee240bfdb987b5f4ba49584

Observation 5b7f1de8-a3cc-4014-8444-a8476012e3d2 · outbound

This paper cites Solving NP-hard semirandom graph problems in polynomial expected time , journal =.

Graph k-Coloring in Average Sublinear Time Solving NP-hard semirandom graph problems in polynomial expected time , journal =

Reference 36

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.999446Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.280420Z digest=sha256:3c0f727922367b44013d8007f3d28b19a3dca30c177a5565770149081c69adc7

Observation aa76b601-9bab-4777-8555-744df6ada23a · outbound

This paper cites On the tractability of coloring semirandom graphs , journal =.

Graph k-Coloring in Average Sublinear Time On the tractability of coloring semirandom graphs , journal =

Reference 37

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.929404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.396764Z digest=sha256:e6a6652871c3efc72de4dc1ded286b2c9235c652ef097e0c1ab150490e5f7df7

Observation 70d71545-3965-4dc0-908d-d751f3f3d53d · outbound

This paper cites Algorithmic Barriers from Phase Transitions , booktitle =.

Graph k-Coloring in Average Sublinear Time Algorithmic Barriers from Phase Transitions , booktitle =

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:57.506632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:57.506632Z digest=sha256:e2577f899728fcdc06c62a183ade0f4fd2342a179f11c04511fe3b20c03972e0

Observation 7cde9ae0-3b6d-487e-882f-ee54be4125df · outbound

This paper cites Upper-Bounding the k-Colorability Threshold by Counting Covers , journal =.

Graph k-Coloring in Average Sublinear Time Upper-Bounding the k-Colorability Threshold by Counting Covers , journal =

Reference 39

Resolution
malformed identifier
doi_truncated, observed 2026-08-01T13:04:33.839066Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.600969Z digest=sha256:5bafe473312b593aedc9b23290f39b8aaa71fd25027a549125f708b6ad2a577f

Observation 8ad52a7e-f6b5-4300-98df-4f4ae0f3b4fb · outbound

This paper cites Chasing the K-Colorability Threshold , booktitle =.

Graph k-Coloring in Average Sublinear Time Chasing the K-Colorability Threshold , booktitle =

Reference 40

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.762197Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.651246Z digest=sha256:4cd18670bfa2557651b81e40c7f65c8905a31445580271d057fb728ac35ff613

Observation cd5fbf98-3663-44cf-9a54-610ba5a6d250 · outbound

This paper cites The Condensation Phase Transition in Random Graph Coloring , booktitle =.

Graph k-Coloring in Average Sublinear Time The Condensation Phase Transition in Random Graph Coloring , booktitle =

Reference 41

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.692947Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.713924Z digest=sha256:cc4149bba9a9cbdbfdd8f98d162753ee5a4db8afd6b1c35925f56aadb1ec1dcf

Observation 93e62300-00c2-4f34-bbcf-e43cb73a6f3a · outbound

This paper cites Planting Colourings Silently , journal =.

Graph k-Coloring in Average Sublinear Time Planting Colourings Silently , journal =

Reference 42

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.594200Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.821349Z digest=sha256:f36716b569545a363bd9816f3b77dd8f27a753541d56ff66318e7df0e6be7de4

Observation d1e01075-8755-4fc1-822d-d306ae921e1d · outbound

This paper cites Quality control in sublinear time: a case study via random graphs.

Graph k-Coloring in Average Sublinear Time Quality control in sublinear time: a case study via random graphs

Reference 43

Resolution
verified exact
local_arxiv, observed 2026-08-01T13:04:33.554039Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.942192Z digest=sha256:a1d659a31a67b6132e7fcc9e6fd568be0c9db9cc344736831ee2db4f776dee4f

Observation c4cf9fe2-f774-4604-9f12-d45202bf6678 · outbound

This paper cites Fast Local Computation Algorithms , booktitle =.

Graph k-Coloring in Average Sublinear Time Fast Local Computation Algorithms , booktitle =

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.009046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.009046Z digest=sha256:564e5d5124a6f193599cad372d507442fbe97992950fa39df685bf1631e08ff0

Observation c950ce58-cbbf-49a6-be76-8f88179afd16 · outbound

This paper cites Space-efficient local computation algorithms , booktitle =.

Graph k-Coloring in Average Sublinear Time Space-efficient local computation algorithms , booktitle =

Reference 45

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.458812Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.089424Z digest=sha256:03e5a8525fcb3277eda579fe67876617d820a2d9696ba0faee2048f28ddae466

Observation 93a85330-d67e-45c1-9716-67743e856b63 · outbound

This paper cites 1992 , url =.

Graph k-Coloring in Average Sublinear Time 1992 , url =

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.158976Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.158976Z digest=sha256:d39e4631fb2d3368e684d213f32bce20290a7f70059de1afaf56cf1aa956917a

Observation 76f3379b-d004-41b6-bd3c-89093639b52d · outbound

This paper cites Harris and Johannes Schneider and Hsin.

Graph k-Coloring in Average Sublinear Time Harris and Johannes Schneider and Hsin

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.221500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.221500Z digest=sha256:781550415bf092158d95e073516a75c0540f28cc8d605a83a05ec7868b1d7cd6

Observation 5ef953a1-86a2-40d3-b937-e0090c2b7231 · outbound

This paper cites 2023 , url =.

Graph k-Coloring in Average Sublinear Time 2023 , url =

Reference 48

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.385926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.269432Z digest=sha256:12d917c2b4dd58578a71dec04c010617d4a3ac7913ca15c4c8e6721d5b61f2b3

Observation 5281fb95-4d96-4a05-8d0b-40cbea3f495b · outbound

This paper cites 2019 , url =.

Graph k-Coloring in Average Sublinear Time 2019 , url =

Reference 49

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.301287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.305353Z digest=sha256:323873f7bb13dfd5243b349bd09dbbea3ee606d98305b1a8156b71b7fb1863cb

Observation f33d50d1-4849-4499-8422-89d7d8d0d4af · outbound

This paper cites A Distributed Palette Sparsification Theorem , booktitle =.

Graph k-Coloring in Average Sublinear Time A Distributed Palette Sparsification Theorem , booktitle =

Reference 50

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.242482Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.354722Z digest=sha256:cbf81fb514fc8588296e69450a8240033d64d52aaef439cdc9262f71d8d18c68

Observation 1d4ed68c-33ea-4850-b583-4397b7db996a · outbound

This paper cites Local Computation Algorithms for Coloring of Uniform Hypergraphs.

Graph k-Coloring in Average Sublinear Time Local Computation Algorithms for Coloring of Uniform Hypergraphs

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.404960Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.404960Z digest=sha256:065dfec56abfc7139a99b2f643058c0d6c2cc4dcce60021947d232334a31e204

Observation 95de429d-47b6-4dde-8ff8-38593cd9a4a5 · outbound

This paper cites Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach , booktitle =.

Graph k-Coloring in Average Sublinear Time Local Computation Algorithms for Hypergraph Coloring - Following Beck's Approach , booktitle =

Reference 52

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.183824Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.465521Z digest=sha256:62c301c212eca213263f071b5cf4817c6cff2b5b491f109f3d41d5ca44e6b326

Observation d6a8ca65-dc7e-4cda-b00a-7d889a5e6cc4 · outbound

This paper cites Sublinear Algorithms for (.

Graph k-Coloring in Average Sublinear Time Sublinear Algorithms for (

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.500751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.500751Z digest=sha256:299959ed188b1357066174c5f0e57bb92da66b3d756269806fb3b664f8967a16

Observation caa96760-74b4-48ec-b47a-54f26438906b · outbound

This paper cites Palette Sparsification Beyond (.

Graph k-Coloring in Average Sublinear Time Palette Sparsification Beyond (

Reference 54

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.114938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.549069Z digest=sha256:82174404fecf336f14eaa99e92868a371b9a192702b8503a35ef752e23ab0872

Observation 0cf41ade-ac2b-4799-94fd-c5fad10cf933 · outbound

This paper cites Improved Sublinear Algorithms for Classical and Quantum Graph Coloring.

Graph k-Coloring in Average Sublinear Time Improved Sublinear Algorithms for Classical and Quantum Graph Coloring

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.623912Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.623912Z digest=sha256:89eb78ca15352e10d2514b31cabeae156f04995dfdbf75d656f191b4e18b3838

Observation e176e460-86de-4e01-a829-7fb13d9836aa · outbound

This paper cites TheoretiCS , volume =.

Graph k-Coloring in Average Sublinear Time TheoretiCS , volume =

Reference 56

Resolution
verified exact
doi, observed 2026-08-01T13:04:33.034942Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.689115Z digest=sha256:ee7810abc6c3f7efb508db07c0a283d0e458e75dc24e4621e35f92275c626850

Observation 407a958a-a7ff-402b-96fb-5c7c14cd8c81 · outbound

This paper cites an unresolved cited work.

Graph k-Coloring in Average Sublinear Time Unresolved cited work

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.746366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.746366Z digest=sha256:732f7fa363994dcb64d59a16715ce95a5e354693dbdb1ba77969f0e14affc508

Observation a9cfd449-e08e-433e-99b9-4b54ee6234ec · outbound

This paper cites The Complexity of (.

Graph k-Coloring in Average Sublinear Time The Complexity of (

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-01T13:00:58.848641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T13:00:58.848641Z digest=sha256:40bbdf891c5e7313d85a5a204ca67bfb6c11d49614b76a26964c81e01944c8a5

Pith citing papers

No inbound Pith citation observations are available.