{"as_of":"2026-08-22T11:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e0b996e88fe9289d07aff167d303b53107c924ace2a526c59c879a0e90be30fb","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T22:58:34.807656Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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.15658/citation-record","integrity":"/paper/2607.15658/integrity","json":"/paper/2607.15658/citation-record.json","paper":"/paper/2607.15658"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T22:58:32.296971Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:32.296971Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:c074963c5ad384e773eccbfc7c33e0467e2a8ee1234bfda84798f6707e656ee7","observation_id":"2c0370bd-4416-42db-8d7a-c1ec23de22bb","resolution":{"observed_at":"2026-08-01T22:58:32.296971Z","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-01T22:58:32.426450Z","title":"Babai and P","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:32.426450Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:3b0485879655d3483073ede257c070f2aea379e957329506cbf3b74e19f1c0a2","observation_id":"5e170cd9-a671-4a07-ace5-1eb4b6687148","resolution":{"observed_at":"2026-08-01T22:58:32.426450Z","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-01T22:58:32.583466Z","title":"BoundsfortheGraham-Pollaktheoremfor hypergraphs.Discrete Mathematics, 342(11):3177–3181, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:32.583466Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:44ffbc634bcb8555818212c7869bd06357294111cd64993a72ea33036b7070bc","observation_id":"590f6d29-ade3-413c-8d5a-b18485ab6497","resolution":{"observed_at":"2026-08-01T22:58:32.583466Z","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-01T22:58:32.741770Z","title":"Multicoveringhypergraphs.DiscreteMath- ematics, 344(6):112386, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:32.741770Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:f4e52c2cc4b243487d60df8ff23c095253707cd85222b7728afad25bc5fbc2db","observation_id":"7cb0cc6f-7062-4cac-ac65-ef9282ccb722","resolution":{"observed_at":"2026-08-01T22:58:32.741770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.12589","last_updated":"2026-05-22T16:53:43Z","snapshot_observed_at":"2026-08-19T07:09:55.391884Z","submitted_at":"2022-08-26T11:30:26Z","title":"Improved Bounds for Multicovering Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.12589","snapshot_observed_at":"2026-08-01T22:58:32.901762Z","title":"Babu and S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:32.901762Z"},"links":{"cited_paper":"/paper/2208.12589","citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:1d013ea5ad9673b9b49ee2e8af84b33616e4fb3529e4fc76e8ae3fa299332a5c","observation_id":"f16e8424-7b35-4877-ac8a-9aca1e0f8da0","resolution":{"observed_at":"2026-08-01T22:58:32.901762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.08598","last_updated":"2024-08-16T08:20:11Z","snapshot_observed_at":"2026-08-21T04:36:50.019302Z","submitted_at":"2024-08-16T08:20:11Z","title":"On odd covers of cliques and disjoint unions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.08598","snapshot_observed_at":"2026-08-01T22:58:33.083087Z","title":"Buchanan, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.083087Z"},"links":{"cited_paper":"/paper/2408.08598","citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:71676f37456129298b91f03079cb34ad2ede70ab4dfdd53c516c34888e089580","observation_id":"bf588a91-e56c-47b0-98bd-e4fb326f88a0","resolution":{"observed_at":"2026-08-01T22:58:33.083087Z","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-01T22:58:33.245167Z","title":"Buchanan, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.245167Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:06445550b4323143a9ca2ee094fbaf4e11800cff6171c753b72f27341b676c99","observation_id":"28f15f31-ae04-4277-a035-3c20cf34704b","resolution":{"observed_at":"2026-08-01T22:58:33.245167Z","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-01T22:58:33.334539Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.334539Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:992f565a3aaa7ef1fe185ecfb3eb5ea994a4ed744a4bc7d1f2a615d2695ad6c0","observation_id":"b1d11114-809d-4b2c-8854-691800c2b2c6","resolution":{"observed_at":"2026-08-01T22:58:33.334539Z","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-01T22:58:33.456310Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.456310Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:497b880149ca09613278525f4d668448d0179260b01b9c94367e15bb2a93e18c","observation_id":"2125fdd5-de98-46cd-93c5-9da1831cd30d","resolution":{"observed_at":"2026-08-01T22:58:33.456310Z","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-01T22:58:33.584795Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.584795Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:ea4b9b0eb574fbaf07c942de514d5a79ca4b1789551218d4c44cf40885770ce1","observation_id":"eca083ab-2cbd-4a49-835a-55b358d3e8e6","resolution":{"observed_at":"2026-08-01T22:58:33.584795Z","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-01T22:58:33.636682Z","title":"Onembeddinggraphsinsquashedcubes","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.636682Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:e560e1c8635def57663b8592dda8805d7f0b50913d68bebc2f573857bfe2bbaa","observation_id":"a9726147-7dc3-43f8-bc41-0f57a946cad3","resolution":{"observed_at":"2026-08-01T22:58:33.636682Z","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-01T22:58:33.818534Z","title":"Leader, L","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.818534Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:61e33c787e41058be92e2830c1dc7fd598dee1e759ddada62571ef911a54df76","observation_id":"65f80628-9ce9-4332-97e3-d8dafdfe7a3f","resolution":{"observed_at":"2026-08-01T22:58:33.818534Z","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-01T22:58:33.928410Z","title":"Leader and T","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:33.928410Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:372d7deb148844ed19efed09104230884a74bf5668df1f6fe266542b2b8a4e42","observation_id":"56f307c7-bc29-43ee-aa22-b3cbb376d664","resolution":{"observed_at":"2026-08-01T22:58:33.928410Z","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-01T22:58:34.060285Z","title":"Odd covers of complete graphs and hypergraphs.European Journal of Combinatorics, 132:104299, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.060285Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:6d6afee6d8f29fd8f7fea265ad4a1c4ebda6f7d28b5122310b7d4a42e892c1ea","observation_id":"762b8fce-f504-4eb0-868a-2764931d5bfa","resolution":{"observed_at":"2026-08-01T22:58:34.060285Z","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-01T22:58:34.164338Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.164338Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:1a186d4399219e3594c33137986659ad6090d4929bff7d1a5f7bd6dc16aeef8d","observation_id":"a28247cc-3452-4071-a617-c6aa25b5521c","resolution":{"observed_at":"2026-08-01T22:58:34.164338Z","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-01T22:58:34.246088Z","title":"Radhakrishnan, P","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.246088Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:d2f0ad0b30a052a93c97207cfac37cacf86940e1a9324ba300afc67c458e60f6","observation_id":"e256128f-7b75-4a19-b2c1-a4b5d956646e","resolution":{"observed_at":"2026-08-01T22:58:34.246088Z","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-01T22:58:34.435455Z","title":"Orderedbicliquepartitionsandcommunication complexity problems.Discrete Applied Mathematics, 184:248–252, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.435455Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:2bcfdefd1002a14fa9263ecafa0df09fa0af0804f8f8fff85fd6d0b5dfd6b2d5","observation_id":"08952559-ba06-468d-ba3d-0808743fcfcc","resolution":{"observed_at":"2026-08-01T22:58:34.435455Z","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-01T22:58:34.570556Z","title":"Tverberg","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.570556Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:84211b6a7756f8dbd9e0dc89de6c02ecb44f41ca6dcbfa02cd8183c4742cd9ba","observation_id":"741b9fe4-e32b-424c-b42d-29dc6647e0d8","resolution":{"observed_at":"2026-08-01T22:58:34.570556Z","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-01T22:58:34.685629Z","title":"Vishwanathan","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.685629Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:b12aa3d8c152ad40832e49da36b8a176fb097bb8b4d6d28bf5b2e59def0e0b28","observation_id":"e7c4d67c-5be2-4fc6-bcd6-240769900a5b","resolution":{"observed_at":"2026-08-01T22:58:34.685629Z","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-01T22:58:34.807656Z","title":"Vishwanathan","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T22:58:34.807656Z"},"links":{"citing_paper":"/paper/2607.15658"},"observation_digest":"sha256:8053875f84f0b134fb4f1a6ec2dea0c4ba18b296962c53dd9b27b99818cb2bc1","observation_id":"4482daa2-64ad-43ee-af15-3c2676899882","resolution":{"observed_at":"2026-08-01T22:58:34.807656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.15658","last_updated":"2026-07-17T06:07:37Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T19:53:52.278168Z","submitted_at":"2026-07-17T06:07:37Z","title":"New bounds on the Graham-Pollak theorem for hypergraphs"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.15658."}