{"as_of":"2026-08-18T16:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3cb119862e0f81bcf3ff26896661a2d772a4199acb488b61c494084aea8d8c09","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:25:07.112469Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.09278/citation-record","integrity":"/paper/1908.09278/integrity","json":"/paper/1908.09278/citation-record.json","paper":"/paper/1908.09278"},"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-14T11:25:07.292535Z","title":"Journal of Combinatorial Mathematics and Combinatorial Computing 3:71–91 (1988)","venue":null,"work_id":"f4cd3cc1-7192-4983-bee5-2b8f77886118","year":1988},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.062685Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:b157e3813e2fd55d6685f8449877accf29a24dc08e5d2cf0b343d248edc420ac","observation_id":"dcce75d1-a80f-4f6e-9d6e-f93ff6daed96","resolution":{"observed_at":"2026-08-14T11:25:07.296984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.279135Z","title":"Kocay, W.L., Stinson, D.R.: Some NP-complete problmes for hy- pergraph degree sequences","venue":null,"work_id":"97f84f62-3ce3-44d7-8da4-423f511ccf49","year":1986},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.067759Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:4632a12a7bcaf1df0eed75615c065bfc23552d61b0146cb3cf9b398aaae8a63a","observation_id":"fe254095-6b08-4ef4-9786-26347f1ad144","resolution":{"observed_at":"2026-08-14T11:25:07.283430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.265873Z","title":"Journal of Combinatorial Theory Series B 45:185–198 (1988)","venue":null,"work_id":"1062f63b-31e6-42ba-9af2-96df0280961d","year":1988},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.072340Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:f18082b18c805537a236b1066a09d1b42602f84aecc0528f728e925929d3b1f1","observation_id":"6e73fceb-8430-4cc5-a9d0-5cb52c9fc282","resolution":{"observed_at":"2026-08-14T11:25:07.270184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.252565Z","title":"SIAM Journal on Discrete Mathematics 32:2067–2079 (2018)","venue":null,"work_id":"7a338c2f-47bd-4823-8686-39696cb8681e","year":2018},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.076890Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:0cf8b9ce7e5f2c38af3d496f6bcf28bd6294f3edd1f4e5c59f7059f603494f3a","observation_id":"853813c0-df5f-4388-94b8-469ef601a868","resolution":{"observed_at":"2026-08-14T11:25:07.257231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.239192Z","title":null,"venue":null,"work_id":"42c4d1bd-0867-4ba9-876f-c12304331992","year":2019},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.081296Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:34ed7666bfccfd0c31d6520ff6e881707173c0233b9e3b42ccee3564ca2dcde9","observation_id":"4f710b30-8313-49da-b18a-46c3709177a1","resolution":{"observed_at":"2026-08-14T11:25:07.243783Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.226149Z","title":"Matem- atikai Lopak 11:264–274 (1960)","venue":null,"work_id":"7de08338-ac6c-402e-98d8-39f695e27b4c","year":1960},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.085540Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:e6eeaf0c44b9c8d4cdc7db8c1390b0fc187695cf5167da3c046824849c230a26","observation_id":"550a5623-119b-4dd3-85d5-57621a640fed","resolution":{"observed_at":"2026-08-14T11:25:07.230248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.211646Z","title":"Combinatorics, Probability and Computing 22:366–383 (2013)","venue":null,"work_id":"9f19cde7-2a90-4e0d-8afb-dcab7d81a641","year":2013},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.090455Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:d49a43d7b3ef256915a6cee474a3ad41d435f0a80cc7f3fd838f27be8bda5971","observation_id":"cf130ddf-167e-4fe6-8f39-492ff7cb03b2","resolution":{"observed_at":"2026-08-14T11:25:07.216415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.196876Z","title":"Freeman (1979)","venue":null,"work_id":"c832365f-cf58-4cc5-a2f0-92a694b5fc6b","year":1979},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.095123Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:2ed9961c9d7bdecae81dd1c4485f89017a560680607185dd09d8c79f83a13b32","observation_id":"4e0c9aae-9a9a-420f-8522-4342f548aadb","resolution":{"observed_at":"2026-08-14T11:25:07.201622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.183089Z","title":"Journal of Combinatorial Theory 8:391– 416 (1970)","venue":null,"work_id":"a9e95583-bc7e-4c1d-8332-08a954a7f035","year":1970},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.099345Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:003a306221a604ce31063aa14e5eaf2e7372c6f85f8f2401e13ff0f59e6c9e48","observation_id":"d7e47ee3-22f7-401a-824a-a99bb43b8865","resolution":{"observed_at":"2026-08-14T11:25:07.187576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.169069Z","title":"Combinatorica 7:105–113 (1987)","venue":null,"work_id":"f8577176-4b9d-40be-9591-dbb633515f5e","year":1987},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.103581Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:827badcc58b212bb8a4f963c3bd43f504aba93f47f4467042d9c7aa4dfd81497","observation_id":"7d44d695-20a2-49d4-abd3-bccb223be190","resolution":{"observed_at":"2026-08-14T11:25:07.173370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.154869Z","title":"Zurich Lectures in Advanced Mathematics, European Mathematical Society (2010), available online at: http://ie.technion.ac.il/∼onn/Book/NDO.pdf","venue":null,"work_id":"1cf51848-db53-48c2-89b4-ec2b1703580f","year":2010},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.108379Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:5d7ba90d837c53d3e9201a0a20e0f4142f0e9768a2499024ed8a6539ccf99a9a","observation_id":"fa84714e-6ef1-4206-93ea-d72549093265","resolution":{"observed_at":"2026-08-14T11:25:07.159807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:25:07.139786Z","title":"Journal of Graph Theory 31:283–295 (1999)","venue":null,"work_id":"7ddb6d64-23d4-48e8-9b4a-c73bfbea5cb4","year":1999},"citing_paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:25:07.112469Z"},"links":{"citing_paper":"/paper/1908.09278"},"observation_digest":"sha256:d1be7e2a5adee2e9aa4d0eca2eae309a01424b5a2122aa7f467847d66f843a99","observation_id":"43d7860b-db32-4fd3-b84a-43735f8ecad4","resolution":{"observed_at":"2026-08-14T11:25:07.145454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09278","last_updated":"2019-08-25T08:36:51Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T13:58:01.820342Z","submitted_at":"2019-08-25T08:36:51Z","title":"Optimization over Degree Sequences of Graphs"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":12},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1908.09278."}