Paper Citation Record · LEDGER

On odd covers of cliques and disjoint unions

As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2408.08598.

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

pith.paper-citation-record.v1
2408.08598 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 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 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T16:58:54.716532Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-07-09T10:56:11.269783Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 744652f1-f966-4ba9-b318-72a0bdb28944 · inbound

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers cites this paper.

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers On odd covers of cliques and disjoint unions

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-06T16:58:54.716532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7dc54cf6-fc49-46d5-aad2-2575ad9ebb51 · inbound

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems cites this paper.

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems On odd covers of cliques and disjoint unions

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-10T22:20:47.587803Z

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.

Observation c2f60b48-6d13-4dbd-9653-fb156a30409e · inbound

Almost balanced ordered biclique covering of graphs cites this paper.

Almost balanced ordered biclique covering of graphs On odd covers of cliques and disjoint unions

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-07-02T23:27:27.988144Z

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.

Observation 23c2d150-7710-40c6-b147-db6ea002fe4c · inbound

Odd covers for complete graphs and complete 3-graphs cites this paper.

Odd covers for complete graphs and complete 3-graphs On odd covers of cliques and disjoint unions

Reference 3

Resolution: verified exact; local_arxiv, observed 2026-07-09T10:56:11.271504Z

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.

Observation bf588a91-e56c-47b0-98bd-e4fb326f88a0 · inbound

New bounds on the Graham-Pollak theorem for hypergraphs cites this paper.

New bounds on the Graham-Pollak theorem for hypergraphs On odd covers of cliques and disjoint unions

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T22:58:33.083087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.