{"as_of":"2026-08-16T10:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e06f63ec82ef48a4f614c55c73298e03b98e982a7e7431e31e618f5d638e6acf","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:46:03.913848Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T05:49:44.362931Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T05:49:44.494599Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"cited_work":{"arxiv_id":"1908.06541","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06541","snapshot_observed_at":"2026-08-05T05:49:44.494599Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","venue":"cs.DS","work_id":"f00d95e3-3290-4a4d-a553-b1c8c7fb9d97","year":2019},"citing_paper":{"arxiv_id":"2509.05143","last_updated":"2025-09-05T14:36:30Z","snapshot_observed_at":"2026-08-05T05:49:40.365077Z","submitted_at":"2025-09-05T14:36:30Z","title":"Color-avoiding connected colorings and orientations","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-05T05:49:44.362931Z"},"links":{"cited_paper":"/paper/1908.06541","citing_paper":"/paper/2509.05143"},"observation_digest":"sha256:1f9ca474d1504266701199cfd83043a4ae364e43e52d32995cd8598278524bc9","observation_id":"90533c53-453d-4d1e-853f-3499a41ffe1d","resolution":{"observed_at":"2026-08-05T05:49:44.508539Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/1908.06541/citation-record","integrity":"/paper/1908.06541/integrity","json":"/paper/1908.06541/citation-record.json","paper":"/paper/1908.06541"},"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:46:04.104887Z","title":null,"venue":null,"work_id":"b9ce4672-a16e-4f00-ae47-639f1bd566f2","year":2007},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.861050Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:c33914f150e7ce3d1e8ea10df7e999cd907586f8905d776fa30cf229922e4d19","observation_id":"49ed167a-f3e5-442e-b561-eeba1dc40405","resolution":{"observed_at":"2026-08-14T12:46:04.108438Z","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:46:04.091821Z","title":"”Two formal analyses of attack graphs.” In Proceedings 15th IEEE Computer Security Foundations Workshop","venue":null,"work_id":"47ac2206-519a-49e9-ad2b-db53a6d21001","year":2002},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.865344Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:0f82638ab81de0591569d1154e0f1808a7d3b3acd9ba316a28d65eba003096fe","observation_id":"5b2294da-9214-4701-9dfd-0c328cb8fb3b","resolution":{"observed_at":"2026-08-14T12:46:04.096789Z","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:46:04.080065Z","title":"”Approximation and hardness results for label cut and related problems.” Journal of Combinatorial Op- timization 21, no","venue":null,"work_id":"2f541045-d42c-4408-9306-f2ccf15f4a9d","year":2011},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.869231Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:040b6beff56755174c08dcc309f191fec51ceaa13f8a1c9db9e3bcaebea14f6a","observation_id":"630f4f71-241f-4ee3-ae8e-c321bdcabc26","resolution":{"observed_at":"2026-08-14T12:46:04.084329Z","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:46:04.069201Z","title":"”Approximating minimum label s-t cut via linear programming.” In Latin American Symposium on Theoretical Informatics, pp","venue":null,"work_id":"19cb38fc-76d9-4d29-ad4f-58d37f667917","year":null},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.873122Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:3bba9262998db703cf7c3d46bb883223ad769f92eac8d0f61f9fc1d6afe3c2d6","observation_id":"e9cbf81e-893e-4acf-9b01-2024f3205f44","resolution":{"observed_at":"2026-08-14T12:46:04.073373Z","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:46:04.047265Z","title":"Woeginger, and Shenggui Zhang","venue":null,"work_id":"6e50e60f-9954-4c8a-9647-099267ce391c","year":2005},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.880859Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:71068e1a817692cf7359bc67085a604273b89665ea18cd133c527c08d651e1d6","observation_id":"050294cc-0835-4b16-a27d-1f22ae3a6ee2","resolution":{"observed_at":"2026-08-14T12:46:04.050996Z","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:46:04.036334Z","title":"”The parameterized complexity of some minimum label problems.” Journal of Computer and System Sciences 76, no","venue":null,"work_id":"34152997-285a-4250-b540-c49664f7e876","year":2010},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.884593Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:f7c00f378157b525ba4ab8d772404812c14b08e6b3f24f20d0f0239dd56698fc","observation_id":"9398e0f6-94a1-4a96-b3f9-9149b526eeb4","resolution":{"observed_at":"2026-08-14T12:46:04.040053Z","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:46:04.024745Z","title":"”A graph theoretic model for complex network failure scenarios.” In Proceedings of the Eighth INFORMS Telecommunications Conference, Dallas, Texas","venue":null,"work_id":"70ad5ac9-8eed-4f32-85f4-6344551ce8d4","year":2006},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.888355Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:304f16a248725d3cf001b455105b9a52a4da0682df3a5076b716c223d23ff516","observation_id":"ae5b237c-dc09-49a8-8aac-37ed423ab057","resolution":{"observed_at":"2026-08-14T12:46:04.028906Z","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:46:04.012842Z","title":"”Efficient algorithms for the label cut problems.” In International Conference on Theory and Applications of Models of Computation, pp","venue":null,"work_id":"8ddb7f19-c7c1-4544-a600-7596fbe1943c","year":2014},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.891843Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:61a6f9c1f1fdaa09804e1877bccce947e442f36c5a81d79c757346131608c681","observation_id":"177684cf-586b-4f57-b942-b53ac33a32cc","resolution":{"observed_at":"2026-08-14T12:46:04.017639Z","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:46:04.002127Z","title":"Karger, and Debmalya Panigrahi","venue":null,"work_id":"a5fb8fa0-3222-4418-8cd1-69cc91fa97fd","year":null},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.895393Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:2d24e42d5b9447c41052d6722ef903ae3971a5a28dea991b6dfe0716c08e6c84","observation_id":"f17e1411-bbde-4df3-91af-768963df7e6e","resolution":{"observed_at":"2026-08-14T12:46:04.005597Z","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:46:03.978870Z","title":"”Pseudorandom sets in grassmann graph have near-perfect expansion.” 2018 IEEE 59th Annual Symposium on Foun- dations of Computer Science (FOCS)","venue":null,"work_id":"b613c7d2-3a9a-4f4c-a6ab-91e0b4f277c2","year":2018},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.902762Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:7e4f114f08a6ce42cf39e11a05e158b58c11d5476ff63f684e136c71e82789ee","observation_id":"c12810f6-aeaf-47b2-9252-6280c3b12a1f","resolution":{"observed_at":"2026-08-14T12:46:03.982625Z","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:46:03.966545Z","title":"”On the hardness of approximating minimum vertex cover.” Annals of mathematics (2005): 439-485","venue":null,"work_id":"31aac806-3f4f-4671-a70d-15ea63f97a8d","year":2005},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.906429Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:11d55a230125bc5e5dc5d4a39dabe43b56c19622efc0b7b7ee3bb31f7de63b9d","observation_id":"ed9b8c78-1e5f-4724-a31d-7fce1f2432ab","resolution":{"observed_at":"2026-08-14T12:46:03.971174Z","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:46:03.955052Z","title":"”Reducibility among combinatorial problems.” Complexity of computer computations","venue":null,"work_id":"e75b767e-6b3b-4069-a33c-402e5c953292","year":1972},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.910515Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:ba7c64a3f9d2bd0cf2533443c5e008ce8410d05c30bb1dd352364e31111c6714","observation_id":"67777685-d1b7-4791-a0cc-d04b59ac508a","resolution":{"observed_at":"2026-08-14T12:46:03.958814Z","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:46:03.942259Z","title":"”On weighted vs un- weighted versions of combinatorial optimization problems.” Information and Com- putation 167.1 (2001): 10-26","venue":null,"work_id":"5382093e-dfa0-4fa4-9c1b-17143d68b5d7","year":2001},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.913848Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:9283efc7beb868bcc8b728e854d6820068cecd8dcde1e7d06cddef5b2bc6f9b8","observation_id":"ef4664fe-b48e-45bb-a64f-04bb7e31db05","resolution":{"observed_at":"2026-08-14T12:46:03.947730Z","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:46:04.058514Z","title":null,"venue":null,"work_id":"0fbb6e7b-aa00-4930-84c0-a3da7a3c3af0","year":2012},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":666,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.876954Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:beb936a9b8ce7231fa70144898723fb5ec66f3a09cef3d48cf86759b67b2ba43","observation_id":"461dd268-c81c-4e84-b8ae-41e4a9bde65e","resolution":{"observed_at":"2026-08-14T12:46:04.062303Z","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:46:03.990478Z","title":null,"venue":null,"work_id":"61d2456e-daee-4393-8031-63007e9d9124","year":2017},"citing_paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem","version":2},"reference_index":1114,"source":"pdf_text","source_observed_at":"2026-08-14T12:46:03.899299Z"},"links":{"citing_paper":"/paper/1908.06541"},"observation_digest":"sha256:77b8a436f350b0df09357442f548997ca8737a854f491cd7a4c632800fa12679","observation_id":"83c2c1ee-1e43-4957-9316-880cc6705fa2","resolution":{"observed_at":"2026-08-14T12:46:03.994453Z","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"}}],"paper":{"arxiv_id":"1908.06541","last_updated":"2019-08-20T09:36:43Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T08:17:57.130946Z","submitted_at":"2019-08-19T00:12:06Z","title":"The Landscape of Minimum Label Cut (Hedge Connectivity) Problem"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":15},"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 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:1908.06541."}