{"as_of":"2026-08-15T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e7a59c18c798744c409f721aa80f13722d6dbbf336028c29e133dff09852ab3d","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T00:14:38.643887Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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.27870/citation-record","integrity":"/paper/2607.27870/integrity","json":"/paper/2607.27870/citation-record.json","paper":"/paper/2607.27870"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.111868Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.111868Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:b59286aa6bbfa02fe302221e9eb42f86588419925b6a08c527167be14ea4785b","observation_id":"24bef170-cbff-4e48-8f98-35bcd1934190","resolution":{"observed_at":"2026-08-01T00:14:36.111868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.154119Z","title":"Alon and R","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.154119Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:5ba8cce53e96a225ad40ab8cd3db1c5de0d898ad89e9084e180d8fb861361e9c","observation_id":"c9e75ff8-ac45-4581-b090-859d3ae21431","resolution":{"observed_at":"2026-08-01T00:14:36.154119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.240638Z","title":"Chang, H","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.240638Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:90d0881e9a785a7baa5804cb42088ec8138d08da2fb50da71b6a448c602a716f","observation_id":"429294b8-5469-46a1-a2e8-57284d97be49","resolution":{"observed_at":"2026-08-01T00:14:36.240638Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.333642Z","title":"Draganić, P","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.333642Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:adf876d90cd6b56a1809b962b8a497a892a5bc75ea41ae71594f7581a4e99a32","observation_id":"ac71b12f-612c-46be-a909-356fa0c3041a","resolution":{"observed_at":"2026-08-01T00:14:36.333642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.411886Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.411886Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:a99b37071679aaff0266172c2999991bd4bbcd62e5602f494508bf9395cb8800","observation_id":"50b32250-157f-4899-a127-59693bb66ca0","resolution":{"observed_at":"2026-08-01T00:14:36.411886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.12207","last_updated":"2019-04-08T15:06:27Z","snapshot_observed_at":"2026-08-15T11:57:35.146243Z","submitted_at":"2019-03-28T18:17:03Z","title":"Uniformity-independent minimum degree conditions for perfect matchings in hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.12207","snapshot_observed_at":"2026-08-01T00:14:36.523439Z","title":"Ferber and V","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.523439Z"},"links":{"cited_paper":"/paper/1903.12207","citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:2ca274a59371e59015b0e2a3482a9cac9dd4dbbbeb8079686ab0de940433f1a8","observation_id":"6013c002-3552-4c19-8f9b-2f39177a3262","resolution":{"observed_at":"2026-08-01T00:14:36.523439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.647225Z","title":"Frankl and A","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.647225Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:2af86eaa4e4e0b00b35116a5695277c4c7aac334c2d569a605202865149700e8","observation_id":"1f2bb08e-5cc0-4a70-9c44-5c341d0a0d1e","resolution":{"observed_at":"2026-08-01T00:14:36.647225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.23980","last_updated":"2026-07-27T04:06:33Z","snapshot_observed_at":"2026-08-12T01:14:31.155254Z","submitted_at":"2026-07-27T04:06:33Z","title":"Sharp small-deviation inequalities for sums of independent nonnegative random variables","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.23980","snapshot_observed_at":"2026-08-01T00:14:36.718288Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.718288Z"},"links":{"cited_paper":"/paper/2607.23980","citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:c5e31898a0329a5eb2b1e22adc7db71dca27bb20174791ac44ec9e276b6ed9f8","observation_id":"c8bc790e-6552-4f10-9166-5902d7b4b5ae","resolution":{"observed_at":"2026-08-01T00:14:36.718288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.787637Z","title":"Gan and J","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.787637Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:bbd0bc4d036b24471c924f4d5cf38d62bc4d1709a8bcec1e20eece739316ac78","observation_id":"80318409-4c64-4968-8309-342965f3ec60","resolution":{"observed_at":"2026-08-01T00:14:36.787637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.855142Z","title":"Hajnal and E","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.855142Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:7752d774ff8c0f6f7fd6c30875f7c2e4936f5026a3248c4ace13a864b4cb5951","observation_id":"8f5ec536-9dd4-488a-9aba-14868b1a4ea2","resolution":{"observed_at":"2026-08-01T00:14:36.855142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:36.926892Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:36.926892Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:2e54b128fb99b6c8af36c770abcfcd89fc2ab4e372369c644689205a7289aaea","observation_id":"231fb97b-0065-4d6c-a51b-fca4e6f0911d","resolution":{"observed_at":"2026-08-01T00:14:36.926892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.029773Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.029773Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:ea0d6be06dc1fcf08bc7723b0df366c61cee2d1c89a828156ef9ba8be5d5a9fa","observation_id":"75e2a16f-fe8b-4ac2-8573-754073bfc5f8","resolution":{"observed_at":"2026-08-01T00:14:37.029773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.140932Z","title":"Han and A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.140932Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:e12fa9ad06762277b6d68da56decc159dfaaba5b8d5bc18ffbc07a1654296e26","observation_id":"eac7b828-724e-40bc-b2d9-5bfda9839fc6","resolution":{"observed_at":"2026-08-01T00:14:37.140932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.237723Z","title":"Han and J","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.237723Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:1682d0f4e36dbeb2fb775eb8522dc5195ac16b158145ce4579bc5c96a4693c3d","observation_id":"aee445c3-874a-4baa-9088-329ddb6bad5d","resolution":{"observed_at":"2026-08-01T00:14:37.237723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.318946Z","title":"Hoeffding","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.318946Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:6175ad772c4d11bc33e14ca2718374116f5eb31cc81b9797d3250ed60af5dc83","observation_id":"0944f592-63ea-4ebb-be03-86769edd6393","resolution":{"observed_at":"2026-08-01T00:14:37.318946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.432181Z","title":"Hunter, T","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.432181Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:0a06f506bf0bf69468abe903bbb57f62098baaf33a38d39b20239e8a0ce82475","observation_id":"9ceb9ddb-9522-4cec-9d6a-864bf04b7fe6","resolution":{"observed_at":"2026-08-01T00:14:37.432181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.522094Z","title":"Karpiński, A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.522094Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:9ffe697c552bffec80a6ec99b79c884be963644a7036bf18ce4e503bd6601957","observation_id":"2089744f-b58b-4a4c-b590-95839ffeedd1","resolution":{"observed_at":"2026-08-01T00:14:37.522094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.603913Z","title":"Keevash, F","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.603913Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:9780d492925fbb2542d895586ade95c73dc48e62ceaa155c5f93dd02ce93acdf","observation_id":"4bcd0b77-5a4b-4d52-8f2c-17b1cad66d81","resolution":{"observed_at":"2026-08-01T00:14:37.603913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.689962Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.689962Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:ea61d992391c801bd9d783a5cbc516b4e9b8fb2e9dd1ce4cd44fbde91c7d0dc1","observation_id":"1f33752d-a051-4002-9354-dbb8f50a91d2","resolution":{"observed_at":"2026-08-01T00:14:37.689962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.775324Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.775324Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:f5dd8db366a605346a5f15f2de312f800f437f163266b27b5b5ca26464257dfb","observation_id":"32bf7e31-e234-4e58-8b26-ff8772a09c72","resolution":{"observed_at":"2026-08-01T00:14:37.775324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.866179Z","title":"Komlós, G","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.866179Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:c31f1729b302eaebfc8a441e617ad801df342ae55d588a2cb4a48c37e69b8c3f","observation_id":"f5d4ad56-43e2-4cf4-8714-7ca23ee20ca2","resolution":{"observed_at":"2026-08-01T00:14:37.866179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:37.958226Z","title":"Kühn and D","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:37.958226Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:bf56cca15bd8ef648425518447c75c47d7592dfba27347f6770bb5926a841b57","observation_id":"f1cd956d-bc02-41a0-952f-b97e96d8bbb6","resolution":{"observed_at":"2026-08-01T00:14:37.958226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.047424Z","title":"Liebenau and N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.047424Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:ffb482224abb60a6ad385f59196347c97f02c3076cde661cf6fca8e788ed5e51","observation_id":"3c39043a-6cd8-4933-beb2-b5fffd598e1d","resolution":{"observed_at":"2026-08-01T00:14:38.047424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.06551","last_updated":"2026-07-07T17:53:58Z","snapshot_observed_at":"2026-07-10T23:18:28.499141Z","submitted_at":"2026-07-07T17:53:58Z","title":"Tight Staircase Bounds for Cyclic Subsets below Dirac's Threshold","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.06551","snapshot_observed_at":"2026-08-01T00:14:38.112530Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.112530Z"},"links":{"cited_paper":"/paper/2607.06551","citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:83d442bbc2225488f88536c6ed2af91c3251854567148566dd941aee75bb26c3","observation_id":"af94ae88-2500-4edc-93a1-3ad833a00b13","resolution":{"observed_at":"2026-08-01T00:14:38.112530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.197443Z","title":"McDiarmid","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.197443Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:8272816edffced1c0efbd21d578cb89bc60bc617b54a8d58f6832802daf7df95","observation_id":"7d080b31-f9f1-453f-8e54-f75e30f610eb","resolution":{"observed_at":"2026-08-01T00:14:38.197443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.261321Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.261321Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:2c8e9638f30f4ccf4727bb491bcd50458b9ee5057754d2ec4784046da438925b","observation_id":"bb5b7268-1746-4125-8201-35cbdce13a4d","resolution":{"observed_at":"2026-08-01T00:14:38.261321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.351697Z","title":"Shokoufandeh and Y","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.351697Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:b9ccfc0a893b0443350c8d8bb9224612f6ae776b8def9c6351e99f219bbf48a3","observation_id":"00369fa0-f9a8-4b88-a9e3-e101caff55b2","resolution":{"observed_at":"2026-08-01T00:14:38.351697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.439746Z","title":"Sudakov and V","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.439746Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:faac45379c5181c2900d10a42f769523dfb7c2df0b83574adbb3dd774b8b060d","observation_id":"d3220687-2b35-4cba-8adb-f4fb826202d8","resolution":{"observed_at":"2026-08-01T00:14:38.439746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.530558Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.530558Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:ad9027b80f9d1c9b192834917af4eb716d517a38b3296e848a7f1bc8d8862e8c","observation_id":"bcdcac7a-6c7a-4031-8382-ba08280c74ad","resolution":{"observed_at":"2026-08-01T00:14:38.530558Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:14:38.643887Z","title":"Tao and V","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T00:14:38.643887Z"},"links":{"citing_paper":"/paper/2607.27870"},"observation_digest":"sha256:9c2da63adfcd468df3956c95ac44b69132d9c773fd48dfa9539eb22ee2c14c1c","observation_id":"54b0112a-02c9-41fd-915c-e264c0e9fce9","resolution":{"observed_at":"2026-08-01T00:14:38.643887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27870","last_updated":"2026-07-30T08:44:50Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-12T08:41:49.705940Z","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":30,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":30},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2607.27870."}