Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T12:43:47.775180Z
Paper Citation Record · LEDGER
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.06821.
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-16T06:30:59.297886+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
18 of 18 outbound references displayed
- verified exact0
- verified fuzzy12
- unresolved6
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation dd9a6ce5-421b-4867-a99e-140f286b6f1e · outbound
This paper cites Primes is in P.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Primes is in P
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.142552Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c3f80f4c-3cd6-4926-84da-93fa65d8eb77 · outbound
This paper cites Recherches analytiques la th´ eorie des nom bres premiers.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Recherches analytiques la th´ eorie des nom bres premiers
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.123459Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation e45d44c9-de07-4785-bab0-92ca6a8e680f · outbound
This paper cites Chromatic number and complete graph substructures for degree sequences.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Chromatic number and complete graph substructures for degree sequences
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.104753Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 20a9ed3f-8567-42a2-95a2-aeeabbf6178b · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 4
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:48.083219Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ef800be1-3c56-4b85-9a81-6aa2f93e5a3e · outbound
This paper cites Favaron, M.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Favaron, M
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.065147Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 12a26fbb-7141-42fd-bb24-b13a00ece6fb · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:48.048098Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 8be25b0b-9c38-4fae-8a67-0ce013dac161 · outbound
This paper cites Garey and David S.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Garey and David S
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.028802Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b2523eae-66cf-4ba3-9145-30ba4b86f4a1 · outbound
This paper cites Hadamard.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Hadamard
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:48.008101Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 06c136e8-e622-4c72-a8ad-51763acec8e4 · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 9
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:47.987599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7a080045-a72d-44b8-8241-d087e6a79e99 · outbound
This paper cites Faster pseudopolynomial tim e algorithms for subset sum.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Faster pseudopolynomial tim e algorithms for subset sum
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.970482Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 4d6d3e9e-187b-417f-8f50-2c86cd3f8280 · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 11
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:47.952064Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3d9f9308-344d-4e6d-820c-30440497049a · outbound
This paper cites Lower bounds on the stability number of graphs c omputed in terms of degrees.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Lower bounds on the stability number of graphs c omputed in terms of degrees
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.935076Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 814a5751-587c-4329-a8fd-ea3197695714 · outbound
This paper cites Degree sequences and chromatic numbers of g raphs.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Degree sequences and chromatic numbers of g raphs
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.915956Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 49280805-8062-40c0-b898-92afcbbcff3a · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 14
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:47.895221Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9b031986-85a2-456e-9641-90e7f82a6dd3 · outbound
This paper cites Alley CATs in search of good homes.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Alley CATs in search of good homes
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.877426Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c77ade04-ad9e-4780-aaee-4ef930cd8831 · outbound
This paper cites an unresolved cited work.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Unresolved cited work
Reference 16
- Resolution
- unresolved
- raw_fallback, observed 2026-08-14T12:43:47.858652Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 80101ced-dc0d-49d5-973b-3e3a34ae8976 · outbound
This paper cites Efficient counting of degree sequences.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences Efficient counting of degree sequences
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.841290Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 29d4f82d-e7ba-4934-a011-99b60a6bb0ab · outbound
This paper cites A short constructive proof of A.R.
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences A short constructive proof of A.R
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:43:47.819564Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.