{"as_of":"2026-08-18T23:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6791034ea664c7f70baa5c6e054970fb958eaddfd33a3ffe6e60ac7b7bb61664","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:38:14.402715Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.05860/citation-record","integrity":"/paper/2507.05860/integrity","json":"/paper/2507.05860/citation-record.json","paper":"/paper/2507.05860"},"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-06T19:38:19.391193Z","title":"On the Structure of the Power Graph and the Enhanced Power Graph of a Group","venue":null,"work_id":"c565b86d-949c-4e86-b839-bd42b9361e55","year":2017},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.063148Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:046a7747f2d8065c953f2732f3058de17ae622141ae3c4a0e753b50b75bd4c35","observation_id":"146f4477-8b26-4196-ae9d-6e9fb28e7c95","resolution":{"observed_at":"2026-08-06T19:38:19.394314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.381818Z","title":null,"venue":null,"work_id":"d5f29fd5-24d9-4044-8c70-191cd0de6f91","year":2013},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.139057Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:6dd6e0d6502d08f40ebb8933aa090d3ad690006ccf1d8f7393df484473a0d8a3","observation_id":"b59672f9-52c1-4f7e-ab2e-6625b1701ac7","resolution":{"observed_at":"2026-08-06T19:38:19.385035Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.07301","last_updated":"2025-07-27T07:13:35Z","snapshot_observed_at":"2026-08-16T15:33:38.986785Z","submitted_at":"2023-05-12T08:10:44Z","title":"Aspects of the commuting graph","version":5},"cited_work":{"arxiv_id":"2305.07301","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.07301","snapshot_observed_at":"2026-08-06T19:38:14.619098Z","title":"Aspects of the commuting graph","venue":"math.GR","work_id":"991dc640-a084-42f5-97c7-745f8ec4d66e","year":2023},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.212179Z"},"links":{"cited_paper":"/paper/2305.07301","citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:4ae0971488cd18f029e49aed8b23fb4b47f1f52b26d97fe74140f42af59979b2","observation_id":"1ec0a0d4-83a9-4be5-b8ab-241f60904c6a","resolution":{"observed_at":"2026-08-06T19:38:14.656461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.372276Z","title":"Solvable group isomorphism is (almost) in NP /spl cap/ CoNP","venue":null,"work_id":"671618fa-213c-48f2-ade9-21d8c1db7e56","year":null},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.305862Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:9b24c2459f34905719564a54ee36841fe959c4389b4b7c71577fe91c058c9dbe","observation_id":"be5ee6d0-bce0-49d0-8ad0-b93cb8ce62a5","resolution":{"observed_at":"2026-08-06T19:38:19.375376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.361757Z","title":"Graph isomorphism in quasipolynomial time","venue":null,"work_id":"1f6410f5-2d65-4b41-bf84-0b4f025d5e0d","year":2016},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.403564Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:36f9ca0148fbe5291afc4d68c4a98b018a37a021a88a52689bca6f03906f7388","observation_id":"6a95d224-3e20-4385-8b5a-38b31be1bf45","resolution":{"observed_at":"2026-08-06T19:38:19.365525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.351984Z","title":"The graph motif problem parameterized by the structure of the input graph","venue":null,"work_id":"5875a870-ac53-4961-a4c9-6ff4465701e3","year":2017},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.471568Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:a4f2689ad7d1955bf819b00d3c26b524b12f5333ebe5236b2d571df833fb3f60","observation_id":"fb6c1221-0ab5-4509-9ddb-8e84c8dc4ba6","resolution":{"observed_at":"2026-08-06T19:38:19.354806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.343326Z","title":"Superpolynomial circuits, almost sparse oracles and the exponential hierarchy","venue":null,"work_id":"fcb7e2f1-f279-4dee-b517-bd361a621100","year":1992},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.545013Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:ac483eab9db599edb0df9cfeac7e48f84e9f6d5cd4a28b7e0de0d0576e2d1bb1","observation_id":"638e6a87-492a-4128-ab5e-6bc56e1df484","resolution":{"observed_at":"2026-08-06T19:38:19.346282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.334542Z","title":"Graphs defined on groups","venue":null,"work_id":"2b6994da-7c1c-4536-b1e7-be89958d3427","year":2022},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.600285Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:2a2e8671ac36a4e1c2fdf028e3fea185ca0a2924b50d309939696678e6661f60","observation_id":"bfe0b4d1-c75b-4dea-be2a-175a6498cf1e","resolution":{"observed_at":"2026-08-06T19:38:19.337526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.324698Z","title":"Undirected power graphs of semigroups","venue":null,"work_id":"3d8d2ee0-e687-413f-95b2-8ca96f54b35b","year":2009},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.675339Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:4a7cb70d7d716c4dd90b10ca6d0172149363b5be33de48ed21a3c2109b41ce8b","observation_id":"596b9be9-9965-4b1f-9fd9-00252040febe","resolution":{"observed_at":"2026-08-06T19:38:19.327886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.313631Z","title":"The Isomorphism Problem of Power Graphs and a Question of Cameron","venue":null,"work_id":"0229dd17-97f5-440e-9edd-02d86383a8d0","year":2024},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.799217Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:f0fe260e5f1c79c6ef717aa34e26698cd0c00a8e4fb89f711270a2838c8cca99","observation_id":"9491c461-ca8c-4583-90de-ed9a0d283ec5","resolution":{"observed_at":"2026-08-06T19:38:19.317981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.303291Z","title":"The minimal faithful permutation degree of groups without abelian normal subgroups","venue":null,"work_id":"73da345d-75e2-40dc-b4a5-4dfb223a028b","year":2024},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.878192Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:288320ae280a1dfce2f95d612974d11b889e717f55656d4ebba99cea40a51e2a","observation_id":"9fb79876-8d41-4d5d-88b9-f9a434c05ad7","resolution":{"observed_at":"2026-08-06T19:38:19.306772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:19.239234Z","title":"Succinct representation of finite abelian groups","venue":null,"work_id":"711586a0-b8bb-4be8-a115-7d3330e82c0b","year":2006},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:12.953757Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:1f060e31c2ed5a0e2c6e262404b1ef915548933eff2a5dd443cc29a21a2009f9","observation_id":"2e735c67-2616-4145-88a6-c75099dd1d44","resolution":{"observed_at":"2026-08-06T19:38:19.295019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:18.892912Z","title":"Sharp tractability borderlines for finding connected motifs in vertex-colored graphs","venue":null,"work_id":"49b34c71-1423-46d3-970e-7a8da5feac40","year":2007},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.035462Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:2fcbe8f374e4924fa200c3e1de1543a570e8dddce33c7b439e7f980cca146e66","observation_id":"44dd6b80-233c-4849-895d-9e8947ae6b29","resolution":{"observed_at":"2026-08-06T19:38:19.115121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:18.643821Z","title":"The full automorphism group of the power (di)graph of a finite group","venue":null,"work_id":"960e41cc-dcc3-4c16-9de0-04cc25e77634","year":2016},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.138402Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:a3a10bd0b42068f4f7d29284bd05b74704e7c879eceac772e765592914a376e9","observation_id":"e52e22d2-bde1-411e-9174-613b96fd5957","resolution":{"observed_at":"2026-08-06T19:38:18.737785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:18.404517Z","title":null,"venue":null,"work_id":"aebaf4eb-598d-4e69-a06e-56b58989aebc","year":2003},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.234856Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:e43cc24bdb6238af1cca32c0290d4c8424d78a782d7d72e764538d156fabb28b","observation_id":"0db144f4-7948-4fae-bc0d-8f1860cda3cf","resolution":{"observed_at":"2026-08-06T19:38:18.536962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:18.110837Z","title":"The polycyclic length of linear and finite polycyclic groups","venue":null,"work_id":"ac43ebdb-72ad-419b-bb32-6d367e8bb9d4","year":1974},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.324143Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:fcd63624dde03a3ee444fb51ed8f1a5d3699166930480cf72249955f72b9ee4c","observation_id":"a4e7e426-a73a-4d7a-b8fd-fd241f9e59bc","resolution":{"observed_at":"2026-08-06T19:38:18.275049Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1201.3091","last_updated":"2012-01-17T13:13:47Z","snapshot_observed_at":"2026-08-15T04:22:25.994127Z","submitted_at":"2012-01-15T14:52:50Z","title":"Using Neighborhood Diversity to Solve Hard Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.3091","snapshot_observed_at":"2026-08-06T19:38:13.427979Z","title":"Using neighborhood diversity to solve hard problems","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.427979Z"},"links":{"cited_paper":"/paper/1201.3091","citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:afb2393a1af08129175690cd04e4ceba0753d943185ce869e36a2807b021f2b9","observation_id":"38c9025f-33ea-4a46-aaa1-c000735792dd","resolution":{"observed_at":"2026-08-06T19:38:13.427979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.05825","last_updated":"2016-10-18T23:01:55Z","snapshot_observed_at":"2026-08-18T17:43:43.027930Z","submitted_at":"2016-10-18T23:01:55Z","title":"NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications","version":1},"cited_work":{"arxiv_id":"1610.05825","doi":null,"metadata_source":"pith","pith_arxiv_id":"1610.05825","snapshot_observed_at":"2026-08-06T19:38:14.483349Z","title":"NP-hard sets are not sparse unless P=NP: An exposition of a simple proof of Mahaney's Theorem, with applications","venue":"cs.CC","work_id":"0536489c-93f7-4644-b98e-92bc61be0a06","year":2016},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.499816Z"},"links":{"cited_paper":"/paper/1610.05825","citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:b670301b539efae9e555718cbe34828caac3fc8db9b3df365b80ec37197a3d97","observation_id":"b5867991-3a0d-4b14-bfb5-146815230d4a","resolution":{"observed_at":"2026-08-06T19:38:14.550230Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:17.873633Z","title":"Geometric algorithms and combinatorial optimization","venue":null,"work_id":"c23d7e38-5c6c-48d9-b4ab-e859e6c44c08","year":1988},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.567902Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:d8c6457b52ba924fbb9e1d576184763798563bf2ebd9918b45f631cf95231f8a","observation_id":"4ade8f62-18fc-4cf5-a007-7959cb1fde1b","resolution":{"observed_at":"2026-08-06T19:38:18.005280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:17.575206Z","title":"Finding and counting vertex-colored subtrees","venue":null,"work_id":"72bba52d-3f4e-42af-8f97-a0367c8fec20","year":2013},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.635342Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:f16f24dd8cfb9870a63cd10dc2e4ead47e766701bb99b945c359a37f75e41308","observation_id":"8cc55103-f903-4b15-949a-403020d3cfa4","resolution":{"observed_at":"2026-08-06T19:38:17.722336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:17.186821Z","title":"Enumerating p-groups. I: Inequalities","venue":null,"work_id":"21c8d8c2-1f84-479b-af3b-c3655dbf4ecd","year":1960},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.703754Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:7f0bf6d5941a0065f07d79fa7d440730e487c755b3e3d0807d095384106c914c","observation_id":"547df502-613c-4c81-844a-edde3f5ba2a1","resolution":{"observed_at":"2026-08-06T19:38:17.383416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:17.021252Z","title":"Which problems have strongly exponential complexity?","venue":null,"work_id":"5758ea86-8b6a-4232-bb83-830b55b1073f","year":2001},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.778219Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:0f2dc1c82c1c1439a066ae3d67b635472e530bc757b068a114e91573ac8cfdf3","observation_id":"8b3b8844-cf1a-4f39-a011-30a101b2ff41","resolution":{"observed_at":"2026-08-06T19:38:17.080114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:16.731453Z","title":"A combinatorial property and power graphs of groups","venue":null,"work_id":"cda898cb-6dfd-48dc-9837-e7cf98294b77","year":2000},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.833353Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:55ef80fa58d940f10f1618e197b7de95f860761274980160f0808fa771aa0ebf","observation_id":"37cdbfc3-f754-44f5-8f90-7b15735437e7","resolution":{"observed_at":"2026-08-06T19:38:16.853455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:16.468360Z","title":"Motif search in graphs: application to metabolic networks","venue":null,"work_id":"c7af97c2-0fcd-445a-a317-65a476ec9589","year":2006},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.898859Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:9f714b84e7bddff940859a7e205c1660f83975db0738c9a03ca711787d879ae0","observation_id":"579f50a0-1885-4544-9ace-b1ac0a53d0fd","resolution":{"observed_at":"2026-08-06T19:38:16.591244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:16.262116Z","title":"Algorithmic meta-theorems for restrictions of treewidth","venue":null,"work_id":"ddcb1730-eda0-40f4-8d4f-b949d7a433a1","year":2012},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:13.959963Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:0bf5584fd36f7849d83e1165d8c5ca252147297e474423884fad59352cbd0ee3","observation_id":"89ab29b3-bdc3-4232-9a07-a78207fa9cca","resolution":{"observed_at":"2026-08-06T19:38:16.367377Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:15.958437Z","title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","venue":null,"work_id":"951d2ac3-a9bb-42a6-b00f-cef6f78c4f1e","year":1982},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.010279Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:def0c5439e7a03e86bb50428ec56ea88edf26ab4066742d3353e1a1c2f10a9f7","observation_id":"00246a72-d943-4af8-8bfa-8dfffe74c4f9","resolution":{"observed_at":"2026-08-06T19:38:16.079438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:15.718044Z","title":"Enumerating finite groups","venue":null,"work_id":"efebb4a0-94f8-48af-a003-bc0346b72dbc","year":1987},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.067617Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:48f737853a517cd00c0b48915bfee76556b4f58b501df745d07debb75e28d62d","observation_id":"8d32a725-8012-41e1-8c5d-84cd8b2f2e35","resolution":{"observed_at":"2026-08-06T19:38:15.810823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:15.573976Z","title":"On the nlog n isomorphism technique (a preliminary report)","venue":null,"work_id":"8a4d8907-dbfa-4bbd-9cc3-43105df93463","year":1978},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.115856Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:b26d33abf9f77a5354767f2112aa0015dc693af912cb0a7abca2ffa35cfe3fab","observation_id":"aadf4c64-5e83-42af-9287-b7654a0cc1bb","resolution":{"observed_at":"2026-08-06T19:38:15.607250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:15.364216Z","title":"Deterministic parameterized algorithms for the graph motif problem","venue":null,"work_id":"5eb2eda1-2439-4d01-91ca-73713bd47eef","year":2016},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.174111Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:a013009cb2c196239590ebf608e62d22784d83f6633208f7560f9770887b6595","observation_id":"70e69679-6bd5-42cd-b813-de69232f06e1","resolution":{"observed_at":"2026-08-06T19:38:15.476015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:15.160648Z","title":"The undirected power graph of a finite group","venue":null,"work_id":"53330a21-40c3-49c4-a559-46defa9a6f72","year":2015},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.220147Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:3328fa375580a14a38d95f422f60c5155a42a21a7b151b9255bfcc1807646fda","observation_id":"b4eca8f8-9b28-4670-ad2f-e7c30a1907a7","resolution":{"observed_at":"2026-08-06T19:38:15.263546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:14.968714Z","title":"Ribenboim","venue":null,"work_id":"ec15ee00-9c00-4227-be9c-c124d93ad038","year":2012},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.296350Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:5f3c50bf90a7a87d73733f97f7e959131c8130bb8852589764422ae71806b8a3","observation_id":"ee15f152-3873-4cb4-a2f1-8a818410b94e","resolution":{"observed_at":"2026-08-06T19:38:15.066496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:14.868074Z","title":"Approximate formulas for some functions of prime numbers","venue":null,"work_id":"5ac2fef8-2893-49be-baeb-ad389e5c9a23","year":1962},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.361108Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:16d4c841659410d41764f306df82e9df9ab76b6302cb3dba64aafbcd93d08e33","observation_id":"b27c5ee0-8e21-438b-bd2d-473ef12f9aca","resolution":{"observed_at":"2026-08-06T19:38:14.917406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:38:14.742023Z","title":null,"venue":null,"work_id":"24e8d659-5c0b-4647-b23f-db14903ef49f","year":2012},"citing_paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:38:14.402715Z"},"links":{"citing_paper":"/paper/2507.05860"},"observation_digest":"sha256:72a7ac4cee908bab5f4aa38ecf1f32166fa176086761d665159147cf2cf9bad0","observation_id":"60dbdbe1-7429-46c0-90a0-1c1d4cc6d2de","resolution":{"observed_at":"2026-08-06T19:38:14.782655Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.05860","last_updated":"2025-07-08T10:40:21Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-13T16:16:03.972797Z","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":27},"total_outbound_references":33},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2507.05860."}