{"as_of":"2026-08-18T14:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8007ca9b4133b7cfb96ef879dfb469fef860cc7a2bce94c86ad128f2c8dcfa54","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T11:47:14.368272Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"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/2607.07419/citation-record","integrity":"/paper/2607.07419/integrity","json":"/paper/2607.07419/citation-record.json","paper":"/paper/2607.07419"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T11:56:12.448127Z","title":null,"venue":null,"work_id":"699598ba-9635-4db2-be9d-13e6ca88b884","year":2025},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:7d923987d67e9c1ca06ad6f6c48cce531718383451e133d42eb2047fe20f282f","observation_id":"60b8cd8b-172e-4c8d-ae31-aff51db8d64c","resolution":{"observed_at":"2026-07-09T11:56:12.449358Z","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-07-09T11:56:12.504455Z","title":null,"venue":null,"work_id":"e66b4398-0b37-4407-b26e-44d1f86d80fb","year":2019},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:352161ca81c2f2105cd2a3bab73e7758f8fc79067dba1bc1ea96e6dca25c5d1a","observation_id":"8f23fe83-1215-4da8-a618-6eac3b050ebd","resolution":{"observed_at":"2026-07-09T11:56:12.505813Z","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":{"arxiv_id":"cs/0310049","last_updated":"2003-10-25T16:03:58Z","snapshot_observed_at":"2026-08-07T03:52:13.153712Z","submitted_at":"2003-10-25T16:03:58Z","title":"An O(m) Algorithm for Cores Decomposition of Networks","version":1},"cited_work":{"arxiv_id":"cs/0310049","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0310049","snapshot_observed_at":"2026-07-09T11:56:12.349276Z","title":"An O(m) Algorithm for Cores Decomposition of Networks","venue":"cs.DS","work_id":"fb35da54-3096-4cef-80c1-3e63aa7f7769","year":2003},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:0b28d0c2868c9ec32dbdadafe88658e9084b51311ad4b9ee8f3e08a96b7a08e0","observation_id":"4337062b-e946-459a-8aff-e6d3ba5eef48","resolution":{"observed_at":"2026-07-09T11:56:12.350684Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07-09T11:56:12.491040Z","title":"Smirnov, Steven Kelk, and Bertrand Lebichot","venue":null,"work_id":"1a7e3bce-7cf3-4a11-bee7-a2714b7aa9ac","year":2017},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:989b68b381e0c68fb08cc16bfb7164cc7ae43861c82db0581aaa0febea1012d3","observation_id":"481b711c-54b9-4bea-89e3-63d8c8c5b1f1","resolution":{"observed_at":"2026-07-09T11:56:12.492290Z","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-07-09T11:56:12.482877Z","title":null,"venue":null,"work_id":"47a07e35-cbdf-4f07-9052-35e4422d9d53","year":2022},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:6726fa3bb5a8be82d74a35d5806fd571d11f6355896e929c22df7ef5ee667a40","observation_id":"2a051c33-cec3-4c65-ad0b-6cb61d629a33","resolution":{"observed_at":"2026-07-09T11:56:12.484018Z","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-07-09T11:56:12.496355Z","title":null,"venue":null,"work_id":"08dce43a-49fd-459f-a4f0-9d57d8364b7f","year":2024},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:5064d485702ff7080db41e976342859d81f234b20cf7ba3edb46a4966acec1cd","observation_id":"8ee9f953-4834-4711-ae40-e2cc70137299","resolution":{"observed_at":"2026-07-09T11:56:12.497815Z","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-07-09T11:56:12.498359Z","title":null,"venue":null,"work_id":"819ad8aa-9bdf-4e71-8bd8-fe4f739e7203","year":2024},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:bf3e73eefad78c2bba30e7e5b5758e6eac35207dbc8158787341dd60a4d0494d","observation_id":"93daa8c5-f8bb-4852-a696-2db404c299f3","resolution":{"observed_at":"2026-07-09T11:56:12.499759Z","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-07-09T11:56:12.462858Z","title":null,"venue":null,"work_id":"1bf23fd6-7b0a-44f2-9b35-4b132fa75944","year":2023},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:f1e19eebb758259335a1e884eb55c3a1f7cf8f00e6a76f58db75a9d00e93c1a3","observation_id":"90b53b8e-a3f6-4c0b-a08c-7dd53750a5ca","resolution":{"observed_at":"2026-07-09T11:56:12.464075Z","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-07-09T11:56:12.473930Z","title":null,"venue":null,"work_id":"7d045573-349b-4698-b7b7-02a14276ae8d","year":2013},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:fadb4124bb882e802aa089abca36ecf76e2c2fdaeb3abb3506722e2032eb9caa","observation_id":"c5dfe78f-2c41-4004-9a66-a65929e44af6","resolution":{"observed_at":"2026-07-09T11:56:12.474975Z","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-07-09T11:56:12.492493Z","title":null,"venue":null,"work_id":"e37c3bb2-066a-43a7-9dfb-033330347f11","year":2018},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:3eb758e47bfe03bb92340db1d0856e40d2b3f5dc9f5931961081396c2200506b","observation_id":"9c6e05c3-24be-457e-bc5c-b4685b330897","resolution":{"observed_at":"2026-07-09T11:56:12.493740Z","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-07-09T11:56:12.472882Z","title":null,"venue":null,"work_id":"1ac48152-e1a0-4ecb-9d12-79ed6146fb0d","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:af758d1d91cc32ee42eb8b6bff665a15cd80b0ce9d6cd77542dc013bf4b32b11","observation_id":"705234ce-53ac-4b08-a807-7a4b771b12bb","resolution":{"observed_at":"2026-07-09T11:56:12.474112Z","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-07-09T11:56:12.514431Z","title":null,"venue":null,"work_id":"2a40d8c7-96ec-4e68-bcf9-98af5864f6d9","year":2014},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:cb58fc88c47b82f877e83548c19f47abcd79a4f8adf9a79a4fd1f8ca1d6deda1","observation_id":"96f96306-83db-46db-abe0-5aa5de132f87","resolution":{"observed_at":"2026-07-09T11:56:12.515599Z","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-07-09T11:56:12.471962Z","title":null,"venue":null,"work_id":"86183d4e-b002-48eb-a643-e444d2600b2b","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:2dbc1d7aa2dd96474fdd25773a4f1face75f8c9dc376b3292db6b85998066084","observation_id":"2d95ad1a-38bc-49ad-81b4-3adcb41c5435","resolution":{"observed_at":"2026-07-09T11:56:12.473295Z","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-07-09T11:56:12.506453Z","title":"In 2011 IEEE 11th International Conference on Data Mining","venue":null,"work_id":"a5688798-6a58-4b8f-85fa-a0e81d676721","year":2011},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:6431be81ffad10b45c6adb60c77f6a262c918400b296bc5c8d7297e265e5e541","observation_id":"4fdff514-dc5b-4fde-af06-71980709337d","resolution":{"observed_at":"2026-07-09T11:56:12.508078Z","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":"0903.34009","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T11:56:12.352157Z","title":null,"venue":null,"work_id":"3d936438-b675-40c3-b2d7-382ef1ad45e9","year":2020},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:de538d4076f7e694f8da29f1ebdfb7ec4c5ef390971ddd2bce526ad18167eb89","observation_id":"adc0ca2b-0b38-4dca-8bf7-86088aa4c508","resolution":{"observed_at":"2026-07-09T11:56:12.353947Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"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-07-09T11:56:12.461738Z","title":null,"venue":null,"work_id":"4b847e3c-cf50-4b2a-8d5f-723565f9b87e","year":2023},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:c6968050ec46b40ae76ad95883260d3503ad9450cf600611fd8f1052dfd1b4fb","observation_id":"b92d65a1-117e-4d2a-aac0-bd18123bc0c4","resolution":{"observed_at":"2026-07-09T11:56:12.462962Z","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-07-09T11:56:12.490627Z","title":null,"venue":null,"work_id":"a3c896ab-e5b3-4249-96ad-b2e1871661e3","year":2021},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:719bcc3b4c73a10886ae29943c218c9cac6b9be08ef31a394f7ed93246740d48","observation_id":"3a942ec6-3140-4236-972f-4419606a099e","resolution":{"observed_at":"2026-07-09T11:56:12.491871Z","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-07-09T11:56:12.502336Z","title":null,"venue":null,"work_id":"90c6e39b-e7c8-419b-a701-8b3bcc58714a","year":2008},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:8a27acd0b0a27ee675673a295bf2a67e4219285fc8ab92a45409b688ed86d6a0","observation_id":"ac1a8898-ca21-47ba-b3ab-801fc6aa8270","resolution":{"observed_at":"2026-07-09T11:56:12.503837Z","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-07-09T11:56:12.484694Z","title":null,"venue":null,"work_id":"9fd0b9c6-55f5-4245-ba26-989f1d4886de","year":2008},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:5a57b9e25b42ea883807af0d5504011f07c26da69bf074d7f8c7728a93a3b6c7","observation_id":"36a498df-7cda-46ec-a0e8-87ac457881c0","resolution":{"observed_at":"2026-07-09T11:56:12.485794Z","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":"10.1016/0022-0000(80)90060-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lewis and Mihalis Yannakakis","venue":"Journal of Computer and System Sciences","work_id":"9f945838-a425-4f44-b66c-6f1ffe6953d0","year":1980},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:97863e04631e4d51d25789de151d62e17ac401622af1aec2bd609bc65ed9e67c","observation_id":"dc105a52-a52a-4768-b24c-1743c37d8bac","resolution":{"observed_at":"2026-07-09T11:56:12.250872Z","resolver_source":"doi","status":"verified_exact"},"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-07-09T11:48:34.539481+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:48:34.539481+00:00","source":"openalex_status_cache"},{"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-07-09T11:56:12.494365Z","title":null,"venue":null,"work_id":"202e717b-aa4d-4a2e-8ffc-49f4b621f639","year":2002},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:0cabb93496ffdd43f24f20f318447229b3544843736327f862c318f05dd67989","observation_id":"efe17975-7266-4d55-b5fb-0b9e78d5e45d","resolution":{"observed_at":"2026-07-09T11:56:12.495697Z","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-07-09T11:56:12.488657Z","title":null,"venue":null,"work_id":"fba818b5-a1d3-4812-8b50-ecb93bc114b0","year":2023},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:0cd208ec52ed995acf5116e7593a51a845886aead7f264ab35c358bff4d88fc8","observation_id":"0b0636d1-efdd-45c6-a8e1-2f37382c9022","resolution":{"observed_at":"2026-07-09T11:56:12.489847Z","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-07-09T11:56:12.485074Z","title":null,"venue":null,"work_id":"935d80fd-9a38-4fba-a4b2-4cee4f659442","year":2008},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:1479c6c334483596cd0030a6eaa846c2c5f3bbccc12ff26522b59e1bcc8865d8","observation_id":"1cc8bb95-eafc-4ae7-8641-dd29c8029c89","resolution":{"observed_at":"2026-07-09T11:56:12.486259Z","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-07-09T11:56:12.481082Z","title":null,"venue":null,"work_id":"7ba5ca6d-6610-4d9f-a75e-de18488d3344","year":2006},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:8d756506ce763db02678a828c2f477e06099f4ffa0e905497de6c6bf8c3d5f31","observation_id":"de886730-1c35-4ce3-93f9-c9357fc3efaf","resolution":{"observed_at":"2026-07-09T11:56:12.482201Z","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-07-09T11:56:12.467563Z","title":null,"venue":null,"work_id":"99f41ee2-0b1d-4ff5-a310-5b019cb15d36","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:e2bcde73f6dfd88ff5e2dd172968bc1066e0815b376ded1d5c93986b7955880e","observation_id":"91baa528-cb12-4178-8d77-883fc7b1abe4","resolution":{"observed_at":"2026-07-09T11:56:12.469030Z","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-07-09T11:56:12.474667Z","title":null,"venue":null,"work_id":"27c91592-1cf3-4e13-a5bc-fec1175a8ac0","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:594fc000988849ac2622213b76cfc4002808c5527ee3ad0bfe7a54dd507d733a","observation_id":"855d4366-ddce-4cdf-b2d0-735470a19873","resolution":{"observed_at":"2026-07-09T11:56:12.476002Z","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-07-09T11:56:12.460642Z","title":null,"venue":null,"work_id":"f7866fec-370b-4c14-9d0b-3568b00f6a44","year":2020},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:932192ab41d8d6319cf06ea5ea4311b65358fbe6da936dae0310d3a811bf903d","observation_id":"ea13a4ef-77fc-4933-8159-7ad730c34a56","resolution":{"observed_at":"2026-07-09T11:56:12.461977Z","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":"10.1007/s00778-024-00882-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"The VLDB Journal","work_id":"a611923c-1443-4d31-a78e-59d9cba35784","year":2024},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:3b282559fc416df00c52b351253886a4680d2f5ebcb881f13be11799a485960b","observation_id":"8896cf0b-41b3-443b-a8c1-f713203efa11","resolution":{"observed_at":"2026-07-09T11:56:12.254504Z","resolver_source":"doi","status":"verified_exact"},"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-07-09T11:48:34.823876+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:48:34.823876+00:00","source":"openalex_status_cache"},{"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-07-09T11:56:12.466785Z","title":null,"venue":null,"work_id":"0453cb12-5af2-4374-9a9d-ca82deb24085","year":2009},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:97bb7f3254d8a2713ebbcb64f90d58dcee9296dc3932f70f292a4d9043dc1129","observation_id":"1ed2e161-0c62-4ee0-901a-b004a46a1c87","resolution":{"observed_at":"2026-07-09T11:56:12.468109Z","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-07-09T11:56:12.516180Z","title":null,"venue":null,"work_id":"7ca26c77-9345-44fc-b733-3d5594541f77","year":1978},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:8c9fe533d85bacaf828923c1e57f4cc4a879737dd358d3083d2ad15a7a4774d3","observation_id":"8e2ab071-f137-4621-bc38-46072ac356c2","resolution":{"observed_at":"2026-07-09T11:56:12.517547Z","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-07-09T11:56:12.508698Z","title":null,"venue":null,"work_id":"857980ed-406d-41fd-8244-7aa904efd742","year":2009},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:78ca2e49d697f9a9927e65a4a8ae1e351cd91ad232deb50d345c085721f2d15b","observation_id":"cab2be62-4367-478d-8865-4946bda9d362","resolution":{"observed_at":"2026-07-09T11:56:12.510082Z","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-07-09T11:56:12.470936Z","title":null,"venue":null,"work_id":"cb3575fd-98d6-48fd-b8df-fb18877f4a5e","year":2012},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:4bff687718d4db9919a2ed96d5a49aff9022c7b94beef00a1e29edba9561a0e7","observation_id":"eb2906a4-6d30-4cdf-ac62-c49c71122973","resolution":{"observed_at":"2026-07-09T11:56:12.472289Z","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-07-09T11:56:12.510681Z","title":null,"venue":null,"work_id":"fda93efa-b1a8-4268-8a59-a0f0689b601b","year":2023},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:ed09eb246b782bd72a9580ee800835478c07cb802ad8665de65662a6b56d62eb","observation_id":"591c2551-ffdf-447d-a37a-ad5787650e0c","resolution":{"observed_at":"2026-07-09T11:56:12.511881Z","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-07-09T11:56:12.486559Z","title":null,"venue":null,"work_id":"6ef6de2d-b779-4065-8ee4-4e2a53de77cd","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:a99011ec25fe67249145a82711393219112eb17e4b1ae41130184664ef5f3f1a","observation_id":"4b99b2bc-0978-41c2-bf43-ecde1b27501e","resolution":{"observed_at":"2026-07-09T11:56:12.488030Z","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-07-09T11:56:12.489072Z","title":null,"venue":null,"work_id":"cee6f841-abfa-4360-ab80-0114752c0ca1","year":2019},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:1d95211a3a3e6f3610dbaaf2da92c1d506d32d8d184f3a920dfbd713d06547e8","observation_id":"e2514272-6e0a-4bad-8b2c-0c55e93663f2","resolution":{"observed_at":"2026-07-09T11:56:12.490285Z","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-07-09T11:56:12.450136Z","title":null,"venue":null,"work_id":"f385d51c-16cb-4faf-aa82-0a85636f5e22","year":2023},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:f3dc02723fc55e8d63db7467a32e1b968b40051fdd6f26a09f2c0501eb5a8be6","observation_id":"c989dca7-5cd2-4406-bcf1-df52ac653df5","resolution":{"observed_at":"2026-07-09T11:56:12.451450Z","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-07-09T11:56:12.512466Z","title":null,"venue":null,"work_id":"bbac0839-f0e9-43c0-a2c1-206f61c2784a","year":2021},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:8c9bf3b5c9c15e40229eaf31c2f21bbfb5b77d9bffc2b8e07718efa0e35eca9a","observation_id":"902b9175-e13a-4cb4-8535-da26f67a6934","resolution":{"observed_at":"2026-07-09T11:56:12.513868Z","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-07-09T11:56:12.465727Z","title":null,"venue":null,"work_id":"cd79982b-cc1a-49ab-8f23-3fe92640771d","year":2022},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:30d44e8a79b4e5352076b52c1cc13f4b786273eaf397b849693d09e9d6aec568","observation_id":"22fe92ce-bcd3-4c30-a829-dffbffb31341","resolution":{"observed_at":"2026-07-09T11:56:12.466909Z","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-07-09T11:56:12.479050Z","title":null,"venue":null,"work_id":"2b102425-162e-4471-abde-956f98e7e91f","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:bfa9f66ee10ee6c0a82c0d49841ca40393b948652b60e59127b6eb3122a01d9e","observation_id":"f5435c70-bb5a-45bf-b021-912634a0e39f","resolution":{"observed_at":"2026-07-09T11:56:12.480461Z","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-07-09T11:56:12.500393Z","title":null,"venue":null,"work_id":"d54c4920-94f4-47a4-9a77-9710f1283499","year":null},"citing_paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-09T11:47:14.368272Z"},"links":{"citing_paper":"/paper/2607.07419"},"observation_digest":"sha256:04443acf62dc333cceb31a9299d5aa7b8a7079419369e944aec037c7f854e5f2","observation_id":"e68324ef-bc76-4893-a6eb-174ba95a47c7","resolution":{"observed_at":"2026-07-09T11:56:12.501758Z","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"}}],"paper":{"arxiv_id":"2607.07419","last_updated":"2026-07-08T13:47:42Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T12:32:07.434805Z","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":3,"verified_fuzzy":2},"total_outbound_references":40},"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 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.07419."}