{"as_of":"2026-08-18T23:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:57084404a0e0314c84e5aa6c4ed492a6492ee96c26c69dade05c053786672907","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:06:10.677383Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"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/2508.18616/citation-record","integrity":"/paper/2508.18616/integrity","json":"/paper/2508.18616/citation-record.json","paper":"/paper/2508.18616"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-37401-2_21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-17T11:03:46.409680Z","title":null,"venue":"Lecture notes in computer science","work_id":"8fe2dc6b-5b55-4be2-a8a3-40e5865acdfa","year":2013},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.492126Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:c4d46ff345cc697cdc24c8dc11c63eb24fe3a6c7d5c20a8254912c1904e61343","observation_id":"289de35a-8952-4841-90b8-51b8b1d769ce","resolution":{"observed_at":"2026-08-15T17:06:10.703671Z","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-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-15T17:06:11.522354Z","title":null,"venue":null,"work_id":"674054d7-ac33-4b87-95fc-485b739cf108","year":2000},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.496648Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:8c2ed601a3be47b210c95e12a4e28c42c9ae1ff87d5323bcc909c3c1bd7c0ce6","observation_id":"54594cda-fcc4-4c44-83a1-14439f8ddae1","resolution":{"observed_at":"2026-08-15T17:06:11.526413Z","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-15T17:06:11.511157Z","title":null,"venue":null,"work_id":"498acd36-2307-4ffa-8dbe-1e06c6ece1b6","year":2014},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.500453Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:b86ad2d69258242569e7f3c29d36ffbdf77c3f6de474bc3aa5e5f225ae4be803","observation_id":"dd1fbd85-1f2b-46b0-96f7-5599077ab4d5","resolution":{"observed_at":"2026-08-15T17:06:11.515427Z","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-15T17:06:11.499418Z","title":null,"venue":null,"work_id":"7c8ab52f-94f2-437f-9cc3-6b8d0e512909","year":2012},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.505019Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:860a9d2ccb3a3627c67b47a1f9299b264be16eebd73fa625d88dcb74e756455a","observation_id":"4bcb4498-a4a0-4dc5-8577-3cafe3ac1862","resolution":{"observed_at":"2026-08-15T17:06:11.503917Z","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-15T17:06:11.488077Z","title":null,"venue":null,"work_id":"0913bae6-d700-4e47-9483-7db6865c472c","year":2013},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.508859Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:110f61b16ab2392d76507f38d5edf3cf15973fa61fedd01ce70db4f6ddc812c7","observation_id":"b65607be-3038-4618-809b-8482d9a8e404","resolution":{"observed_at":"2026-08-15T17:06:11.492384Z","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-15T17:06:11.474387Z","title":"Tsourakakis, Di Wang, and Junxing Wang","venue":null,"work_id":"88f1d953-59e7-44b2-b865-75a9b66d7b29","year":2020},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.512518Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:7befe517d73446bc813440cb66eb9cda7d83acd7cc9426f2bf88001e7800fe7b","observation_id":"ee3dfbba-769e-4348-82af-902e9399b8c1","resolution":{"observed_at":"2026-08-15T17:06:11.480478Z","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-15T17:06:11.462098Z","title":null,"venue":null,"work_id":"b3f4b795-68ad-4d44-8acf-c2f0b1f245eb","year":2013},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.516813Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:361661d0756faa04d0674af99dd0d8a02cd04ab7f320d3e8fa846f6fd9fa3fa4","observation_id":"5b00f553-2e3a-4184-be39-b23407942fb0","resolution":{"observed_at":"2026-08-15T17:06:11.466724Z","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-15T17:06:11.450467Z","title":null,"venue":null,"work_id":"2140a272-543f-4a1b-be19-0a8432d6275c","year":2000},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.520560Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:b0082d1e1be928f7a01afdc68b3a7f8d74f00f81737b8d38cc9f1170009d21e0","observation_id":"07f46bfb-54ec-4fe0-b8e3-b92aab43131b","resolution":{"observed_at":"2026-08-15T17:06:11.455342Z","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-15T17:06:11.438517Z","title":null,"venue":null,"work_id":"255bae46-0439-4a98-ae4e-bb469701c46b","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.524293Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:298c72e1eaba05c38aff7010aa61f454ad2376ecf7f6155c91b49927675163eb","observation_id":"49c05b13-3581-40b7-ac71-e9a2138507a3","resolution":{"observed_at":"2026-08-15T17:06:11.443038Z","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-15T17:06:11.425939Z","title":null,"venue":null,"work_id":"936179a5-8bbb-40fa-bcb2-4bcc7363c450","year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.527449Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:fb33adf0cd341c50846e4f0615f1e7cabacfca6bf455722cefe11327c19dd203","observation_id":"bb90f114-29fd-4de2-9e05-119dd2c84a2a","resolution":{"observed_at":"2026-08-15T17:06:11.430367Z","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-15T17:06:11.413963Z","title":null,"venue":null,"work_id":"b45fcd0d-1ef2-4eed-90d0-a11fba9a9707","year":2021},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.530526Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:23b35c663b6ed01cab253325c7f7560b010c54d9cdac9cc1b86324594b169f0a","observation_id":"74afbf68-4826-4ea3-a53e-8c05a49be37d","resolution":{"observed_at":"2026-08-15T17:06:11.418811Z","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-15T17:06:11.403001Z","title":null,"venue":null,"work_id":"c5652b99-ec0a-4cc4-88d8-ba54e45cdec6","year":2015},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.534275Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:0ad6b2a36cd33abba6c0d72b99ba6da0ff3fd46c5d4bc4737e2c1af352ffb42f","observation_id":"16ce72cd-cd14-4ab9-bae8-81af283e6c8d","resolution":{"observed_at":"2026-08-15T17:06:11.407564Z","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-15T17:06:11.389664Z","title":null,"venue":null,"work_id":"1bfb1b3b-a410-465d-8794-51fe13d8b079","year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.537540Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:d65b68c5a42c7ff62d7640b3b39144876fb3594ba20528cfd4d4aeea208931d1","observation_id":"769c1756-6261-4a1c-8d56-d9be5929887a","resolution":{"observed_at":"2026-08-15T17:06:11.394520Z","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-15T17:06:11.376887Z","title":null,"venue":null,"work_id":"0985f44e-fc88-4734-87b3-a5ccab5e28a9","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.540623Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:3922f06fb793d16c75ef2d6b98bcaf4d2ad292a0560fd9a1cf97ea4035aba4da","observation_id":"deb2808c-92d0-4ed4-bc12-e8dfb44055e5","resolution":{"observed_at":"2026-08-15T17:06:11.381109Z","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-15T17:06:11.365852Z","title":null,"venue":null,"work_id":"7002bd1d-28de-4d2c-8b51-6df5b7dfc253","year":2018},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.543949Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:8026d6266153f7c03f3b4be40976c011914f9d04d922a62f7342ccd27a6af461","observation_id":"6e6c6665-09d1-4ea4-9d18-edf7c882c930","resolution":{"observed_at":"2026-08-15T17:06:11.369710Z","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-15T17:06:11.354188Z","title":null,"venue":null,"work_id":"61532686-9bca-4f22-a7d9-964230156982","year":2017},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.547276Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:a83c2388f99e2e2b80cde35eef2e4ec717c55d67c5d5d3d597d7028f7cc4af67","observation_id":"912ea444-0e8b-447a-b795-5c5144dd3eaf","resolution":{"observed_at":"2026-08-15T17:06:11.358062Z","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-15T17:06:11.342091Z","title":null,"venue":null,"work_id":"c615ecfd-7ff8-43d2-8149-446d7902a220","year":2015},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.550461Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:2841e217f732456d76ce19c637ffcfb60bdff368eba3c2f39bb205ebac614f06","observation_id":"0e33d5a9-7973-46b2-96ac-97d29c12c16c","resolution":{"observed_at":"2026-08-15T17:06:11.346271Z","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-15T17:06:11.329973Z","title":null,"venue":null,"work_id":"49f4d6fd-9eec-4f34-bd45-9e75947d57fd","year":1984},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.554302Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:7d957a2f4088c02f168ba3c0c45325a5a86dbf2b14397eed9014d4f3a262fc05","observation_id":"54ad36d4-7c30-4114-a834-9e13a23143b8","resolution":{"observed_at":"2026-08-15T17:06:11.334888Z","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-15T17:06:11.317334Z","title":null,"venue":null,"work_id":"42ca2d41-3676-4b0a-8fc8-3ea54b5b7abc","year":2019},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.557620Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:05f049b9f6efed7db5535f697675011d74e7477a91e86a5bdfba8f384c0f51eb","observation_id":"637020d0-0e4b-4c77-9afb-508c30e47bf5","resolution":{"observed_at":"2026-08-15T17:06:11.321892Z","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-15T17:06:11.305165Z","title":"Kuznetsov, Amedeo Napoli, and Sébastien Duplessis","venue":null,"work_id":"49b767e2-9382-4ae7-af0d-3b77449bb934","year":null},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.560698Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:243470abb0e664993b675662ad9fd5d431a5ea489d02e0efd539592bed786e6b","observation_id":"638bdac8-3aeb-47ec-a48a-d0df29d19cae","resolution":{"observed_at":"2026-08-15T17:06:11.309729Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.566622Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.566622Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:f48b8c8eb3ad0c9ea1ea10b458d7e2f4806ad666d1eb36b0f294450703152301","observation_id":"898260e2-95ba-48c6-802b-16f8c6acdf9e","resolution":{"observed_at":"2026-08-15T17:06:10.566622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:11.282305Z","title":null,"venue":null,"work_id":"8f3fd64b-cbe5-4bf2-825d-97d7dd0ad3ef","year":2009},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.569652Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:34554a4666ed2adc816836da8bbe57bbb88d054a85c197b7fff19e7946fe245f","observation_id":"7805d5d1-c132-449a-ab05-d057b769a026","resolution":{"observed_at":"2026-08-15T17:06:11.286364Z","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-15T17:06:11.270473Z","title":null,"venue":null,"work_id":"89fa9042-f7e0-4649-9712-82c6d321662d","year":2008},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.572971Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:a4838782746672a6c2815e18a5d86fca3b7bf4ac6646ef46e7ac3e16c833884e","observation_id":"bbaf53f0-4f7c-4fb7-9325-3a119179fd1b","resolution":{"observed_at":"2026-08-15T17:06:11.275156Z","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-15T17:06:11.258054Z","title":null,"venue":null,"work_id":"30b34aa4-e8be-406f-a63a-34139436226e","year":2002},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.576325Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:0c1edb029a14c93c32df6f29843ef518039f436041f6854b192401c132eab71d","observation_id":"5c011108-8171-42bb-89ac-60e281939448","resolution":{"observed_at":"2026-08-15T17:06:11.263032Z","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":"2003.11673","last_updated":"2020-03-25T23:13:50Z","snapshot_observed_at":"2026-08-08T02:50:05.521164Z","submitted_at":"2020-03-25T23:13:50Z","title":"Explicit expanders of every degree and size","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.11673","snapshot_observed_at":"2026-08-15T17:06:10.579267Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.579267Z"},"links":{"cited_paper":"/paper/2003.11673","citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:cfce4352ac8ffb4cb5c191729c7f03629fc48b80b7aae62c4e2929d94a0044fb","observation_id":"36d9729f-2440-41a0-a08d-4b4a98e26f6b","resolution":{"observed_at":"2026-08-15T17:06:10.579267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.583064Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.583064Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:d4ece401a5eb689f4a7def1ac8b60f3e3390b923197ab8ddc7adeb75b35249b0","observation_id":"5548c96a-f615-42ac-ad0a-21dcdb28edee","resolution":{"observed_at":"2026-08-15T17:06:10.583064Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:11.231220Z","title":null,"venue":null,"work_id":"2f4e3ffc-d1a1-48de-9a42-5dc106e6a8f5","year":2008},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.590559Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:aeead92cb4b01b420d224b3a9a2639761f92a93e1a3d1ce30f9a99e1dd8cfb36","observation_id":"ed2218e9-d238-4bb3-aa69-7b5c96162399","resolution":{"observed_at":"2026-08-15T17:06:11.234651Z","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-15T17:06:11.219663Z","title":null,"venue":null,"work_id":"cea2d3aa-f24b-4940-a80b-c471a96ef6ca","year":2023},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.594126Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:224a76dbc037f5e0171a7db59d0241cbd3c98ed6c6d2d89b769d72a829f8a956","observation_id":"94f1c74a-2a33-4ce6-a4bf-deeeaed10840","resolution":{"observed_at":"2026-08-15T17:06:11.223615Z","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-15T17:06:11.208797Z","title":null,"venue":null,"work_id":"e3be9c0d-f30d-4762-adb0-03e48af99084","year":2020},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.597909Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:110b560ad64e11422c1ddc12e3c48b80270998b9fca845221986dd2a1e0384ab","observation_id":"ad3f01b1-352a-49df-8a75-0f356cfc21ce","resolution":{"observed_at":"2026-08-15T17:06:11.212934Z","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-15T17:06:11.196784Z","title":null,"venue":null,"work_id":"e174ad2b-2f51-4011-b14b-9b7a8af339a0","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.601288Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:b31fb22ab12b408431e856c16c50bf6dcfa509168aaecafc6973768b0d13aabb","observation_id":"d4afa614-1940-4cf0-b8fc-4a4b95b451ab","resolution":{"observed_at":"2026-08-15T17:06:11.200836Z","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-15T17:06:11.183569Z","title":null,"venue":null,"work_id":"6f645c67-5275-40f2-ae47-3c6a7d134769","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.605164Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:be66a243b41a308a631b3e93eb001b4df324886e7c2744c983a60d8dc1ce7e2c","observation_id":"434d5186-be9c-4a61-814d-6ef42b038b68","resolution":{"observed_at":"2026-08-15T17:06:11.188410Z","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-15T17:06:11.170597Z","title":null,"venue":null,"work_id":"31e35e6a-b880-4aae-936f-b421f1351c96","year":2020},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.608000Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:566914e39a4a7797516e09980b92443dc33daee954b70fd5d19299f07b0d6b8c","observation_id":"473cf85b-d3ad-4a0e-8a6f-9e52e77ccc9b","resolution":{"observed_at":"2026-08-15T17:06:11.174738Z","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-15T17:06:11.159116Z","title":null,"venue":null,"work_id":"9ba289ec-a7d8-46ca-85ea-ef40aa64d22c","year":2017},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.610860Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:8bc39ef9e4ffffe42bf81c6a04b67ca4d28ac85f678446765d5a30c81be69bdd","observation_id":"44b533c8-222e-4bfb-a81f-7e4d014a8b4b","resolution":{"observed_at":"2026-08-15T17:06:11.163216Z","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-15T17:06:11.147032Z","title":null,"venue":null,"work_id":"4c545be1-c14b-4b08-b8de-9134732bdd4d","year":2015},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.613917Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:98875484482c10dfd63dec04024e16dd4c0234dc14cd17049410295028ccd7f1","observation_id":"efc9ff0d-cdee-4ceb-8296-7947f6743801","resolution":{"observed_at":"2026-08-15T17:06:11.151359Z","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-15T17:06:11.135397Z","title":null,"venue":null,"work_id":"b605080e-aa60-469f-b5a6-4516dbccf4e8","year":2012},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.616865Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:1b21e532f5e831661218e2bdf9472d7e1314adb5bd7fd02f47d0f11d773e3df0","observation_id":"f7c644a2-32a1-4ccc-ab10-068cd2c663b5","resolution":{"observed_at":"2026-08-15T17:06:11.139087Z","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-15T17:06:11.122997Z","title":null,"venue":null,"work_id":"8c8da31b-266b-441b-ba90-fef552360e11","year":2020},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.619759Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:b75386af9a3decc72b0d85e096fca14b7c66f05c579da58b544d7859887afeb3","observation_id":"b3b6638d-8ecb-49d3-b75c-0bc91434f626","resolution":{"observed_at":"2026-08-15T17:06:11.127789Z","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-15T17:06:11.014013Z","title":null,"venue":null,"work_id":"d4f94df3-305d-41fd-bd0a-502fc819311c","year":2009},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.622995Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:c5564bd70a2ec4b841faa37a83dff1b92ccaa016ec9c56b2b9efeb987fcee4f4","observation_id":"7542fae7-36be-4fff-9ff2-2c3b80139e32","resolution":{"observed_at":"2026-08-15T17:06:11.113386Z","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-15T17:06:11.000636Z","title":null,"venue":null,"work_id":"ab6a94ee-1eb4-426c-b6fd-f17e3e05582d","year":2019},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.626722Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:e284894253ad0310a906fe3edf07714cbbf0336af80504fee74a1a74c372adae","observation_id":"9a0ab5c3-e7fa-4ed5-9ab5-cd0f58884656","resolution":{"observed_at":"2026-08-15T17:06:11.005041Z","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-15T17:06:10.988352Z","title":"de Vries, and Marcel J","venue":null,"work_id":"bf591721-9a7c-4181-be0a-51652b3af89f","year":2006},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.629625Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:63f52210ae7194ddd95d887d668697b4909520a3a602284139bc08c8db2825e6","observation_id":"e68a6549-7ef2-487e-bfda-f1dd5530369d","resolution":{"observed_at":"2026-08-15T17:06:10.992866Z","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-15T17:06:10.976855Z","title":null,"venue":null,"work_id":"7bd66acc-bd7c-4103-a3b1-e4c4e2ed207d","year":2020},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.633019Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:8fe8cb299eddae84eb302f89e53f41e4df5f2d85294ab785159299cbf3c22dda","observation_id":"983e9180-9bb4-42c6-aa29-d004fe59dc8e","resolution":{"observed_at":"2026-08-15T17:06:10.980812Z","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-15T17:06:10.965150Z","title":null,"venue":null,"work_id":"e4fccb8b-a707-4b58-9b89-0dfe6a4c147c","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.636091Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:4e873333d4fd897ebe88a671cfbbbdff39fdca964d4b8d319ec890454a236077","observation_id":"fd5a545a-26c9-4fc1-8578-3412df412bef","resolution":{"observed_at":"2026-08-15T17:06:10.969694Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.639106Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.639106Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:7a3ce6ed901f2247ef43c0bf248040e06b8995d0f3096369ea612f8339eef8c5","observation_id":"01b738fe-f313-4418-b97a-290e4e97bf4d","resolution":{"observed_at":"2026-08-15T17:06:10.639106Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.943102Z","title":null,"venue":null,"work_id":"5931df02-08f0-48d2-b97c-7e7be35c5334","year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.646960Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:9c4d6392a14599209a7789ee15fda0b3060714c8854b4e1df0baa7b46e1b282c","observation_id":"1694cf33-2a02-43be-8582-b72de8b3f12c","resolution":{"observed_at":"2026-08-15T17:06:10.946955Z","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-15T17:06:10.932052Z","title":null,"venue":null,"work_id":"49e99ffa-e561-420b-a265-c85168656fa0","year":2023},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.650166Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:42b188efe98117cad3ced9fd0b5c9e62138b7db3a1b50a9ac100e6805cbaef11","observation_id":"52c282da-a92e-4fbb-9576-7dc33fd310ba","resolution":{"observed_at":"2026-08-15T17:06:10.936202Z","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-15T17:06:10.920939Z","title":null,"venue":null,"work_id":"68e67ef1-98d3-4321-87a0-d92fdad84c32","year":2022},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.654612Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:76ccb99de52b6fcf510a358015a52d98c12a7545bb1e6a95c92bc7a13d9291ce","observation_id":"16f81eae-8a1c-45de-b1da-367ab88c0581","resolution":{"observed_at":"2026-08-15T17:06:10.925265Z","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-15T17:06:10.907653Z","title":null,"venue":null,"work_id":"a3430ccb-06e1-45a8-a2f7-f5adecafa4ea","year":2023},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.657908Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:e9b03fdc30ea67cbda4bc6748a442658a620902d17cf82bd130513a27ee9648c","observation_id":"ca3f2452-cdca-4778-8dd2-f1777144e743","resolution":{"observed_at":"2026-08-15T17:06:10.912241Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.661202Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.661202Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:a9e29e0a269071cdb4117a6471874fe80590e771a3f4fc046b8f61dd93dc4329","observation_id":"5154ad66-ecff-4914-a66a-eeb1027f5a13","resolution":{"observed_at":"2026-08-15T17:06:10.661202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.893694Z","title":null,"venue":null,"work_id":"9daaadd1-2933-4832-b8d0-b5d19d16c11c","year":null},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.664148Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:6cea0bc79d0c0959a2003aa61814d6d4c346f52f0ad164a4624da99cccc26bdd","observation_id":"4ffb1e07-e161-48b0-a239-5e2759b3e3ef","resolution":{"observed_at":"2026-08-15T17:06:10.898446Z","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-15T17:06:10.871111Z","title":null,"venue":null,"work_id":"89e9eaf4-8caf-4270-a38b-3b25915fa5fa","year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.671453Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:2d9a1d5d0ee4fc2cb738fdd036aa2b9609613b786c3cb1a8308bf962a6a178fb","observation_id":"4f284a0d-85d9-4486-933c-2ed474c27bcc","resolution":{"observed_at":"2026-08-15T17:06:10.875800Z","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-15T17:06:10.858343Z","title":null,"venue":null,"work_id":"1c49c1fe-866f-4efb-aa12-7c01cb51c264","year":2025},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.674526Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:2444ba873d16c8bd5a72f0c1840cd254ecc95020995fbf5803660f23e476ff82","observation_id":"f894b320-2400-4b81-a72f-7d5afdb21d62","resolution":{"observed_at":"2026-08-15T17:06:10.863229Z","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-15T17:06:10.847343Z","title":null,"venue":null,"work_id":"6ca4a82b-5333-4fbb-8805-1e03176c85b0","year":2016},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.677383Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:25a41b67ae2575e3ac8cae0940ffe023bc369e8a61804f9946337deacf06b48c","observation_id":"32859cca-7029-4b65-88c5-47a541806b5e","resolution":{"observed_at":"2026-08-15T17:06:10.850806Z","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-15T17:06:11.293440Z","title":null,"venue":null,"work_id":"24bc5b72-1ed7-47df-8067-1c1c81f38c8e","year":2011},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.563756Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:9f7a1a64e8f6f3855affaa942ad274df8098d0fe38a9e6f5669991b627ab95be","observation_id":"5cd842ec-3bd2-461b-878c-7f2201d66b47","resolution":{"observed_at":"2026-08-15T17:06:11.297244Z","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-15T17:06:11.241207Z","title":"InWWW 2019","venue":null,"work_id":"d6cef8e4-aef5-4a40-b744-a492d2b0754f","year":2019},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.587229Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:e0a7dcb4a6a545b1670732c2eaaa9592044d72d69cbffb1711cbfd272bda53b9","observation_id":"07201f5f-b01e-45b9-a614-f1666993040d","resolution":{"observed_at":"2026-08-15T17:06:11.244813Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.643053Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.643053Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:172c6ce345307d190a14e166bb21f2bee54d358dfb364f8bce4e1bb2c4b458aa","observation_id":"aed224b9-1c41-4595-8aba-214b24d1c857","resolution":{"observed_at":"2026-08-15T17:06:10.643053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:06:10.882826Z","title":null,"venue":null,"work_id":"e2969136-c1c2-4718-b9eb-33c8de8cf381","year":2024},"citing_paper":{"arxiv_id":"2508.18616","last_updated":"2025-08-26T02:41:34Z","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T17:06:10.668223Z"},"links":{"citing_paper":"/paper/2508.18616"},"observation_digest":"sha256:6517790e171b68d0258628dcbc6a3f578d64aaa868a8f3cba453cee079b80204","observation_id":"62e35df5-dc51-41a8-afd1-8d1bf187eff3","resolution":{"observed_at":"2026-08-15T17:06:10.886484Z","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":"2508.18616","last_updated":"2025-08-26T02:41:34Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-16T03:54:52.059655Z","submitted_at":"2025-08-26T02:41:34Z","title":"Optimal $(\\alpha,\\beta)$-Dense Subgraph Search in Bipartite Graphs"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":1,"verified_fuzzy":4},"total_outbound_references":55},"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 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2508.18616."}