Pith. sign in

Paper Citation Record · LEDGER

Graph k-Coloring in Average Sublinear Time

As of 20 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-20T06:33:59.587034+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:8bddd9fbd1ed6e603dbb92b367f84acd36cf1f2cb33e879d94fc74515e5258ea

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:13d6f704932e35635f1e85bda3fb3e3937cb2f80bc9e392c31bf6608477d0867

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

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

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:6e1a348f7b71ab111fedef5ae1f69de3edaa93db937aac2642666eb02614f572

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:258106e0f5bdac16a421b554ae396354bf32a747c18de537b0fc4083cbc043b9

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

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:731c4462459f41db8695d28e3381277a92089eb200ce1c1bd44590981f6177ad

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

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:960643ab13e29488402a9aa46c8507120aa205f270b21bfbd8f2ac696a78baec

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

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

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

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

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:84d3e0a111388b499bb87a62f8bfd28b0588f53cd01ed26da7661a39ee0f3322

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

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:4741a94f340dcbd2c4f8afa88708e00bda60cf1dde09c37f59e4fe7580466ffc

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:550304d196182b50d0928e76506cdc79d5133cda556ccb3751db2804f9a1068e

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

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

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

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

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

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

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

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

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-20T06:33:59.587034+00:00.

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

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

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

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:30f0d0398dd53234505e452b6e5e0c7277ab63982a9d1ffe68e08b996a2237f8

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:326bc365976201f588abb1b88cd9c4c78afe5ce49ddfef7b35916865f7455f78

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:36e3ab5a26dcd69953534485cbde9867065f28471e086294299eed0186b9e14a

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.600969Z digest=sha256:4ba7d40fd2bec4c92f95b83a84ef3ff4b7b5f287880376bfd260422c2abb7067

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-01T13:00:57.651246Z digest=sha256:8b69c22c8af00a24584d2623bb72904167f35b57501e827d751847d7dd49ccea

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

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

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

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.089424Z digest=sha256:82a15c355576027d1c469e7f82a2d4e9372bafecdd02898c3d508c8955604948

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:5109ff134285e5bf6e84c62d760b98fd9f365213dbd00c0f78cc310b48abebc0

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:36a02a5c1cb066cfc3d2fa26ab0d25a5e2daa1617ba3709169173b2bddfed1fa

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-20T06:33:59.587034+00:00.

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

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-20T06:33:59.587034+00:00.

source=arxiv_source observed=2026-08-01T13:00:58.305353Z digest=sha256:8406ffb7643a223d8922dcd19626120f7ff45cc00d7e4ae98c5ac5b00c497e18

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-20T06:33:59.587034+00:00.

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

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:76b9bb01c7e8229b0d111efd442f7456dd8f0136bb688ec1efb2e1dae194e18f

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-20T06:33:59.587034+00:00.

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

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

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-20T06:33:59.587034+00:00.

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

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:57e131fe1bad23828c9e3d87749ae2d6f4fdbaef93c5853e9e683c270ba557c1

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-20T06:33:59.587034+00:00.

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

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

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:008316175a9ff1ee64e38a5ddce557e6ae2a4431c6c09e218f4fcecad6088a68

Pith citing papers

No inbound Pith citation observations are available.