Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-07T13:40:17.344835Z
Paper Citation Record · LEDGER
Karp's patching algorithm on dense digraph
As of 8 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2505.21645.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
11 of 11 outbound references displayed
- verified exact0
- verified fuzzy11
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 386e4662-1a8f-4646-8100-f118a36ce79b · outbound
This paper cites Ahuja, T.
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:20.138119Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation eb2448b0-bcd7-42e6-9cae-c186392f62fa · outbound
This paper cites Bohman, A.M.
Karp's patching algorithm on dense digraph Bohman, A.M
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:19.935399Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 919b532a-c0a5-4771-8108-96ec56c9ea12 · outbound
This paper cites Broder, How hard is it to marry at random, ? (On the approximation of the permanent), Proceedings of the 18th Annual ACM Symposium on Theory of Computing , ACM Press, 1986, 50–58.
Karp's patching algorithm on dense digraph Broder, How hard is it to marry at random, ? (On the approximation of the permanent), Proceedings of the 18th Annual ACM Symposium on Theory of Computing , ACM Press, 1986, 50–58
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:19.773815Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e339db47-fca5-43f3-bc90-5e819dede4d4 · outbound
This paper cites Dyer and A.M.
Karp's patching algorithm on dense digraph Dyer and A.M
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:19.545048Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5d57c2f3-2305-4f97-9a31-cf344126570e · outbound
This paper cites Frieze nd M.
Karp's patching algorithm on dense digraph Frieze nd M
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:19.224810Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation e985723a-532b-4a02-a4c4-0836c5df723f · outbound
This paper cites Frieze and P.
Karp's patching algorithm on dense digraph Frieze and P
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:18.930671Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 413ed20c-36e4-4826-99ca-28b713ded626 · outbound
This paper cites Frieze and G.
Karp's patching algorithm on dense digraph Frieze and G
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:18.640648Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 338bb2e0-6eb2-4070-9d33-dd9026595009 · outbound
This paper cites Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13-30.
Karp's patching algorithm on dense digraph Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13-30
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:18.330532Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d8a505ed-8db0-4ef8-9073-2e858f445b67 · outbound
This paper cites Karp, A patching algorithm for the non-symmetric traveling salesman problem, SIAM Journal on Com- puting 8 (1979) 561–573.
Karp's patching algorithm on dense digraph Karp, A patching algorithm for the non-symmetric traveling salesman problem, SIAM Journal on Com- puting 8 (1979) 561–573
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:18.030680Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation b2f650f0-bee8-43c3-a8e4-317943b35de0 · outbound
This paper cites Karp and J.M.
Karp's patching algorithm on dense digraph Karp and J.M
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:17.819275Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 79f86019-6f65-4330-b767-6e15a724cfe2 · outbound
This paper cites McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, ed.
Karp's patching algorithm on dense digraph McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, ed
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-07T13:40:17.524848Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Pith citing papers
No inbound Pith citation observations are available.