{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:57Z7RWXUXE76V6ELMBBI5OV44Z","short_pith_number":"pith:57Z7RWXU","schema_version":"1.0","canonical_sha256":"eff3f8daf4b93feaf88b60428ebabce66566f7f43a3e419f511cdfcc7f232248","source":{"kind":"arxiv","id":"1702.07342","version":1},"attestation_state":"computed","paper":{"title":"On the inducibility of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Mykhaylo Tyomkyn","submitted_at":"2017-02-23T18:58:38Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.07342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-23T18:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"2f94d0e032e142932ae165d17a5dee6c306ad10f797ecc0cc29c7eb1c6fc9728","abstract_canon_sha256":"a68f74cd479a863ec26611556b6ce59dbc1b37570934ff0b5d415dbeee8dbe6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.414295Z","signature_b64":"o6iBsTH4xlKu3/ZqJCDys0PB12YkE0+1hBQFTkSG8t7KvUWYKk84FGjKSDXpxTTnJq26e9zWY6LT0WgqNRPUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eff3f8daf4b93feaf88b60428ebabce66566f7f43a3e419f511cdfcc7f232248","last_reissued_at":"2026-05-18T00:50:07.413592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.413592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the inducibility of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Mykhaylo Tyomkyn","submitted_at":"2017-02-23T18:58:38Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07342","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.07342","created_at":"2026-05-18T00:50:07.413708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07342v1","created_at":"2026-05-18T00:50:07.413708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07342","created_at":"2026-05-18T00:50:07.413708+00:00"},{"alias_kind":"pith_short_12","alias_value":"57Z7RWXUXE76","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"57Z7RWXUXE76V6EL","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"57Z7RWXU","created_at":"2026-05-18T12:31:00.734936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z","json":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z.json","graph_json":"https://pith.science/api/pith-number/57Z7RWXUXE76V6ELMBBI5OV44Z/graph.json","events_json":"https://pith.science/api/pith-number/57Z7RWXUXE76V6ELMBBI5OV44Z/events.json","paper":"https://pith.science/paper/57Z7RWXU"},"agent_actions":{"view_html":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z","download_json":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z.json","view_paper":"https://pith.science/paper/57Z7RWXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07342&json=true","fetch_graph":"https://pith.science/api/pith-number/57Z7RWXUXE76V6ELMBBI5OV44Z/graph.json","fetch_events":"https://pith.science/api/pith-number/57Z7RWXUXE76V6ELMBBI5OV44Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z/action/storage_attestation","attest_author":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z/action/author_attestation","sign_citation":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z/action/citation_signature","submit_replication":"https://pith.science/pith/57Z7RWXUXE76V6ELMBBI5OV44Z/action/replication_record"}},"created_at":"2026-05-18T00:50:07.413708+00:00","updated_at":"2026-05-18T00:50:07.413708+00:00"}