{"as_of":"2026-08-16T10:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e3c631fe780cff0f787b7e4aff4b90eda1096973d9c2b5c98082c9caa0cdb96","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:43:47.775180Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.06821/citation-record","integrity":"/paper/1908.06821/integrity","json":"/paper/1908.06821/citation-record.json","paper":"/paper/1908.06821"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.137085Z","title":"Primes is in P","venue":null,"work_id":"42fa3f41-6f51-4fe9-b55c-658534826873","year":2004},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.679814Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:4a4880a5aa0f685eb89fdce3baee0047b4cd948ef4100b16ddcb77649a8552bf","observation_id":"dd9a6ce5-421b-4867-a99e-140f286b6f1e","resolution":{"observed_at":"2026-08-14T12:43:48.142552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.117355Z","title":"Recherches analytiques la th´ eorie des nom bres premiers","venue":null,"work_id":"935e98cd-aa0d-4ebc-95e0-15e2b710ad05","year":null},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.685190Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:c7067080f236d3a796904d59e946e7d07a3c4233dc272245909d5cacf2f64d20","observation_id":"c3f80f4c-3cd6-4926-84da-93fa65d8eb77","resolution":{"observed_at":"2026-08-14T12:43:48.123459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.096812Z","title":"Chromatic number and complete graph substructures for degree sequences","venue":null,"work_id":"992c72b8-5461-4e23-a1ea-2ac09d43fe88","year":2013},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.690963Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:d7e036c68a18ba22184ceb90247045d96250ea5a4af66635d75461b9ca357c05","observation_id":"e45d44c9-de07-4785-bab0-92ca6a8e680f","resolution":{"observed_at":"2026-08-14T12:43:48.104753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.077736Z","title":null,"venue":null,"work_id":"d32add1e-4390-4261-b184-d67c5fc2b1b6","year":1977},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.696453Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:90c5c9b116e00f7ed59233f350b1006f33d81296db5932c48efd2fef4cf97d06","observation_id":"20a9ed3f-8567-42a2-95a2-aeeabbf6178b","resolution":{"observed_at":"2026-08-14T12:43:48.083219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.060236Z","title":"Favaron, M","venue":null,"work_id":"cd7e3650-1ebe-4729-b42b-7e2c926cdd19","year":1991},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.701563Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:36ea5081a534e34391dc52c187487bcd0e8d0a53067995517864f3d8037407cc","observation_id":"ef800be1-3c56-4b85-9a81-6aa2f93e5a3e","resolution":{"observed_at":"2026-08-14T12:43:48.065147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.042293Z","title":null,"venue":null,"work_id":"2c502e52-1e8e-4253-b0cd-36fec8a77194","year":1957},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.707338Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:a6fa650cfc60332f9b5a9ab5d5f3332cd066056619e0859d615122229489fc09","observation_id":"12a26fbb-7141-42fd-bb24-b13a00ece6fb","resolution":{"observed_at":"2026-08-14T12:43:48.048098Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.022405Z","title":"Garey and David S","venue":null,"work_id":"c4c41e17-9d84-478b-9263-052e9067ed5e","year":1979},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.713281Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:091306c3963f93fa5d517a2520a288a05d41deaf147dd29a6d514b46e38e2d84","observation_id":"8be25b0b-9c38-4fae-8a67-0ce013dac161","resolution":{"observed_at":"2026-08-14T12:43:48.028802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:48.001895Z","title":"Hadamard","venue":null,"work_id":"cdb984cf-d818-4509-ab67-c20dd9688c9b","year":null},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.719475Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:9163d9d44040be68896fd13f02b3b0a0b1a8bc2dd467d850810ec956cad1bcc8","observation_id":"b2523eae-66cf-4ba3-9145-30ba4b86f4a1","resolution":{"observed_at":"2026-08-14T12:43:48.008101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.982420Z","title":null,"venue":null,"work_id":"2d673276-ca1f-484a-b659-1b37878c458d","year":1981},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.725003Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:fb07db7600355732ca56f62721332a7e3d6680856d23ad6664e63758381835b6","observation_id":"06c136e8-e622-4c72-a8ad-51763acec8e4","resolution":{"observed_at":"2026-08-14T12:43:47.987599Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.964006Z","title":"Faster pseudopolynomial tim e algorithms for subset sum","venue":null,"work_id":"909017e1-66c7-4bae-86fd-3c14e734ecff","year":2019},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.731447Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:f63d66b099cb505e44e0db65a0312bf6b78c03ba7699d55b84f1a2e81a35c720","observation_id":"7a080045-a72d-44b8-8241-d087e6a79e99","resolution":{"observed_at":"2026-08-14T12:43:47.970482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.947190Z","title":null,"venue":null,"work_id":"13e14466-4eb3-4dd0-9c27-46ffef21aadf","year":1907},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.738180Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:d53cbe3cb70d6866c738656120404033ea71af60145f46da0a6635025391f93b","observation_id":"4d6d3e9e-187b-417f-8f50-2c86cd3f8280","resolution":{"observed_at":"2026-08-14T12:43:47.952064Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.929229Z","title":"Lower bounds on the stability number of graphs c omputed in terms of degrees","venue":null,"work_id":"142b9a0f-e467-407d-88ef-bd7811bcc7a2","year":1991},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.744203Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:6f991cf75a4d9cc9728808a86fcc9ef7301184b75bab88b970a9b992df0b01b8","observation_id":"3d9f9308-344d-4e6d-820c-30440497049a","resolution":{"observed_at":"2026-08-14T12:43:47.935076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.909708Z","title":"Degree sequences and chromatic numbers of g raphs","venue":null,"work_id":"fcec7522-16b0-4858-8d20-a39229af3204","year":2002},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.749706Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:827bb067c192e5e03fc25ed74c54a8698c7f8cc81fdbbf948960e95c1eee8beb","observation_id":"814a5751-587c-4329-a8fd-ea3197695714","resolution":{"observed_at":"2026-08-14T12:43:47.915956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.889897Z","title":null,"venue":null,"work_id":"d097ef56-4728-4592-99fe-2e9b50a2e5dd","year":1981},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.754999Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:a277257d03227b0a454433d7fc6db608394fd8d8a4a6d71ebe83058d24fb29a7","observation_id":"49280805-8062-40c0-b898-92afcbbcff3a","resolution":{"observed_at":"2026-08-14T12:43:47.895221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.871502Z","title":"Alley CATs in search of good homes","venue":null,"work_id":"c51dac57-a8e1-4df6-98d2-56878858fbbd","year":1994},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.759352Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:f3d854cc13c07d033406463a61cbd2b428336f1e63209a0c6b746fcf1d35293c","observation_id":"9b031986-85a2-456e-9641-90e7f82a6dd3","resolution":{"observed_at":"2026-08-14T12:43:47.877426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.853164Z","title":null,"venue":null,"work_id":"62ca0724-8e34-4366-97c7-646fa073f0a4","year":1957},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.764652Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:b9af65036f70c5fe0b1854853e01c894045cca8f0e1b27d49a28a815e021466e","observation_id":"c77ade04-ad9e-4780-aaee-4ef930cd8831","resolution":{"observed_at":"2026-08-14T12:43:47.858652Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.834997Z","title":"Efficient counting of degree sequences","venue":null,"work_id":"6c87e07e-9053-424b-ab09-c4ee760e6049","year":2019},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.769676Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:72e7ead2d9e424eeb14cdcfcab9731aaa055d81ecd1f2a0393ee305f4b9535a7","observation_id":"80101ced-dc0d-49d5-973b-3e3a34ae8976","resolution":{"observed_at":"2026-08-14T12:43:47.841290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:43:47.811495Z","title":"A short constructive proof of A.R","venue":null,"work_id":"855792d0-f25b-46a1-bff3-e91beed4d785","year":2012},"citing_paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:43:47.775180Z"},"links":{"citing_paper":"/paper/1908.06821"},"observation_digest":"sha256:e2ced8120c27156023d4254521923c672790104df6bb0407c92b467e8c739d9a","observation_id":"29d4f82d-e7ba-4934-a011-99b60a6bb0ab","resolution":{"observed_at":"2026-08-14T12:43:47.819564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06821","last_updated":"2019-08-19T14:13:31Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T04:46:15.352979Z","submitted_at":"2019-08-19T14:13:31Z","title":"An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"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."}