{"as_of":"2026-08-12T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5f290885362705aaa66f1d299baf039902921184967e6229a8892f136fca39f","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T09:42:28.508680Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.05040/citation-record","integrity":"/paper/2607.05040/integrity","json":"/paper/2607.05040/citation-record.json","paper":"/paper/2607.05040"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"Popular conjectures imply strong lower bounds for dynamic problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:cf0c44294b5a52589f7db4bd250b650fe2fa62e4154abaf96292ffb4e0125c6d","observation_id":"5217e403-2fca-4dd0-be02-45d598a966e9","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Beyond Pairwise Clustering","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:8e337b5a1bb21031f59e67f95025a75027c0c0f54fc7f799112cb2355176eead","observation_id":"8b392e71-9aaf-4331-8f63-c858b050b5ef","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Ahmed, Jennifer Neville, Ryan A","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:bcb30e525df87f1d7d00906a2c8d6fc1cd4574e1e4e815f54f0b4fa78aaa1251","observation_id":"5e93a2ec-efba-44d2-a67c-df3d9799e2f9","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13579","last_updated":"2025-05-02T14:57:16Z","snapshot_observed_at":"2026-08-12T19:55:30.692711Z","submitted_at":"2024-09-20T15:29:39Z","title":"Parameterised Holant Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.13579","snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"Parameterised holant prob- lems.CoRR, abs/2409.13579, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"cited_paper":"/paper/2409.13579","citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:662b2f8a65a020a9dd63fa55d89a66940b2ca2c611f149f23918b2fef462ddcc","observation_id":"6ff6a793-e9e6-45a4-8b6f-7a63191bf1e8","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Parameterised holant prob- lems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:82d82a7aef4b3a67b3bbc9e950c6118d2e3e4c26c03861bfa5a3ca184759253a","observation_id":"5792a211-944d-4d8c-8d61-1368d8aaf20d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Cenk Sahinalp","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:e772347a30be05c8a5b2e3f3634eaba1d44462691ec80dd4a0dfc3a673e24d63","observation_id":"48feaea6-7ded-494d-9286-c3f606e32d6c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Clustering in graphs and hypergraphs with categorical edge labels","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:3dac81e7571aafa54aabc255b8555cbe1625acd68a869c4568bdc8e47c093d86","observation_id":"0e5a1fb6-8134-4fe4-8726-520503906aa4","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"On the desirability of acyclic database schemes.J","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:cfc7b74a5d912788f5043d1648de5f1112e0c78ad193f7c06b02de38ba9e6bc4","observation_id":"aab03b9f-0a03-470e-8ba8-8e1dc31b8ea6","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Benson, Rediet Abebe, Michael T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:34750c1b19a4fc1c9310b0d465415a60fc0dedd0a3165deb63bc42108b89a707","observation_id":"7f77b887-05c4-4301-b511-1f707cf15a4c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"(The relevance of the list: propositional logic and complexity of the first order)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:a24462dff106fa2cb4b6f5d5c50850a248f9817c08a43210b0d4233dbe885c20","observation_id":"be740208-d3a5-4d57-9cc6-5b70e74d6072","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Hypergraph acyclicity revisited.ACM Comput","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:a7c4d890912a49b36972021b24ea1d8529e5306c139d453e4214adc395fee0b4","observation_id":"88c594fd-358f-4e81-87a1-c06824d4d896","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-07T00:15:59.295896Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14081","snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"The complexity of counting small sub-hypergraphs.CoRR, abs/2506.14081, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"cited_paper":"/paper/2506.14081","citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:88e9f7ffa63524f24d9f03116f02ccf87e56658619164b304ba39ec4434cf487","observation_id":"fac1be79-4342-4d26-9181-9adc8e75a61c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"The parameterised complexity of counting small sub-hypergraphs","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:5bb2a2324779ad094cdff77693f54b240527ada94497370a356fb6ad5a0c9cd9","observation_id":"196105b3-4858-4029-9403-820d6523503b","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting subgraphs in somewhere dense graphs.SIAM J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:031698920d2f0df9800081a08fcc9859da34777b7c18d2201eb8044a20e230f0","observation_id":"aec8bddb-9144-44ca-9445-3ccfb89de2f1","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting answers to existential positive queries: A complexity classifi- cation","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:6aad4afe7cf576293c0d57c582645aca321bdbdd4f67461641f9be767d0b8967","observation_id":"2312f4b0-bcc2-4bfc-a3df-ae5fdcef94f4","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Juedes, Iyad A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:1f482bc76108cc0650996a1afe6a59bd7b9a5ebf2c5cb47ca6d7728a3435e30a","observation_id":"a37ad3a5-471f-4e7c-98fc-6ee4e57dfd4c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Kanj, and Ge Xia","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:4aa9c9fb667a86c7900a8040429bde08bc71f573272744d67ce76492f5442200","observation_id":"99e4f9d9-4c0c-48dc-b674-bb43f430440d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Understanding the Complexity of Induced Subgraph Isomorphisms","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:1bb0a3f33bfa1ea6f17ebdb19ab6316e3ae8b9385c28f353db2e31ad78cde592","observation_id":"f58bb129-ff74-4215-bc33-c9524540f640","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Homomorphisms are a good basis for counting small subgraphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:730a327e80afb9a92ff673186e2a0f33a7cb3f6e271e4c7cc31c04353f432318","observation_id":"16dfb0ec-598c-40eb-bcee-7644869a5a46","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:b3db115bc5141887e2b93131878cfaaa9c5d4c89f27fdd690dbc1d8cac964f50","observation_id":"8ef28f39-69de-461a-a424-9e8356b5fd97","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D´ aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:14465624fed4b25a48bba1df6920e5523b4fedcbb411fb154f6d14db3788ee3e","observation_id":"d653dcec-0a72-465d-bfa7-fc42460e3d3c","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"The complexity of counting homomorphisms seen from the other side.Theor","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:ac53eb8483a055abaecb15b7f77b1022108b85add89fab231e1fc0d6768b6e28","observation_id":"4651a336-a0da-4146-9b89-db9b23cee272","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting induced subgraphs: An algebraic approach to #w[1]-hardness.Algorithmica, 84(2):379–404, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:91da72e4bf0df6647ae616af6402b2add6d4017813d2caf40e67269e554248d9","observation_id":"c7c4ff48-425c-4e48-9c40-5082aa86a022","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting small induced subgraphs with edge-monotone properties","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:3b9f0f343d17a2b132c510408f4909539a79e9802c7ae864eba011801dcf57b8","observation_id":"55571962-b4d0-4115-af62-2cde24dc4992","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting small induced subgraphs with hereditary properties.SIAM J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:183bfe75fb1a480e5038a2b7079f84c9ed0d8c4ab3e92f1e98339fa965f76db9","observation_id":"6f1a67bb-6dab-426a-87a2-2878527e6979","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:c6869b316991ce83ca4f1dc491a050e5bf854b70b08d7cbaa330e392479d7348","observation_id":"117535e6-7462-42a2-b5b5-5a19d588de55","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Hypertree decompositions and tractable queries","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:dd3d192ae8936df13944e643564e0b751cdf2a7cb33447565d3d3c0ff93950f2","observation_id":"d39f9910-2a77-45f9-99e5-8360914b468f","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:35b83fbda6b683aefe6a66a5f8ae622b34df80ac898480581dc2eb29997fe05a","observation_id":"78e6696f-266c-4d6c-970a-6fedee96e9ca","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"The complexity of homomorphism and constraint satisfaction problems seen from the other side.J","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:ee2afd94f1ed07f9d75813d5137cef709c6b1ba669529d459f83de623c9ed60a","observation_id":"4f7efdaf-4c86-40ce-8a6e-3c0668a74a3b","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Constraint solving via fractional edge covers.ACM Trans","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:d10577a4b417ae3b5f2533d72dc6a9b6fe8b31a05f6c8303efa93e485584108a","observation_id":"641c95ed-3619-43de-9dae-c038623ba14d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:0db84bdc1659da1a6525e618bcb15530456f0cd9a12189933acf0703e1ea4a90","observation_id":"4c240ae7-9ea8-4914-9f1e-63a760da3d33","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"AHP: learning to negative sample for hyperedge prediction","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:32f6eba96a39bc69a3f6d5475ae4d4865ebcb047d28c9fb88e018fbd55717026","observation_id":"2885c249-950b-46eb-b601-fe089a73ac4d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Learning on Weighted Hypergraphs to Integrate Protein Interactions and Gene Expressions for Cancer Outcome Prediction","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:16cdaaaab150cefe1d8370ff7794f41d1199483264f118cc6c9f01575aad5a36","observation_id":"0ed278d0-77d0-459c-ad89-6cd5d0bd26fb","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"On the Complexity of k-SAT.J","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:297cd2eb5a73020a70b12fd60713b989f7fed3a20a72dd2660c9242a5b07bb92","observation_id":"e74f97c1-d926-4bf5-a99c-32775881bbe0","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Adaptive Hypergraph Learning and its Application in Image Classification.IEEE Transactions on Image Processing, 21, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:2e0e40cbf5c026b661cfc1d98f97cf5bd11d63bf17043539f9a100af418ebb1d","observation_id":"3509a13f-ed3a-4f27-986a-03ce666f1a90","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Topological network alignment uncovers biological function and phylogeny.Journal of the Royal Society Interface, 7(50):1341–1354, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:54b5b3a18738500ec5465358bc20eeb6def98015012a6f3b32deb0b46ffd51bb","observation_id":"249e54b3-2006-40b8-bb78-a080955c8358","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Hypergraph motifs: Concepts, algorithms, and discoveries","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:cff7631ca0e5d7de688982d5d0cb9a3965a4729a47d77d4f370d20c85e1040f3","observation_id":"6503b37a-3045-4a2b-8205-538d1e51cd14","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Hypergraph motifs and their extensions beyond binary.VLDB J., 33(3):625–665, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:51f57accef115371f0e3651eb0571ffe7852244cc5f38a12fd9b929d90253d87","observation_id":"c204530a-2766-4bf6-bfae-2fe09a8e33ad","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Link prediction in social networks based on hypergraph","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:0d3f524532b3745eb4cafa53c3cd2f05ff5f37b897cb461526af1f3aa81d8c8f","observation_id":"a9fb3329-1a92-440c-b7fb-05af002e2ded","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"American Mathematical Society, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:dea0b72b00702c5b8ff1684aabfcfa7e8a526cfabcd5af81e58bf8252d460fa4","observation_id":"269a9204-6558-470e-bc7f-6694facf2bd9","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries.J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:4ab8b5167878e9ea86ebf0faff20b7d1d8942391a252bd6ef609d60fd26e78c0","observation_id":"1e2d222e-9541-446d-b296-6031be40f920","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.17702","last_updated":"2025-06-21T12:29:29Z","snapshot_observed_at":"2026-08-09T16:37:55.294159Z","submitted_at":"2025-06-21T12:29:29Z","title":"Lower Bounds for Conjunctive Query Evaluation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.17702","snapshot_observed_at":"2026-07-11T09:42:28.508680Z","title":"Lower bounds for conjunctive query evaluation.CoRR, abs/2506.17702, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"cited_paper":"/paper/2506.17702","citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:b82fa0cd714389e8de0fdf7572079f11a48af7861c51266fdb21c37e55156fa2","observation_id":"fc8ff1ed-9a65-49fe-baeb-a854949b449d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Lower bounds for conjunctive query evaluation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:1c27d3cf42a9fa301f22ed9467f2e6a1402bae696ec287b745ac0cdd86162ff0","observation_id":"b738eb5e-0a54-4181-af4f-157f28eeecb2","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:d96f0a23cdc06288bad708b0a77a503cd5d41a1592bec0994c8ae3d7ef9a774a","observation_id":"f2611c23-705b-447b-b22f-4e5249c1e06d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Parameterized counting and cayley graph expanders.SIAM J","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:b79d811f638fd53942aba5c692cb832f00f3a653e50fc0803a7de377d4b1093b","observation_id":"261b93a2-365d-44b0-9a05-ffbc65803b4e","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting and finding homomorphisms is universal for parameterized complexity theory","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:b42eda7a381d21795cd133bc6e83089186949044009b8fee8f321115c74a30c4","observation_id":"1cec487f-87a8-45fa-bc7d-e9d3c2a4d285","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Query answering exploiting structural properties.SIGMOD Rec., 34(3):91–99, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:4e2595e8abc7479b6bd9eebcc447f986d8a003bf02c534a3ac8e55f14a9f94dd","observation_id":"2b6c04b0-797c-4753-b718-9f2e5c818d90","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"StreaM - A Stream-Based Algo- rithm for Counting Motifs in Dynamic Graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:2604e4bc7d481a8e90a49aafc6503a38ac825c3192b3d68239e7f8aeb8711dbe","observation_id":"30ee32f4-a5b2-4c8f-8173-c9a0105ad7ea","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Network motifs in the transcriptional regulation network of escherichia coli.Nature Genetics, 31(1):64–68, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:d4ccdb46a5b48c4c33d9fc013a37ec8d54dd3d8e35fc426793e440744c91830a","observation_id":"4c1b00c9-c096-4820-ac6b-783450cebdea","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Stanley.Enumerative Combinatorics","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:8b866efce4d9b6ae1604c153dcf9dc1df48c76941a115e139e8f92f0ff1da203","observation_id":"7f1b486c-7a91-482f-ba08-0c321f9ab6e1","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Counting motifs in the human interactome.Nature communications, 4(1):1–8, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:527afd0d0ddbe01e25c49e6c6846f213e39bdd38397d1e5ba9d609d193b992ad","observation_id":"5a481d91-ccb9-446a-afa8-81a48e725b20","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Tsourakakis, Jakub Pachocki, and Michael Mitzenmacher","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:eb1b1229bc24d6dc29121fecb30024a07f8ffe36c047a5614241e126857fb66f","observation_id":"b9295909-9145-4eda-b6eb-035689f8b054","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Kleinberg","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:b357cf71a35d7b288286f4efaa74ecef425654a584ebadb2b8171bfeb52eda00","observation_id":"f1facfb7-3099-4a64-ada1-181ee3de9e8d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Algorithms for acyclic database schemes","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:dc5cee8133bfddf76a84b9077529836f645f62be23a67270aad496a39985d82e","observation_id":"d0a06128-75a4-4cea-935b-74dd2b21a10d","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:72d239f2eefd592f4da2a781fd32e3214a1b4d4598bb9758bf7ae5b7cd2f0f69","observation_id":"18933f87-3c3c-4241-aaa7-95fd8bc8f569","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","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-07-11T09:42:28.508680Z","title":"Learning with hypergraphs: Clustering, classification, and embedding","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-11T09:42:28.508680Z"},"links":{"citing_paper":"/paper/2607.05040"},"observation_digest":"sha256:24036d93a7199d14d85a1ca635ed38962a4f1acc3ef1b04077a4126806cb2147","observation_id":"62677022-f766-4653-8417-b407e51be19a","resolution":{"observed_at":"2026-07-11T09:42:28.508680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.05040","last_updated":"2026-07-06T13:17:37Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-05T19:42:56.678153Z","submitted_at":"2026-07-06T13:17:37Z","title":"The Fine-Grained Complexity of Counting Hypergraph Motifs"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":56,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":56},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.05040."}