{"as_of":"2026-08-14T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7c94f52d0886b3ffe6e1c23ed5279d2ae964777343362b73d7a0ca8fae96af99","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:11:03.454751Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2412.00704/citation-record","integrity":"/paper/2412.00704/integrity","json":"/paper/2412.00704/citation-record.json","paper":"/paper/2412.00704"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T05:11:04.166258Z","title":"Controllability of complex networks,","venue":null,"work_id":"98bcadfd-3539-4a55-8d0d-2b5dd286619a","year":2011},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.250381Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:41919ec4285f4065cf1ebff832616e6256eef5e0405d1e1f4a259380d4aa35ef","observation_id":"3c392276-9778-4f64-8033-00a0eb9bfef2","resolution":{"observed_at":"2026-08-12T05:11:04.169926Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.152770Z","title":"Minimal control nodes for strong structural observability of discrete-time iterative systems: Explicit formulas and polynomial-time algorithms,","venue":null,"work_id":"0e59a580-55f6-4441-a81c-beb4e8568618","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.255549Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:e29d0cd7f43b36696ecb438849ac1d5ca2f49d212144afc175406aa3108c5c9d","observation_id":"e3a87d51-7325-4634-bfc5-8eb5cc062c0c","resolution":{"observed_at":"2026-08-12T05:11:04.156753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.140389Z","title":"Addressing the minimum fleet problem in on-demand urban mobility,","venue":null,"work_id":"583b8468-c350-4daa-aaf7-4e2c9f806748","year":2018},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.260084Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:40c69bdf2d30a4076b5c3853f4547775554d2a07a724554a15806595b700ddb1","observation_id":"a838024b-208f-4923-b90b-099a4fb64a16","resolution":{"observed_at":"2026-08-12T05:11:04.144231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.127246Z","title":"Strategic resource selection with homophilic agents,","venue":null,"work_id":"3952401e-08ef-489c-b8c1-e87c0b1c31ae","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.263662Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:92a68a9359a4f9e24ab7baf592e22f941d423f015b29a1017786559b6aca7e82","observation_id":"ffae96a0-bd0a-4a83-bd27-31a70a464cd6","resolution":{"observed_at":"2026-08-12T05:11:04.131568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.111735Z","title":"The multi-agent transportation problem,","venue":null,"work_id":"125d2f91-f2a7-42af-b9ee-7a450499997c","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.267736Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:5ca4ba10fb0f9e330ad71df8ddd5aae3c302d92131e7d6ad71ba39912849071e","observation_id":"eea1f072-28a2-42c8-8a6b-dd3810b4480e","resolution":{"observed_at":"2026-08-12T05:11:04.116915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.092728Z","title":"Ive: Accelerating enumeration-based subgraph matching via exploring isolated vertices,","venue":null,"work_id":"c908b508-d566-4067-ab16-8e8e02e88687","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.272296Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:9a23053db17aceb73070d56c0d48bb06865f75a8935dd6fdad92f753fd8b6964","observation_id":"ecba75e9-4832-476e-be1a-0dd399c78c7e","resolution":{"observed_at":"2026-08-12T05:11:04.098523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.077601Z","title":"Bice: Exploring compact search space by using bipartite matching and cell-wide verification,","venue":null,"work_id":"f82b4864-0d02-4c61-a650-cf45214b725d","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.277186Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:7def2c8e3cf963d0812740b1f86633fe2af7f893d7bc631d8b861d45fce025eb","observation_id":"eb2ee16e-2d7f-4087-90a7-00640e85b7d2","resolution":{"observed_at":"2026-08-12T05:11:04.083060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.065512Z","title":"Efficient and scalable labeled subgraph matching using sgmatch,","venue":null,"work_id":"f94a4f08-f8c7-4731-bde6-cbaa9dbb60e5","year":2017},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.283373Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:0e5b460520a40d80c0ba4e00c16d43170f248fe2621c0a49ec059bc604ea37f8","observation_id":"23a123ce-dbfb-4964-890e-19e279616c5f","resolution":{"observed_at":"2026-08-12T05:11:04.069325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.051230Z","title":"Dilation choice sets, dul- mage–mendelsohn decomposition, and structural controllability,","venue":null,"work_id":"b8a2719c-5775-4b78-9e73-486f4fef1e6d","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.287913Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:c461a5bfb3f9ad87fbfbfcaa2841a4fdcc2d992d90faf809432be874f6d5cd2b","observation_id":"c97d1a97-b529-4ebb-9f62-37cc36db5059","resolution":{"observed_at":"2026-08-12T05:11:04.055684Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.036227Z","title":"A survey of direct methods for sparse linear systems,","venue":null,"work_id":"e9fe019f-f35a-43ef-b8c9-2bb74eb8d169","year":2016},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.291879Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:df55e3f90a378b3fe139d2501d630e9fd27c30b83b1a90bb3349c0af8a53e6fa","observation_id":"b19abed0-b299-405f-92f7-52f8d5186f23","resolution":{"observed_at":"2026-08-12T05:11:04.042577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.021858Z","title":"Computing the block triangular form of a sparse matrix,","venue":null,"work_id":"37f58d47-694c-45af-824d-f99af4613f6e","year":1990},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.297683Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:405160c0348f79f97f3903d18a328301ff8a0d33dda7e490e4c4d3f1e711ecbb","observation_id":"2bdfe363-ae3c-4ef4-8866-72a26541f03b","resolution":{"observed_at":"2026-08-12T05:11:04.026311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:04.008478Z","title":"Efficient cross dynamic task assignment in spatial crowdsourcing,","venue":null,"work_id":"4110aee9-fff1-46a8-9ff5-29b90aad39f1","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.301632Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:e6745faa01d0dc6c79c8969cb6db2d5029bde3ee4e8ce08079ce5c9e2e228207","observation_id":"f132ffe1-e580-4069-b79c-cb915fee1d42","resolution":{"observed_at":"2026-08-12T05:11:04.012922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.994496Z","title":"Loyalty-based task assignment in spatial crowdsourcing,","venue":null,"work_id":"7681595b-8b80-4033-907a-e790dc764eab","year":2022},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.305327Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:c0a1b353f8d8512b1ca3567407048f9f88ff1dba55f583beb12fc1f0999b0975","observation_id":"ddb4619f-aa61-4fa0-a22a-9b4395302b30","resolution":{"observed_at":"2026-08-12T05:11:03.999838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.982150Z","title":"Real-time cross online matching in spatial crowdsourcing,","venue":null,"work_id":"e564fd2a-5cce-4a85-a04c-d40d7c33ab3f","year":2020},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.309412Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:45c57c0318988d0e248484318f2734df1b1e53f48ff243a17ac324ab90f9bab5","observation_id":"f000b332-73ce-496b-a200-c4bbf376cd17","resolution":{"observed_at":"2026-08-12T05:11:03.986148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.967335Z","title":"Dynamic pricing in spatial crowdsourcing: A matching-based approach,","venue":null,"work_id":"5a2e76ef-b9fe-49f6-8511-8e0ec5197e85","year":2018},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.313291Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:f1c00386d8d2faa426a75bf68178a7f28641e0e5b5ca6e62c6bb17b6c5806675","observation_id":"47f2341d-c333-46db-b547-8f10bb0fb35e","resolution":{"observed_at":"2026-08-12T05:11:03.972168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.953893Z","title":"Design, implementation, and analysis of maximum transversal algorithms,","venue":null,"work_id":"da4510d5-2480-49fd-8a24-a72101f755f1","year":2011},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.317034Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:d75e54de52908a4088bea337aa7bca0d9610dd562b1210aca8252c0ab959f03c","observation_id":"6c02a05a-853b-4f7b-a198-4fc3f88a3c54","resolution":{"observed_at":"2026-08-12T05:11:03.958163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.941300Z","title":"Karp-sipser based kernels for bipartite graph matching,","venue":null,"work_id":"f4ffaad5-413d-4d2b-931a-3216f507b999","year":2020},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.320560Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:9189f619310c41c168176fa6eab938ef73faedc587a994abbef39be095a4c980","observation_id":"3ce135dc-246c-4761-adf6-c51fe908f52b","resolution":{"observed_at":"2026-08-12T05:11:03.945520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.928067Z","title":"Engineering Fast Almost Optimal Al- gorithms for Bipartite Graph Matching,","venue":null,"work_id":"f03a61c3-0960-4080-bf5a-d2a382bbd87b","year":2020},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.324132Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:7801ffa6f336c92746fe3949181003800e9c1d6ca2a0616e2d3a943b8d00db1d","observation_id":"3e103761-c579-4338-b2b6-46aa4d47713a","resolution":{"observed_at":"2026-08-12T05:11:03.932296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.913666Z","title":null,"venue":null,"work_id":"f42b127c-37f1-4f2a-960a-a548a9386057","year":2022},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.328431Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:c9665ad64bbe1d2828e1833cf9f3c0d0efe80405695e01a4c15a8be5fe7e4b13","observation_id":"a38df4ec-4dcc-4855-a530-775ff3850b65","resolution":{"observed_at":"2026-08-12T05:11:03.918456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.898565Z","title":"Approximation algorithms in combinatorial scientific computing,","venue":null,"work_id":"4acb66ac-b6c9-473a-9a32-2d6767e3dc3c","year":2019},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.332583Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:6c55db0cdd1dd5364ecd48f1d5fd88117bf7dba1cb458310c6c52171217b8734","observation_id":"a9cd8b21-7d19-40dc-9c12-beed0dcdfdd5","resolution":{"observed_at":"2026-08-12T05:11:03.903051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.885282Z","title":"Fast parameterized preprocessing for polynomial-time solvable graph problems,","venue":null,"work_id":"db45029c-f77d-42ae-998b-0219985743d9","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.336452Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:0f1ff452e0daa441e50f2f87cf6a5de1680ecb409c94f219d1b216987cba0e9e","observation_id":"022e51a7-a6dc-4618-9b91-26f680354a5f","resolution":{"observed_at":"2026-08-12T05:11:03.889910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.873170Z","title":"Maximum matching in sparse random graphs,","venue":null,"work_id":"33aec765-27f3-4248-83d9-110fe8a51a15","year":1981},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.340632Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:b0ee8e3f0635b0532ed71627ccbc4fc8a4ef0ed7940d369e463cd4b77c3a2ef7","observation_id":"cbc710e8-7474-43c9-b235-fc377e32110a","resolution":{"observed_at":"2026-08-12T05:11:03.877463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.861611Z","title":"Brandst ¨adt, V","venue":null,"work_id":"ace8e5d3-be8e-4ad2-ac27-537bf0bafa05","year":1999},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.344656Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:8491860ff6649e75409a61cfe9b8336086e0efd986819d47267b518215c8df40","observation_id":"a30f4a05-89e0-4498-8cbd-5319a4e494d4","resolution":{"observed_at":"2026-08-12T05:11:03.865114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.848163Z","title":"Fast and efficient graph traversal algorithm for cpus: Maximizing single-node efficiency,","venue":null,"work_id":"e5d213db-aa2b-453a-99a0-0eda093659a4","year":2012},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.348490Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:a19d240907da83f8e86cfe858b6f8251d2551589fd79c58ac612342664c9490d","observation_id":"81acbed3-9ea4-4431-a46e-d73cb2a954e3","resolution":{"observed_at":"2026-08-12T05:11:03.853247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.835397Z","title":"Graphscope: a unified engine for big graph processing,","venue":null,"work_id":"95261bda-67a9-4a54-b2df-f62add9806a3","year":2021},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.354265Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:c8b1acb55651f91948442837c61db838e5da0bd0ce8e433262ccd3e9d4d4dcb2","observation_id":"54b00b60-308a-4af4-9e2a-411a21605f11","resolution":{"observed_at":"2026-08-12T05:11:03.839374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.821490Z","title":"Graphcube: Interconnection hierarchy-aware graph pro- cessing,","venue":null,"work_id":"b8b653f9-7f2a-4d67-be46-497f828ecb66","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.359181Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:a5791dc804037f602db4d9e5ffa0fdf1bb790eb004ebd7d3d26a6328e6279ffd","observation_id":"ac5a03a9-b9b2-489c-9b9e-a746e71cd640","resolution":{"observed_at":"2026-08-12T05:11:03.825794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.807728Z","title":"Dgap: Efficient dynamic graph analysis on persistent memory,","venue":null,"work_id":"60745d9f-7a7e-4ed6-b2aa-faf68469c16e","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.363424Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:af681148ee78465198ad20a8b27ea1c863fc9bcb0b1dc6aca18a73cb0bb12bea","observation_id":"841f56f5-5f9b-4320-a3e8-fdb52784bf57","resolution":{"observed_at":"2026-08-12T05:11:03.812818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.792657Z","title":"A parallel packed memory array to store dynamic graphs,","venue":null,"work_id":"434388fd-e81b-49b6-baa5-03251a190dc2","year":2021},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.368151Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:1ae11964f4b64035b4f2435db589b302a4bdf54b858b0bcc04b357b90464d63b","observation_id":"aa924095-44d3-478b-9f02-f440e38093ba","resolution":{"observed_at":"2026-08-12T05:11:03.796504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.781736Z","title":"Packed memory arrays - rewired,","venue":null,"work_id":"3f15d9ab-b460-444d-a579-c131600c5283","year":2019},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.372917Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:4284e9d17a5ba412febbfd78164e77c3058599fa329abb4ecdde80758cd844a7","observation_id":"4651c791-e71a-4f10-9ddf-0a53b95ea5f2","resolution":{"observed_at":"2026-08-12T05:11:03.785435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.768830Z","title":"Exploiting fine-grained redundancy in set-centric graph pattern mining,","venue":null,"work_id":"0fd6d758-226a-48b8-844d-4bf7048747ab","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.378930Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:8ca74a5f444847589529f59e04864b4f9a0f68b11fb35ca5e44a525d9d987e7f","observation_id":"9500e1ec-95ba-48e2-a94a-9772bbde24ca","resolution":{"observed_at":"2026-08-12T05:11:03.773417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.755691Z","title":"Cyclosa: Redundancy-free graph pattern mining via set dataflow,","venue":null,"work_id":"57cc9bb7-3d9d-4565-a60d-86cf712a21cf","year":2023},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.383078Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:008611b0daa00acf9460549ea4394aa4d9f01e9d506183a74e689300d950c413","observation_id":"2b604ad3-4078-4da3-bb71-6eed4c64b135","resolution":{"observed_at":"2026-08-12T05:11:03.760082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.743511Z","title":null,"venue":null,"work_id":"4de83a09-8901-4387-8ccc-d8ada45f1644","year":2001},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.387387Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:a027bed07de78cc37dfd3721f30e24109ab16fb5b9a5d2a375ce5af328ebbc9b","observation_id":"449bff9c-a04f-4882-85a8-fc24638b629f","resolution":{"observed_at":"2026-08-12T05:11:03.747317Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.729823Z","title":"Data reduction for maximum matching on real-world graphs: Theory and experiments,","venue":null,"work_id":"452bb96c-078a-4452-a7fa-19c3e614037b","year":2021},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.390794Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:7cd191f9a786fa33a47f70cf7d562b5e1c0d04ebf5657c10f3b114236c74c7a2","observation_id":"2091328d-b0ec-444f-ba09-d07c7fca6ac4","resolution":{"observed_at":"2026-08-12T05:11:03.734125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.716490Z","title":"Matchbg: A boundary subgraph-based maximal matching algorithm for bipartite graphs,","venue":null,"work_id":"92142ade-8cee-4bd9-9aeb-8cf2199fd398","year":2024},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.393986Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:b31df748e7591034a7a3a0f2f3584d8bfa9b411529ce7d68f6d7765e3179c62f","observation_id":"d7eea751-5543-40b0-b781-4ca446b8dddf","resolution":{"observed_at":"2026-08-12T05:11:03.720691Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.702512Z","title":"The university of florida sparse matrix collection,","venue":null,"work_id":"4bbed776-26a5-45b1-afcf-f9eb08a06edd","year":2011},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.397890Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:bf2874ade6acc7d42ac09e7b08f23854e9334db5462fea64cb36f450e9283060","observation_id":"05a740f6-eb43-4abe-a85b-69076c43f4f1","resolution":{"observed_at":"2026-08-12T05:11:03.708007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.402075Z","title":"SNAP Datasets: Stanford large network dataset collection","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.402075Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:63189b39d141d1a435ab38cbd05dd962dec6bd4d2774a7b326c3224e32c9f3bb","observation_id":"1e7d24dc-0f63-4dc4-8ba8-c1dc09bf1d4f","resolution":{"observed_at":"2026-08-12T05:11:03.402075Z","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-12T05:11:03.677905Z","title":"Shared-memory implementa- tion of the karp-sipser kernelization process,","venue":null,"work_id":"3b945bbd-5675-4228-aba2-a1000c6583e1","year":2021},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.405923Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:aeeeecfbf5655e3501cb45fa6540866c5503cd6a76ceddf09d6d78469a1ebaad","observation_id":"0584cbf9-6338-46d7-b5e9-1b9dd61eabca","resolution":{"observed_at":"2026-08-12T05:11:03.682454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.662708Z","title":"Heuristic initialization for bipartite matching problems,","venue":null,"work_id":"10af2982-f7bc-462a-9c2f-a07f4d32ad6f","year":2010},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.409262Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:749dc48e50b30a838fef07c32651c3af369c2d47614a062fa8377d8c2320f38a","observation_id":"175d6d40-316f-4eaf-a328-50362bc0b768","resolution":{"observed_at":"2026-08-12T05:11:03.666959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.651598Z","title":"Distributed-memory algorithms for maximum cardinality matching in bipartite graphs,","venue":null,"work_id":"e9facbe7-9c36-4f82-b7fc-11295ed14de1","year":2016},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.412503Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:10f9a5545dbf0a39d0ed2b7852d5439df7ca91e28b8014bcd2cc22106b465f77","observation_id":"f1105ae5-bae4-426f-be2c-9cdc2b5c0108","resolution":{"observed_at":"2026-08-12T05:11:03.655084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.640095Z","title":"Graphs over time: densification laws, shrinking diameters and possible explanations,","venue":null,"work_id":"96daac29-aaca-4cdc-bcb1-290f6d3b225f","year":2005},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.415811Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:449df5ab587147810e2246f0c8de9b1750012c72b2b3137a51a4b0052ffc1d07","observation_id":"a12ecd26-7833-4f1f-be8c-42fc0703f695","resolution":{"observed_at":"2026-08-12T05:11:03.644237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.626384Z","title":"Defining and evaluating network communities based on ground-truth,","venue":null,"work_id":"9148f569-ef12-4a20-9724-7420cbef18e0","year":2012},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.419147Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:7c2b1555bc09fa856c149819e5940e49585b68d54aca1b8c7f8c2a4455bf4183","observation_id":"e3ae1a76-98c1-4028-90c2-bf9b06c9e5b0","resolution":{"observed_at":"2026-08-12T05:11:03.631827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.615536Z","title":"The webgraph framework i: compression techniques,","venue":null,"work_id":"6568d60d-5c32-4f85-a6b2-75c38c8cc4d9","year":2004},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.422547Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:c6deaf7abf55324c38159696c031ed63ebc5b1e4fb3bf9c94ce67926870ec21b","observation_id":"dddf7065-72d4-41d8-9b61-ea16b2351e6d","resolution":{"observed_at":"2026-08-12T05:11:03.619283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1011.5425","last_updated":"2011-10-14T07:59:18Z","snapshot_observed_at":"2026-07-06T02:19:40.798677Z","submitted_at":"2010-11-24T16:49:34Z","title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks","version":2},"cited_work":{"arxiv_id":"1011.5425","doi":null,"metadata_source":"pith","pith_arxiv_id":"1011.5425","snapshot_observed_at":"2026-08-12T05:11:03.526146Z","title":"Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks","venue":"cs.DS","work_id":"e78cb863-903c-4fc5-8bf9-a5b664f5b5be","year":2010},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.426143Z"},"links":{"cited_paper":"/paper/1011.5425","citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:3adadce94c80ce809374f4acfa7b5d0a69443c9b58bc51508dc255c9ccecc1a2","observation_id":"0e6f86d0-522b-4dc3-8b1a-a4f70ef4d5c4","resolution":{"observed_at":"2026-08-12T05:11:03.530767Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.604126Z","title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,","venue":null,"work_id":"66f348a2-d25a-4a66-bba8-b89f46947af0","year":2008},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.430248Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:b75f493dd015f1aebf561bef5e289e7f2eaefa964f724d3d56d46d36a12a3cc1","observation_id":"e9f15b57-4524-4163-a8e2-3a52256fda01","resolution":{"observed_at":"2026-08-12T05:11:03.608170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.590428Z","title":"Group formation in large social networks: membership, growth, and evolution,","venue":null,"work_id":"74e2b3a9-28ca-441b-b98f-9b4d6ecd9459","year":2006},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.433570Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:28dcf8d5fb6caeb753cbf2861370074f1bdd6c7f5c8e51b6c600b529831f3e79","observation_id":"6cdca52b-c230-43d2-9d9a-8a9eed77b258","resolution":{"observed_at":"2026-08-12T05:11:03.594528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.575227Z","title":"Data analysis in public social networks,","venue":null,"work_id":"dc481d56-652b-4f07-8ab6-7cfda5798b3c","year":2012},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.437010Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:e3dce73182a88740eb0148c99ea4087e22115c97ce42ccff9779b860cd62aa30","observation_id":"a42ac8ef-6b0e-4232-91b4-98eb74b066d4","resolution":{"observed_at":"2026-08-12T05:11:03.581178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.563228Z","title":"Signed networks in social media,","venue":null,"work_id":"a23e3d80-421a-424c-b3c8-a04930722133","year":2010},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.440229Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:84679d326e6f324d5072bb9443c4db24aa9780a95e864e6fbca6a2e9fc86745a","observation_id":"0b3dc699-6199-4797-b88a-06b2c257f397","resolution":{"observed_at":"2026-08-12T05:11:03.567278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1003.2429","last_updated":"2010-03-11T21:27:11Z","snapshot_observed_at":"2026-08-12T15:53:59.056292Z","submitted_at":"2010-03-11T21:27:11Z","title":"Predicting Positive and Negative Links in Online Social Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1003.2429","snapshot_observed_at":"2026-08-12T05:11:03.443464Z","title":"Predict- ing positive and negative links in online social networks,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.443464Z"},"links":{"cited_paper":"/paper/1003.2429","citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:53ac3c4fa7b671342584f4e3ebcbff8eb0de8b320f6a16ee7d26cd1833fbc89d","observation_id":"cfcdbfc8-6e68-4243-b00f-e2f27304442f","resolution":{"observed_at":"2026-08-12T05:11:03.443464Z","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-12T05:11:03.551526Z","title":"Local higher-order graph clustering,","venue":null,"work_id":"a4d53ca4-ec01-46ea-9bfa-ed6dbfbf2ce5","year":2017},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.447781Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:7c6a025b911a3e5e5c5666042bb24d3c0ba7cb2ce267c921786904d007f81bad","observation_id":"841b4216-2a25-410b-8936-2781eb20a515","resolution":{"observed_at":"2026-08-12T05:11:03.555333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5874","last_updated":"2014-04-23T16:09:37Z","snapshot_observed_at":"2026-07-06T03:41:52.476525Z","submitted_at":"2014-04-23T16:09:37Z","title":"Using Triangles to Improve Community Detection in Directed Networks","version":1},"cited_work":{"arxiv_id":"1404.5874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.5874","snapshot_observed_at":"2026-08-12T05:11:03.489991Z","title":"Using Triangles to Improve Community Detection in Directed Networks","venue":"cs.SI","work_id":"d6e9cf7f-a2e1-45f4-94ba-5a5bb141a2de","year":2014},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.451035Z"},"links":{"cited_paper":"/paper/1404.5874","citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:a6212777cc09102c35580583e3b2625191df5b2da3429ff6335dbdda667bd1dc","observation_id":"fb841213-ef87-47d5-a5ba-892eae232963","resolution":{"observed_at":"2026-08-12T05:11:03.497086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T05:11:03.538986Z","title":"Randomized greedy algorithms for the maximum matching problem with new analysis,","venue":null,"work_id":"d8dbfd00-c88c-46e0-a3b6-c1450aac1173","year":2012},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.454751Z"},"links":{"citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:5b758727a667387e5cb98be63408861b50f70a5f341c03b06cb42e0818a4098b","observation_id":"9fb295e7-07dc-4966-9b2e-520eede10cc3","resolution":{"observed_at":"2026-08-12T05:11:03.543520Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":45},"total_outbound_references":51},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2412.00704."}