Paper Citation Record · LEDGER

Tight bound for the skew Hamming set-pair problem

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

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

pith.paper-citation-record.v1
2607.17261 v1

Coverage vector

measured 11 of 11 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T18:39:27.368846Z

measured 11 of 11 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+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

11 of 11 outbound references displayed

verified exact5
verified fuzzy0
unresolved6
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5ff2d9e8-88f6-41d9-a605-ff0e19c9fabb · outbound

This paper cites The Helly number of Hamming balls and related problems.

Tight bound for the skew Hamming set-pair problem The Helly number of Hamming balls and related problems

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:26.819710Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f504a6e-62f7-4e2d-9556-60046a590950 · outbound

This paper cites Bollob´ as, On generalized graphs,Acta Mathematica Academiae Scientiarum Hungaricae16(1965), 447–452, doi:10.1007/BF01904851.

Tight bound for the skew Hamming set-pair problem Bollob´ as, On generalized graphs,Acta Mathematica Academiae Scientiarum Hungaricae16(1965), 447–452, doi:10.1007/BF01904851

Reference 2

Resolution: verified exact; doi, observed 2026-08-01T18:43:26.705390Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation b2580aa5-9aa7-4d85-80cc-7a1b5f8deddc · outbound

This paper cites Eiben, T.

Tight bound for the skew Hamming set-pair problem Eiben, T

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:26.930952Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cbe0bf68-6cc2-4bc1-8bcd-189403afff69 · outbound

This paper cites Frankl and N.

Tight bound for the skew Hamming set-pair problem Frankl and N

Reference 4

Resolution: verified exact; doi, observed 2026-08-01T18:43:26.675396Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation e7d55a4c-d6ab-4717-8f82-17472638316d · outbound

This paper cites F¨ uredi, Geometrical solution of an intersection problem for two hypergraphs,European Journal of Combinatorics5(2) (1984), 133–136, doi:10.1016/S0195-6698(84)80026-8.

Tight bound for the skew Hamming set-pair problem F¨ uredi, Geometrical solution of an intersection problem for two hypergraphs,European Journal of Combinatorics5(2) (1984), 133–136, doi:10.1016/S0195-6698(84)80026-8

Reference 5

Resolution: verified exact; doi, observed 2026-08-01T18:43:26.576037Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation d8af6ec2-bbfe-4ba5-b105-0e94acf6dd01 · outbound

This paper cites Heged˝ us and P.

Tight bound for the skew Hamming set-pair problem Heged˝ us and P

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:27.061984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36a96122-103b-4040-8162-1a9f091c5d37 · outbound

This paper cites Kalai, Intersection patterns of convex sets,Israel Journal of Mathematics48(2–3) (1984), 161–174, doi:10.1007/BF02761162.

Tight bound for the skew Hamming set-pair problem Kalai, Intersection patterns of convex sets,Israel Journal of Mathematics48(2–3) (1984), 161–174, doi:10.1007/BF02761162

Reference 7

Resolution: verified exact; doi, observed 2026-08-01T18:43:26.473958Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 68b9de89-4914-4d44-8208-da33d1abc673 · outbound

This paper cites Lov´ asz, Flats in matroids and geometric graphs, in P.

Tight bound for the skew Hamming set-pair problem Lov´ asz, Flats in matroids and geometric graphs, in P

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:27.196436Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6b5db3a-bfd0-4f53-8728-b5ea44b8b291 · outbound

This paper cites Online Learning with Set-Valued Feedback.

Tight bound for the skew Hamming set-pair problem Online Learning with Set-Valued Feedback

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:27.262255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b58fce7f-5386-410f-a6d7-57b2ca890b9d · outbound

This paper cites Tuza, Inequalities for two set systems with prescribed intersections,Graphs and Combinatorics3 (1987), 75–80, doi:10.1007/BF01788531.

Tight bound for the skew Hamming set-pair problem Tuza, Inequalities for two set systems with prescribed intersections,Graphs and Combinatorics3 (1987), 75–80, doi:10.1007/BF01788531

Reference 10

Resolution: verified exact; doi, observed 2026-08-01T18:43:26.352097Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.

Observation 4d7d0745-7230-4757-bbbd-da18e126c601 · outbound

This paper cites Tuza, Applications of the set-pair method in extremal hypergraph theory, in P.

Tight bound for the skew Hamming set-pair problem Tuza, Applications of the set-pair method in extremal hypergraph theory, in P

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T18:39:27.368846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.