{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:57Z7RWXUXE76V6ELMBBI5OV44Z","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":"a68f74cd479a863ec26611556b6ce59dbc1b37570934ff0b5d415dbeee8dbe6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-23T18:58:38Z","title_canon_sha256":"2f94d0e032e142932ae165d17a5dee6c306ad10f797ecc0cc29c7eb1c6fc9728"},"schema_version":"1.0","source":{"id":"1702.07342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07342","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07342v1","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07342","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"57Z7RWXUXE76","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"57Z7RWXUXE76V6EL","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"57Z7RWXU","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:3a9590eb63bbf9f89b82d5b0ad1ab873cdc8fd32c073c58fb0efc31fc1a2b955","target":"graph","created_at":"2026-05-18T00:50:07Z","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":"In 1975 Pippenger and Golumbic proved that any graph on $n$ vertices admits at most $2e(n/k)^k$ induced $k$-cycles. This bound is larger by a multiplicative factor of $2e$ than the simple lower bound obtained by a blow-up construction. Pippenger and Golumbic conjectured that the latter lower bound is essentially tight. In the present paper we establish a better upper bound of $(128e/81) \\cdot (n/k)^k$. This constitutes the first progress towards proving the aforementioned conjecture since it was posed.","authors_text":"Dan Hefetz, Mykhaylo Tyomkyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-23T18:58:38Z","title":"On the inducibility of cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07342","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:92d7eed4e58230b5751a018879547c4744afe7f790138fd9a8764b06cc246e2d","target":"record","created_at":"2026-05-18T00:50:07Z","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":"a68f74cd479a863ec26611556b6ce59dbc1b37570934ff0b5d415dbeee8dbe6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-23T18:58:38Z","title_canon_sha256":"2f94d0e032e142932ae165d17a5dee6c306ad10f797ecc0cc29c7eb1c6fc9728"},"schema_version":"1.0","source":{"id":"1702.07342","kind":"arxiv","version":1}},"canonical_sha256":"eff3f8daf4b93feaf88b60428ebabce66566f7f43a3e419f511cdfcc7f232248","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eff3f8daf4b93feaf88b60428ebabce66566f7f43a3e419f511cdfcc7f232248","first_computed_at":"2026-05-18T00:50:07.413592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:07.413592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o6iBsTH4xlKu3/ZqJCDys0PB12YkE0+1hBQFTkSG8t7KvUWYKk84FGjKSDXpxTTnJq26e9zWY6LT0WgqNRPUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:07.414295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92d7eed4e58230b5751a018879547c4744afe7f790138fd9a8764b06cc246e2d","sha256:3a9590eb63bbf9f89b82d5b0ad1ab873cdc8fd32c073c58fb0efc31fc1a2b955"],"state_sha256":"ff41a710d43f3eae61235d4372c7bed234a4a5df33b9cf1e77d60b1b0c3b6970"}