{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NMCXHDCWXE52O2TE2OPVIVJAVV","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":"48be271a7d9352ca25ad76e58f38c84561cb6b16fb7e5a6e9ceec95f3ff9693d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:14:11Z","title_canon_sha256":"7ac7e536338c7a50d51e660d5161d50494a11066b75a923c950d0846c33090cf"},"schema_version":"1.0","source":{"id":"1605.06572","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06572","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06572v2","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06572","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"NMCXHDCWXE52","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NMCXHDCWXE52O2TE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NMCXHDCW","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:9b388d69d7581d915a50e96559b550d11a10525e39c1adca42f701b3efdc468f","target":"graph","created_at":"2026-05-18T01:13:46Z","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":"How many edges can a quadrilateral-free subgraph of a hypercube have? This question was raised by Paul Erd\\H{o}s about $27$ years ago. His conjecture that such a subgraph asymptotically has at most half the edges of a hypercube is still unresolved. Let $f(n,C_l)$ be the largest number of edges in a subgraph of a hypercube $Q_n$ containing no cycle of length $l$. It is known that $f(n, C_l) = o(|E(Q_n)|)$, when $l= 4k$, $k\\geq 2$ and that $f(n, C_6) \\geq \\frac{1}{3} |E(Q_n)|$. It is an open question to determine $f(n, C_l)$ for $l=4k+2$, $k\\geq 2$. Here, we give a general upper bound for $f(n,C","authors_text":"Maria Axenovich, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:14:11Z","title":"A note on short cycles in a hypercube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06572","kind":"arxiv","version":2},"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:c24f732d55de1618e297df29f2b5aa8f9ba015422f9198f622ebf98698c18065","target":"record","created_at":"2026-05-18T01:13:46Z","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":"48be271a7d9352ca25ad76e58f38c84561cb6b16fb7e5a6e9ceec95f3ff9693d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:14:11Z","title_canon_sha256":"7ac7e536338c7a50d51e660d5161d50494a11066b75a923c950d0846c33090cf"},"schema_version":"1.0","source":{"id":"1605.06572","kind":"arxiv","version":2}},"canonical_sha256":"6b05738c56b93ba76a64d39f545520ad47a25f97767d64c8d17cd329fac28634","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b05738c56b93ba76a64d39f545520ad47a25f97767d64c8d17cd329fac28634","first_computed_at":"2026-05-18T01:13:46.761415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:46.761415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gEO6QItWGeIx0Q3yBtOTqaVkbFnv2z3TLAqc5Z9yqi30EGfqyrhM9dZguXJftnQRVxLs+DCiNjzEEj3epcZlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:46.762078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06572","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c24f732d55de1618e297df29f2b5aa8f9ba015422f9198f622ebf98698c18065","sha256:9b388d69d7581d915a50e96559b550d11a10525e39c1adca42f701b3efdc468f"],"state_sha256":"feaee8af44219c017cc91bc0df8ae6e7a90190a6aa3c82693beade2ab242c083"}