{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NJ7TR76F2O4ASILPROK6NKCQ6I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"308b63838c6df6730c3b631b8faf3a02e1af1a87085ab1ec67179097b05c31e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T15:56:19Z","title_canon_sha256":"e0f0cbfc750a5743a5d08c33beacb1558aaed93387b471b8336371658f6e3180"},"schema_version":"1.0","source":{"id":"1703.10963","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10963","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10963v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10963","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"NJ7TR76F2O4A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NJ7TR76F2O4ASILP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NJ7TR76F","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:5f1f6555c1826b271814b08b7fc57fdfe54396532ec058ed9eeded512b664a39","target":"graph","created_at":"2026-05-18T00:47:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Recently, Mubayi and Wang showed that for $r\\ge 4$ and $\\ell \\ge 3$, the number of $n$-vertex $r$-graphs that do not contain any loose cycle of length $\\ell$ is at most $2^{O( n^{r-1} (\\log n)^{(r-3)/(r-2)})}$. We improve this bound to $2^{O( n^{r-1} \\log \\log n) }$.","authors_text":"Jie Han, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T15:56:19Z","title":"On hypergraphs without loose cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10963","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73c4e71489961cdcefdb107881dfd63e90035382e9b0101c25fd2f7131f559e7","target":"record","created_at":"2026-05-18T00:47:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"308b63838c6df6730c3b631b8faf3a02e1af1a87085ab1ec67179097b05c31e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T15:56:19Z","title_canon_sha256":"e0f0cbfc750a5743a5d08c33beacb1558aaed93387b471b8336371658f6e3180"},"schema_version":"1.0","source":{"id":"1703.10963","kind":"arxiv","version":1}},"canonical_sha256":"6a7f38ffc5d3b809216f8b95e6a850f224a6329f07a904acd5ca27463b2f4990","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a7f38ffc5d3b809216f8b95e6a850f224a6329f07a904acd5ca27463b2f4990","first_computed_at":"2026-05-18T00:47:32.185907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:32.185907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ehyitj8L/OVh3+2jrXKHtWPFSX0WmdPZGxAvKGirF6rO8sqfgSU4ja1wkpsGWor5oz5zvAssFT4DzNiShADTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:32.186753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10963","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73c4e71489961cdcefdb107881dfd63e90035382e9b0101c25fd2f7131f559e7","sha256:5f1f6555c1826b271814b08b7fc57fdfe54396532ec058ed9eeded512b664a39"],"state_sha256":"7d43a9d5e5784af84a7d218b7d26e5e6d2a11a27d50b96386bde836eee8ef0e6"}