Pith. sign in

Paper Citation Record · LEDGER

Graph k-Coloring in Average Sublinear Time

As of 22 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-21T06:32:19.484+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:cbd4a7911bcf48f3aae8ab363c63e057ef0d1b192eefc939aa4b1909756fe76f

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:3f55b983b2ce48042d87807f7637aa3859900b1cef7cbb826f836bb053183c76

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:7d06445637ec88123bccc4d3eafb4c0f9798df09b712d13ac42fda46a4ad2115

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:42609b3f8e6981b62faeec146f6b849e3666610dc71ff2cd99a9a5f53354689a

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:23bc245590c4ef615d5f8181b239b713368266ab51053d527b27e40638bae4a1

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:a5ddfba052ab50106728c96dfb11d0cc8dd5b9686b875e31092e7182c059819d

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:1afdacaebe7991b0c803ac8cf9bf1039044519ed89b7902fd9feceecb029daaf

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:d58895ee19da6fe91bfc5f44c167c63e2dff5e1b3a89153ba494693cabb3d031

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:33e8725fd6481efa5d82fbeaf55cb7aa4f36b1eb0bfa90ad8030517167dda1c2

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:fa386f4c35417e3a565e5b3ed32cea3221fb98c666fee2b3a03e038214c4382e

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:0f884811c724e00854d7c677ec726f4f948baa39e9f6ea0b4be2869ab90519a4

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:fd4467123b3af8f12be101f134990f5785e38b0e8c7c3073ec862839a76648b5

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:9dd96bb39f5dc0eded0e123b992c1bd9c941d38b220846f420441dde3b8806f7

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:db917ba10869ddfde68b4ee7e3adbd349cae66d1f2e5971881d851eca1edb549

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:0719afae31822053bde3d323c0fcd440a8ac05b22a5e47412560ce0d5effcb3f

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:de441c4f0aacda43c4145e83aedb5ffeefe8d70c8f5ce4b140cf85b44795dda9

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:8b1cd3c2ddad82f0cd5c0ad3345204ff1da4f10ff6a2c15c37a26051df5ab478

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:5e5731e964d53bcc662fe9aecdbb501289800fbace10da69c9ec0887c0027b58

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:b4f3b1ba8e24756d33356d4382fda72bf2bfd125b635f4a265c542f1c1317860

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:720abe6d891c8d919a7a6eab6075020bd094acbae86ddb40c8ed335a0b1ad25c

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:ce97706d1c503987840f8ea4a64c17665e7e2be006834f75f451a51a4dfd024f

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:f03e9b24e760d285cbc898c2252360070fd7780612c924901fb587d7367e5d83

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:31bf22f72d32b0ddf9e339cdfb724aa1801c8cedd5052114026e5fcac8213d78

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:3895810ef7ad08acfe086afabf5367ec8ab5ca0fe16dbcd3f7a0138eaca4cfc3

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:3724bebd6e1f4ddef052d1d2375383f2853d9fa01fec691d61499e5fad501fcc

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:17db0b99dc246e00d33dadcb89c4268de2549ccd34c390399d5177e485ea2447

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-21T06:32:19.484+00:00.

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

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:4717fe06fa226354e7d0046283cd7064e1872f9673516e274d84961aebb9cf52

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:e06323c394c03a3be5f031d1c8ad2255486cfcb89afaca59c33a34db477d5b57

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:47274a083a60ecd06897664d76ba08c7bbd3ae636b2fa562d9dbba7b16a6aa1e

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:5385179ebce0a0effb6ac0864220757da2c50c7a7ba8cd7710e285308ca427cc

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:bb0007163931040f51e38835878e819af530e2827a42360732ba33e66df65157

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-21T06:32:19.484+00:00.

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

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-21T06:32:19.484+00:00.

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

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:662554a08898b924af7dd19766d9c6ab8e8c086da5a6c743317d892a53308e6f

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-21T06:32:19.484+00:00.

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

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-21T06:32:19.484+00:00.

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

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:734fe02b9e18e0b2b9b3c70a80a7eeb00d7ac881691f4ecea0973e3a862504c7

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-21T06:32:19.484+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.600969Z digest=sha256:419e9f0b9d91abe1093e562506dfd02e19c089fce2a9b58a05c952fb884ab886

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-21T06:32:19.484+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.651246Z digest=sha256:606fefc5d7ab483c172861e691330f760f202a48f17782104caee9322482e790

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-21T06:32:19.484+00:00.

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

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-21T06:32:19.484+00:00.

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

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-21T06:32:19.484+00:00.

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

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:ad56f10b9448b64ed2d1299a2f75494ed1b27535fd0ad8a2a0b109b7222c8f48

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-21T06:32:19.484+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.089424Z digest=sha256:07f2f981ff2707c9e808c6b22b48ef5b7d2d23f220ab6ebd392af3f2199b986f

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:71e5042d3e65792d8379cecb0a5f8e59e9bab60cfc4abcd7a49a7ae2e31fdb60

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:668b51164143a580ed3040fc11f1138be089b29454ffd014e058a1e7ebb88881

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-21T06:32:19.484+00:00.

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

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-21T06:32:19.484+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.305353Z digest=sha256:4ab4f5f07b4becbb98587740df5e889ab7373a1d83b10ec5ecf8d46e38ae5fa2

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-21T06:32:19.484+00:00.

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

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:4f7e777fd73cb675c1d2cc97e4640228608598bbcc8cea5f52345ce709e3f154

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-21T06:32:19.484+00:00.

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

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:456ac66d562b763c534ad8a43af2978d67b39ada40dcd53158c07aeb9b14fff1

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-21T06:32:19.484+00:00.

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

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:150f8e82d0f36cc1845ad53b50dc46e0d9c091dce2b54447f5450d6fde36b76d

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-21T06:32:19.484+00:00.

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

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:dc103c9ecb2dae017062d77ca8f715f5c6e2589c40ff7fccf02a9aa7519e1f75

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:8ad8a10a07f2941db879eb90cc4842d72ac934696d4267c0f1d5cbfb60460091

Pith citing papers

No inbound Pith citation observations are available.