{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EWVNPVUCLAKOTGPW74UJV44GEM","short_pith_number":"pith:EWVNPVUC","schema_version":"1.0","canonical_sha256":"25aad7d6825814e999f6ff289af38623074dc0a85b3e3ee0af7e46c16db60dd2","source":{"kind":"arxiv","id":"1801.01556","version":2},"attestation_state":"computed","paper":{"title":"A bound on the inducibility of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jan Volec, Sergey Norin","submitted_at":"2018-01-04T21:59:36Z","abstract_excerpt":"In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most $n^k/(k^k - k)$ induced cycles of length k for k at least 5. We prove that every n-vertex graph has at most $2 n^k/k^k$ induced cycles of length k."},"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":"1801.01556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-04T21:59:36Z","cross_cats_sorted":[],"title_canon_sha256":"2cb171fa363dccba236f5dc863e9eb6b69955d3266adc9e40980d5f9fee00187","abstract_canon_sha256":"4436c04a01e8d7ff85debdf026791ba9fa87abcc77df51385eb738a5cd010e30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.037918Z","signature_b64":"s996dO39PTrmiwm15dK+SxpO2HPoIy9vk6RCYjpBU11dgXHtnfjSCM6uBkrt+pSfNiuACFY58nRlXz3pIeFuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25aad7d6825814e999f6ff289af38623074dc0a85b3e3ee0af7e46c16db60dd2","last_reissued_at":"2026-05-18T00:02:13.037255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.037255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A bound on the inducibility of cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Kral, Jan Volec, Sergey Norin","submitted_at":"2018-01-04T21:59:36Z","abstract_excerpt":"In 1975, Pippenger and Golumbic conjectured that every n-vertex graph has at most $n^k/(k^k - k)$ induced cycles of length k for k at least 5. We prove that every n-vertex graph has at most $2 n^k/k^k$ induced cycles of length k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01556","kind":"arxiv","version":2},"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":"1801.01556","created_at":"2026-05-18T00:02:13.037370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01556v2","created_at":"2026-05-18T00:02:13.037370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01556","created_at":"2026-05-18T00:02:13.037370+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWVNPVUCLAKO","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWVNPVUCLAKOTGPW","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWVNPVUC","created_at":"2026-05-18T12:32:22.470017+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/EWVNPVUCLAKOTGPW74UJV44GEM","json":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM.json","graph_json":"https://pith.science/api/pith-number/EWVNPVUCLAKOTGPW74UJV44GEM/graph.json","events_json":"https://pith.science/api/pith-number/EWVNPVUCLAKOTGPW74UJV44GEM/events.json","paper":"https://pith.science/paper/EWVNPVUC"},"agent_actions":{"view_html":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM","download_json":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM.json","view_paper":"https://pith.science/paper/EWVNPVUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01556&json=true","fetch_graph":"https://pith.science/api/pith-number/EWVNPVUCLAKOTGPW74UJV44GEM/graph.json","fetch_events":"https://pith.science/api/pith-number/EWVNPVUCLAKOTGPW74UJV44GEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM/action/storage_attestation","attest_author":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM/action/author_attestation","sign_citation":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM/action/citation_signature","submit_replication":"https://pith.science/pith/EWVNPVUCLAKOTGPW74UJV44GEM/action/replication_record"}},"created_at":"2026-05-18T00:02:13.037370+00:00","updated_at":"2026-05-18T00:02:13.037370+00:00"}