{"as_of":"2026-08-09T12:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d57e1b9bcca073f6231df95556db699262ece6f4454c12042c13964688fceaa8","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:25:22.407304Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2505.22384/citation-record","integrity":"/paper/2505.22384/integrity","json":"/paper/2505.22384/citation-record.json","paper":"/paper/2505.22384"},"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-07T13:26:00.042850Z","title":null,"venue":null,"work_id":"11b5b704-cc08-4e3a-9a67-44dbdd59bbb5","year":2020},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:15.473061Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:88e064cee2596528d8d6ee2cbf3e0e0a98f064bf0008d56f9a1bf8e4fe7d6751","observation_id":"a75949ac-c286-4430-ae7b-4af771844a0c","resolution":{"observed_at":"2026-08-07T13:26:00.165577Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.926070Z","title":null,"venue":null,"work_id":"73bfd4b4-8423-41dd-805b-35cd7030ba05","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:15.765793Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:749ca06e11a97554026e005259b30bc247e98b4f4d99627b0535b78a2af10156","observation_id":"3144bdad-b241-496a-b7eb-538c5139bcdb","resolution":{"observed_at":"2026-08-07T13:25:59.976394Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.705439Z","title":null,"venue":null,"work_id":"b67f6a61-b853-422e-8d1a-678a4190a87b","year":2013},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:15.936303Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:384fcf5a3e532d34636dc211f8ae37ce83a628d563e227fcb8f2e68ca22f02e6","observation_id":"be6bbe6c-9838-4536-8e2e-f465a7d98465","resolution":{"observed_at":"2026-08-07T13:25:59.774325Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.516464Z","title":null,"venue":null,"work_id":"9e3009c9-ced7-47c9-93e3-25721aa9ba12","year":2013},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.019156Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:447385e85dd9b04eb469610329192e6403dabd0ed4e889ca5a06c8f66f742649","observation_id":"05d3635a-3575-4b3a-a69f-3ef1a77078aa","resolution":{"observed_at":"2026-08-07T13:25:59.572217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.387464Z","title":null,"venue":null,"work_id":"af64ff36-9fae-4e8c-97c4-0c9c0504b14b","year":2012},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.086401Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:31a4a8b6839a25cb4368315f33376d555ed816918fd9d7071437a60f139f670a","observation_id":"55d2334d-84f6-4e32-8c23-67b490e4949b","resolution":{"observed_at":"2026-08-07T13:25:59.434817Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.200365Z","title":null,"venue":null,"work_id":"de8fb782-0a71-4fcb-ba9c-2da2273230ae","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.152444Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:db21399cb4bbbb072b80a15a91db4666c1b71e134f2e251869bcd3867d97affc","observation_id":"c4116338-7d21-4794-b9df-fcf65313b7b7","resolution":{"observed_at":"2026-08-07T13:25:59.314747Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:59.009229Z","title":null,"venue":null,"work_id":"d0090128-0961-47aa-b662-3e028c619756","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.256252Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:d98f5ea6d73c7c08ac363e26869742b3f6f0b87a22ddd26be4ac0cd2794e09fd","observation_id":"8a1d92f2-e46d-4f2c-a597-900a262cffc4","resolution":{"observed_at":"2026-08-07T13:25:59.076851Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.853070Z","title":"Theparameterizedcomplexityofglobalconstraints","venue":null,"work_id":"a545ccba-26e0-4c00-8283-2a6e86a34bf2","year":2008},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.358250Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:97dc0bc6cdf258f2974ddd5dc8d0543c49b1f5840965854088f2a221d17d89c1","observation_id":"287d85eb-a518-43b6-a555-4fad67ccb6a9","resolution":{"observed_at":"2026-08-07T13:25:58.917061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.705920Z","title":null,"venue":null,"work_id":"f3047715-b472-4e45-9700-fbe0f65fe0a2","year":2022},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.487335Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:658b81ca29c2e42de5b62a7b12b0a8adcb4da9d67717621ed510650f452336d5","observation_id":"d571b820-267f-40af-b512-5946a1a48e3e","resolution":{"observed_at":"2026-08-07T13:25:58.802881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:16.589017Z","title":"Bodlaender","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.589017Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:55cc00e46d40c3359a077e804d83a9a09219eebac2daf481521992bbcfb72420","observation_id":"0e39e788-c4a4-4dc3-ba34-050d9b6350f6","resolution":{"observed_at":"2026-08-07T13:25:16.589017Z","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-07T13:25:58.524146Z","title":"Bodlaender","venue":null,"work_id":"584eecb1-cb2e-4f59-8eaf-e94f0f466698","year":1998},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.729975Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:7937a37ac16fe3a0fb6fa8ce5e50215d551e39f6d981124859bdba3c5260c917","observation_id":"1994c1a5-ed92-48f3-ad9e-b287d569ae0c","resolution":{"observed_at":"2026-08-07T13:25:58.609229Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.419060Z","title":null,"venue":null,"work_id":"1d67e24c-7971-49a8-b7e7-2be6f6d2a76c","year":2020},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.831333Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:e8253500755851a1209e1f78eabb4f7ecbc97c0d03dd2d621e3dea5b1d6cc240","observation_id":"8f0c8301-d8ca-4344-827a-2cd857afef7c","resolution":{"observed_at":"2026-08-07T13:25:58.459126Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.299701Z","title":null,"venue":null,"work_id":"42618056-31b1-495a-bb28-1d64f529dbd1","year":2002},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:16.954381Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:d641cd85f5b7a14ba4bb6c7912497a47938e9c09ba485e44a368e2861b557719","observation_id":"e3fc14b5-9eea-45e8-b1c6-b97457deb2af","resolution":{"observed_at":"2026-08-07T13:25:58.342327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.183094Z","title":null,"venue":null,"work_id":"db16aecf-4646-4756-a8e0-314917eb70f9","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.057809Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:0dc94bb3cc2b7c0d70e4b33ad0d873e7d24f2977a688ebff8f5d37478ec48c4d","observation_id":"b3462881-5e1d-4444-989d-b122e7347e0c","resolution":{"observed_at":"2026-08-07T13:25:58.213600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:58.052015Z","title":null,"venue":null,"work_id":"b8f3962a-794e-4641-9355-7a6227d0262e","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.149104Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:7487eb55ce6130c228d7755ec0419691505052de267c28d849c95a385a6d84ff","observation_id":"44538c83-5d07-4ad8-aa79-6e334da17f5f","resolution":{"observed_at":"2026-08-07T13:25:58.136761Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:57.769404Z","title":null,"venue":null,"work_id":"f8d2943b-9e40-4112-a843-ad7b39c6b6fd","year":2017},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.331140Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:a3e5907782c62a735c8a6d8f1a56e6aa0d4b6db8d5c9882ab8f9c9ff54dde795","observation_id":"0e311b69-14b4-412c-919d-4cde4da4a1c6","resolution":{"observed_at":"2026-08-07T13:25:57.847279Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:57.624752Z","title":null,"venue":null,"work_id":"5a266d3f-c5b4-463d-af8c-da59f04af5f0","year":2021},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.386914Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:4167d0abfddfa018b099d34e904f3cde9d0f6d40355fc4a2a31dea121e97ff2f","observation_id":"f7821d03-9aa9-44c0-a115-0a6fedce1789","resolution":{"observed_at":"2026-08-07T13:25:57.696716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:57.466052Z","title":null,"venue":null,"work_id":"f481cfa0-d427-49d5-8fda-668bfa6b47e6","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.529917Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:294f8a51d60b5ddca4a7aa578ec617c7f7f308268a50de635dc91a822fb9a449","observation_id":"a0bc4adb-931c-4e11-9161-7c421848fb83","resolution":{"observed_at":"2026-08-07T13:25:57.566537Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:57.291180Z","title":null,"venue":null,"work_id":"2bd86f1b-fd29-4280-b8c4-76964e201732","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.602466Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:c6abfa668d8287658d8acf32422e397585773cb91a147c54b8c6d15f4f5dc304","observation_id":"2ba04d80-5bb1-4c7b-b6ab-c4e4134f0627","resolution":{"observed_at":"2026-08-07T13:25:57.335001Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:17.710397Z","title":"Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.710397Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:c4bad9cabb3b3beaac12f002f385af1b6091aeb68173e503b07456cee4000d1a","observation_id":"60c14e5b-1ba0-432a-bc60-721bda3fb70e","resolution":{"observed_at":"2026-08-07T13:25:17.710397Z","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-07T13:25:57.116617Z","title":null,"venue":null,"work_id":"781dd409-5c10-4509-82aa-d02241c67f38","year":2018},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.769648Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:ceb197cea2f59db96b691bf735bcc2f5f403fd5a4c0724cc4c7e0b55d96f7a2d","observation_id":"760c869a-b5ec-43fb-b37d-9f0c5a8e1ef8","resolution":{"observed_at":"2026-08-07T13:25:57.203084Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:56.968882Z","title":null,"venue":null,"work_id":"30f43649-dbd6-4dad-9c1a-54537982e5cd","year":1994},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.816618Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:7affbe40b774c3c5f28aed329eb5e2c35e3dc71d9eaf58f0711b6f09d3c75c16","observation_id":"442c6e94-98a3-410a-8fb6-309ca1705f60","resolution":{"observed_at":"2026-08-07T13:25:57.007960Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:17.923175Z","title":"2012.Graph Theory, 4th Edition","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.923175Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:e2ae3a1e135cbbcb0a30d8e2f5c1ee164d338292adeac3ac27a03c8eedc19596","observation_id":"7a76f0c7-00bd-4814-a64f-814cef65e59c","resolution":{"observed_at":"2026-08-07T13:25:17.923175Z","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-07T13:25:18.101604Z","title":"Downey and Michael R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.101604Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:6896901ecfb396a9fe5bf5800c8d802cdd834144014c4fd1a2538ea046163d44","observation_id":"9f6b4c7f-dbc8-4504-9718-0e322b84bbfe","resolution":{"observed_at":"2026-08-07T13:25:18.101604Z","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-07T13:25:56.754118Z","title":"Dregi, and Pim van ’t Hof","venue":null,"work_id":"e3f686c5-9d76-4261-b7d3-1fabe76059ef","year":2016},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.162073Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:563d64ae45fa62e4982bd1ef707372e0a4aa3abfed6b92b7535ff61cfae8394f","observation_id":"2a2d89c3-8670-495a-8dd2-3f6af767f60c","resolution":{"observed_at":"2026-08-07T13:25:56.894047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:56.554749Z","title":null,"venue":null,"work_id":"0954aa91-af5b-4524-9b02-0e43cf35758c","year":1980},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.255568Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:06e179258f08820842d8a4e6cd033b837d557e9748a2242ee49fe24664775ff7","observation_id":"6fe77af4-ab1c-49cc-948f-b23a0dadf942","resolution":{"observed_at":"2026-08-07T13:25:56.635254Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:18.296967Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.296967Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:6e6062b37e3db4db6ae0c5719d0ffe9713d2bb59e1535e291022cce6005d1034","observation_id":"2fe07e77-a995-4540-9a37-9f23db8cf90b","resolution":{"observed_at":"2026-08-07T13:25:18.296967Z","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-07T13:25:56.304888Z","title":null,"venue":null,"work_id":"6f9f791a-d1f1-4162-bb09-0c6e0df4c571","year":2021},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.346381Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:4e74a6a31da54cd2fce7130eaec8421c851ff2850033ed90a44ceb4305204233","observation_id":"78d4c838-379b-48cb-aa5d-8cf64be900c5","resolution":{"observed_at":"2026-08-07T13:25:56.460831Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11847250_25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:25:22.895487Z","title":null,"venue":null,"work_id":"6e220744-ef17-4b74-be62-d8cb0145d3c1","year":2006},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.480802Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:c9ac9b9e32a4a9b338b00845edb1e5c98535a953a55df298badf5be663185a00","observation_id":"22255107-81f9-4bd5-b347-fbd0c7976592","resolution":{"observed_at":"2026-08-07T13:25:22.996589Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:56.085166Z","title":null,"venue":null,"work_id":"ce2ad32b-a0c3-4252-aab4-84552ea62768","year":2025},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.560061Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:7ab509d4db44c8984eb649d56e46085d780abe10e9197b7cff0497fa11cd1a0e","observation_id":"2db4add5-88e4-4602-8475-a8471962ea5d","resolution":{"observed_at":"2026-08-07T13:25:56.154752Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:55.895577Z","title":null,"venue":null,"work_id":"c5a100fe-c58c-4a2a-ba18-b11a6242393a","year":2018},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.645573Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:d8c3471a31dcaa89c199682571e313f564ea5283d7ff1631c7f24399e24618e4","observation_id":"cf3d93af-cd87-45b3-9fcd-61b7263b224b","resolution":{"observed_at":"2026-08-07T13:25:55.983261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:18.777276Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.777276Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:2a3bf9482fa608a571f582a3d85c175b9d24854a0f294825c64bf70cb773fa88","observation_id":"6a01bc5a-3714-4daf-aa17-603c9940d40d","resolution":{"observed_at":"2026-08-07T13:25:18.777276Z","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-07T13:25:18.899954Z","title":"Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:18.899954Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:b4955b414b9b53eeb57ede611e852e42c1f679e2360d1380c25cb044d780ce15","observation_id":"c9f19d95-60c7-41da-ae4b-b6d93f7373b3","resolution":{"observed_at":"2026-08-07T13:25:18.899954Z","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":"10.1007/978-3-642-28050-4_21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":null,"venue":"Lecture notes in computer science","work_id":"6d02f76f-fdcf-4302-a3f8-9eec44e1a1df","year":2011},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.012670Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:0a109c6a37561558d82b06abd1b3da8970cc43dea814fdb661ae7ae3e02a0f70","observation_id":"66cdf995-b8f0-406e-b0ac-6b8afd09efb1","resolution":{"observed_at":"2026-08-07T13:25:22.780737Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:55.651608Z","title":null,"venue":null,"work_id":"59401620-5354-4dfb-873a-dfd6fc10791a","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.117197Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:bac140b4f5a9b756c8f028ed35a52a890293862ec0770d6ccb984835cd6ee147","observation_id":"79c98c50-7f8b-426a-808f-d0e83a56c091","resolution":{"observed_at":"2026-08-07T13:25:55.786704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:27.358738Z","title":null,"venue":null,"work_id":"f6f47d53-d414-45a1-9f73-cc1497f5172b","year":2009},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.348530Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:b29710926901f31767695fa5e8edf0311a80df5a2fb08f0d5c6cfe630849afbe","observation_id":"01711f38-0064-4c48-90c3-63b94b449e68","resolution":{"observed_at":"2026-08-07T13:25:55.346717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:27.298600Z","title":null,"venue":null,"work_id":"7f09f23f-0f64-442b-b00c-285bc745e7fe","year":2007},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.430212Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:9103b5adf6b34674207d2ca94f7446fedbffeecd080cb3ef8644ba6cefe246bb","observation_id":"f51c1769-166a-4d43-a434-e54a4a98f8b3","resolution":{"observed_at":"2026-08-07T13:25:27.349947Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:27.230218Z","title":"Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, and Anders Yeo.2012","venue":null,"work_id":"db3d3110-0af9-4389-8eb9-8ae2381d2629","year":2012},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.486303Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:750aaf970446c4b6ec1cfac26d14d64af4c3387d1ab56dd637a4333cb2ac4fdf","observation_id":"8fbca118-c73a-44ce-a27d-017231fba861","resolution":{"observed_at":"2026-08-07T13:25:27.268820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:27.126814Z","title":null,"venue":null,"work_id":"eda6f6f9-8674-4f1b-99b6-f9a369e64cff","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.570449Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:67ff083caf2080b67826c760234ef04aee2d52b8e8f1012b64d900408b4194e4","observation_id":"1a49d2d2-7a1e-40e5-8323-45e1998de89d","resolution":{"observed_at":"2026-08-07T13:25:27.182801Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:27.015785Z","title":null,"venue":null,"work_id":"262ebc49-e548-4c04-a059-33e62439a07c","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.642238Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:563c9e972fd37a05d71064bcb6dd0e28120676d647f7d75c457413718bd2d82d","observation_id":"dd75dcc7-560f-4ea9-ab20-2cbe80513a82","resolution":{"observed_at":"2026-08-07T13:25:27.068438Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.924319Z","title":null,"venue":null,"work_id":"7b71ef95-01cc-4c30-b09f-8389c65ecb62","year":2022},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.694157Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:637b1bf46606e0d127524e5c245b29304b1c447fec6ac7652e280423a920b39e","observation_id":"cd4bf188-2d3c-4f0a-bdbd-4113fd514664","resolution":{"observed_at":"2026-08-07T13:25:26.944611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.786555Z","title":null,"venue":null,"work_id":"b7692ee2-a013-4c6c-8b1a-6f46449717f4","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.819817Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:76df75b663b0e9804db17cb6375d65fc5edc3e4249f226c128c7221925b92f6a","observation_id":"ee5476f4-95e1-434c-9733-5eb0d36658fd","resolution":{"observed_at":"2026-08-07T13:25:26.851162Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.586673Z","title":null,"venue":null,"work_id":"bd480a5a-f664-4585-a5cc-0d5013910a15","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.013785Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:51f10d5b339e4a9845447e4201e34789d6f3fc2f0259346c93539677c73ffe4a","observation_id":"dca357df-6dab-4523-be40-4dba857ac998","resolution":{"observed_at":"2026-08-07T13:25:26.617227Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1006/jcss.2000","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:25:22.523403Z","title":null,"venue":null,"work_id":"d2d470c9-3b27-4a75-84ff-13b15a71afbd","year":2001},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.100647Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:4cf6113e574e77df70ea228e5da020b0290d31ccf7bca0ecd7d059091e417d80","observation_id":"f4ef2d5c-4046-4b65-9560-b123e14f7193","resolution":{"observed_at":"2026-08-07T13:25:22.570537Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:20.206378Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.206378Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:162454b404d2b2f9eb33554906c9a93cf4cd3da2537cd47a564e7325b93e7d85","observation_id":"ce878751-9ab8-4087-9607-b28b6f596426","resolution":{"observed_at":"2026-08-07T13:25:20.206378Z","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-07T13:25:20.332375Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.332375Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:6149a3341b1001069f18ffa98060973580fbb7b220f3828461e0876aa12daa92","observation_id":"9692daae-8366-4088-882c-10018be5e561","resolution":{"observed_at":"2026-08-07T13:25:20.332375Z","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-07T13:25:20.416832Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.416832Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:3bdcd6126ffacf91f9c06b385b4a778daf576b8789065b1d784297ffd4f492b0","observation_id":"feb1fa59-c0e8-45a3-94ca-9276a1725130","resolution":{"observed_at":"2026-08-07T13:25:20.416832Z","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-07T13:25:26.393996Z","title":null,"venue":null,"work_id":"9797e839-757c-4757-8727-99c7ede48a61","year":2017},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.540776Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:d4af7a398d08772808e53bbf88a5ed848577e75b288bed68a2f4253a830dcfdb","observation_id":"0d248926-e79c-4a54-9d9e-7dc72e504ab0","resolution":{"observed_at":"2026-08-07T13:25:26.481531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.197308Z","title":null,"venue":null,"work_id":"ec174caf-e8c3-4f71-9d5e-97eb9a526952","year":1983},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.633956Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:98a741c0758867bde5b7318858162b78dee54ac4f7c8f687c9fa40ce55c9be29","observation_id":"703d1573-0df8-414c-99bf-0c85a82949e2","resolution":{"observed_at":"2026-08-07T13:25:26.304827Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.115387Z","title":null,"venue":null,"work_id":"f4a13f48-d124-4e5c-8d72-0169e78c4087","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.723654Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:e1ea05a92bf169414740602d40de1fb8d4b0a734c1f3621ffe4745b05bbc94c9","observation_id":"5596d139-095d-4dc0-aacf-0cc7e0730938","resolution":{"observed_at":"2026-08-07T13:25:26.146477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.028342Z","title":null,"venue":null,"work_id":"ef9773cf-c119-4d59-8e57-375ea958e6c1","year":2021},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.841510Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:d6e24297af6f2f0094c3f26ccc82bb7113146613705d866e5fe9df5b56834c14","observation_id":"9fc903bf-431e-4d1e-8e9b-fc973ec9a8dd","resolution":{"observed_at":"2026-08-07T13:25:26.070781Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:25.898255Z","title":null,"venue":null,"work_id":"912ed3ec-ac80-470d-a04a-f9f46dd26a0b","year":2019},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:20.955854Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:a7a7e1107aee58dcc79e108ef59b596b1c1bb992a6a682dd83c625886f77705b","observation_id":"7ec7ef9c-8585-4b12-8123-63f786745207","resolution":{"observed_at":"2026-08-07T13:25:25.954932Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:25.761983Z","title":null,"venue":null,"work_id":"04c74642-33cc-4856-b73e-a29ddd186f4c","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.086587Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:b792dec4e2f242fabfffacaf8e2ba2407f4097cf67cd39ffb1ebf6f061cc2b3c","observation_id":"852c3df7-47dc-4e01-a3e8-fc3d9decabc7","resolution":{"observed_at":"2026-08-07T13:25:25.837546Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:25.579171Z","title":null,"venue":null,"work_id":"dc405148-6f11-4878-8071-17383af365dd","year":2021},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.195460Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:55afeb098bf69b14da3ad2595ed187d3d328872f96239d5596e226b7942171df","observation_id":"69838dc2-c4d1-4bd2-9a7c-f3844ed58a54","resolution":{"observed_at":"2026-08-07T13:25:25.661908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:21.303900Z","title":"2006.Invitation to Fixed-Parameter Algorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.303900Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:4699844241dd68e46f2f1b33afc17a3a246a7887908b7faeee8b89350b0cfc48","observation_id":"1998f3c3-f821-4588-a682-6c76703814c5","resolution":{"observed_at":"2026-08-07T13:25:21.303900Z","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-07T13:25:25.387429Z","title":null,"venue":null,"work_id":"41e1d06b-585a-4e14-883b-e5bd61872088","year":2000},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.399279Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:ac657c39f79abf19ce02f426abbed3697f01107f7247eb2dfd35b13af6fb04e8","observation_id":"37a64ceb-287f-4d95-8766-dc23cbc80a6d","resolution":{"observed_at":"2026-08-07T13:25:25.485239Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:25.155741Z","title":null,"venue":null,"work_id":"2d9ba8c0-f280-4621-925f-3ec8a4be0de6","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.467917Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:60e1a118b6b466203355563c5f8a742d41f6e6b9229e9a1154b288f83a829bee","observation_id":"7a8fa525-9ec5-4784-bd97-0c6a26f1b49a","resolution":{"observed_at":"2026-08-07T13:25:25.265502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:24.710201Z","title":null,"venue":null,"work_id":"b55b6536-1539-4d7b-a738-144c2c5681c6","year":2009},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.648076Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:f5ce1ca879b97a0e6ca3d618d6267f806cf1f047c805849fb4c2d2272e6794b9","observation_id":"9c6c9571-b7aa-491d-af8d-706f72d316b4","resolution":{"observed_at":"2026-08-07T13:25:24.810460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:24.459960Z","title":null,"venue":null,"work_id":"f67fa91c-4e46-453b-b5c9-0ec5b0fb51fb","year":2016},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.741285Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:3a0d17e7ae39b0d4b67511daf7fa6ef2bea4a3fad9ee65ac02823c3f54141e4e","observation_id":"e78812e6-27db-4174-9490-3aca13cdfd4e","resolution":{"observed_at":"2026-08-07T13:25:24.568440Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:24.255297Z","title":null,"venue":null,"work_id":"f5b468d8-0626-462b-8ef7-791af249fd6e","year":2016},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.850240Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:7fe286a4b99869e6ec0e0acfba46417871c71e79d3ad6033d7bf398e6423bd18","observation_id":"3af32e75-3431-42af-87f8-6f67b582719d","resolution":{"observed_at":"2026-08-07T13:25:24.355042Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:24.000287Z","title":null,"venue":null,"work_id":"e6e3bd67-c0cf-4ca0-a803-71e30537e2df","year":2015},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.925217Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:5d4d502ca5d214bc092d4b7ad07e521ae15735d6e94a19b0064b81bb8576d331","observation_id":"5fde6800-4824-4c59-9fab-3544f262b142","resolution":{"observed_at":"2026-08-07T13:25:24.108807Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:23.891304Z","title":null,"venue":null,"work_id":"dae62a5b-7b88-4fdc-bf70-614238607e13","year":2010},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:22.004634Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:bc84fb9687c6a9063a6c615959d71738a4c51ca8ef4507ff0f64d1201ab0a461","observation_id":"2daa8f7d-aba2-4cc8-9aec-6896331e3be5","resolution":{"observed_at":"2026-08-07T13:25:23.949921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:23.693471Z","title":null,"venue":null,"work_id":"cd12e798-64f2-49c1-9196-e85072b19807","year":2017},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:22.114986Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:3be6c71333f4699a607b598527778cb19645acb2b7e1f1465d73c9ff8c60bfd8","observation_id":"14bd6836-fbcb-4dbc-b07a-b5900f82cd7f","resolution":{"observed_at":"2026-08-07T13:25:23.774534Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:23.532456Z","title":null,"venue":null,"work_id":"80ec9fa6-1776-4e86-8c55-8fda17e46c4b","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:22.222694Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:20566c9e446b68782f56f1992ad20076d2018b19b888e989a4f72b27d02555a4","observation_id":"7fce6c9f-c240-45fa-91e6-6a25ec68c91d","resolution":{"observed_at":"2026-08-07T13:25:23.605788Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:23.217935Z","title":null,"venue":null,"work_id":"a8e629e7-2425-45ba-9316-5e2617fc1b21","year":1998},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:22.407304Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:2f43d2d817fe76996c78b8d7afed6e2f3ab032b3bc0c8ad4b17edc7219c459f9","observation_id":"72cf8ef7-bb1a-48b8-bff4-e0a6fe14a4d1","resolution":{"observed_at":"2026-08-07T13:25:23.335903Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:23.415198Z","title":null,"venue":null,"work_id":"28b1f202-0ebe-4cf6-a5fe-88809a63e6fa","year":2013},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:22.320231Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:0bcb1a641ccc00be432dd8caad8207e40c0210e55e4a1cca8a957b8f04c98f65","observation_id":"97a72714-cda2-428e-82f2-d4be189423db","resolution":{"observed_at":"2026-08-07T13:25:23.468121Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:26.660889Z","title":null,"venue":null,"work_id":"02077d16-d7ee-4439-900c-2ea2184845ca","year":2015},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.899658Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:826274cb64af779cf3698a744b979efaeff9f4357728a58695d5bbe38231b167","observation_id":"e76ca6dc-5d6e-4ca2-b5d6-72d7f3e8d452","resolution":{"observed_at":"2026-08-07T13:25:26.730912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:57.898351Z","title":"Cambridge University Press","venue":null,"work_id":"8a447d65-bf9b-411b-9056-7f4a0b2e969e","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:17.226268Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:a3e4b1d8ea75da6be4388b8b44204468d5cd2037ac93ea35bcdf15d2d1307df8","observation_id":"0ad6b7a1-79f2-446d-bbc0-fef1610857cf","resolution":{"observed_at":"2026-08-07T13:25:57.983007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:24.931510Z","title":null,"venue":null,"work_id":"0ec05539-0e84-47c1-acfa-4e92e3dde2e3","year":null},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:21.558804Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:18e95e3bd4a6010eeaa173fb8d8d3efaa0c3be715e7b80c3ee7ae481a61cd741","observation_id":"8c9a1641-18ed-4421-9efd-dda350e3431c","resolution":{"observed_at":"2026-08-07T13:25:25.046431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:25:55.474753Z","title":"Artificial Intelligence 325 (2023), 104017","venue":null,"work_id":"74046305-f4b5-41e2-9c89-76ad6d180b13","year":2023},"citing_paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:25:19.244733Z"},"links":{"citing_paper":"/paper/2505.22384"},"observation_digest":"sha256:5bfe5cfea685ba4a1a4793757c21e87a2868fc4a7904663ece5fa3b1c37724a7","observation_id":"81c9dd93-86b5-4231-b5ba-9a3fde2ea937","resolution":{"observed_at":"2026-08-07T13:25:55.552337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.22384","last_updated":"2025-05-28T14:11:14Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T13:05:55.234115Z","submitted_at":"2025-05-28T14:11:14Z","title":"Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":61,"verified_exact":3,"verified_fuzzy":5},"total_outbound_references":70},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2505.22384."}