{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:I6US5HG2MWPIWDI737HD4WFCQ3","short_pith_number":"pith:I6US5HG2","canonical_record":{"source":{"id":"1604.06833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"a956ecb3fee2d14bdccf67a43ed09d8b0bfb52089315150f4330365170de5bbf","abstract_canon_sha256":"8646695c1e29d144d48e79a96f473401c6cf4a9c3256cba380a919fd237894c4"},"schema_version":"1.0"},"canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","source":{"kind":"arxiv","id":"1604.06833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06833","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06833v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06833","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"I6US5HG2MWPI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I6US5HG2MWPIWDI7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I6US5HG2","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:I6US5HG2MWPIWDI737HD4WFCQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1604.06833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"a956ecb3fee2d14bdccf67a43ed09d8b0bfb52089315150f4330365170de5bbf","abstract_canon_sha256":"8646695c1e29d144d48e79a96f473401c6cf4a9c3256cba380a919fd237894c4"},"schema_version":"1.0"},"canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:23.841361Z","signature_b64":"1N0eWQqP2KWwrvoH8oGAfxUN8VI8L5sodDHgcGr5QOpw3TpbLhszq2yj8gIOUBwB/FBA5PURizMVvoVH0k12AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","last_reissued_at":"2026-05-18T01:16:23.840777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:23.840777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.06833","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkwXBguQ7WQRXBF9Mtx5B7LDWV/Ab5qf9UZY2EEfEQ0tmKuKKawm7mqqD4iJGuJUXC46a7tZH78y+WocAVVqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:01:13.466949Z"},"content_sha256":"a8d665ed898daf32bec8c41f1ae6573e8c0cfc45b698fc6984c87fa5f771a3db","schema_version":"1.0","event_id":"sha256:a8d665ed898daf32bec8c41f1ae6573e8c0cfc45b698fc6984c87fa5f771a3db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:I6US5HG2MWPIWDI737HD4WFCQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting odd cycles in locally dense graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher","submitted_at":"2016-04-22T22:48:14Z","abstract_excerpt":"We prove that for any given $\\varepsilon>0$ and $d\\in [0,1]$, every sufficiently large $(\\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being $(\\varepsilon, d)$-dense means that every set $X$ containing at least~$\\varepsilon\\,|V(G)|$ vertices spans at least $\\tfrac d2\\, |X|^2$ edges, and what we really count is the number of homomorphisms from an $r$-cycle into $G$.\n  The result adresses a question of Y. Kohayakawa, B. Nagle, V. R\\\"odl, and M. Schacht."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06833","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:16:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19Ub4ISPB4O2aSoHoq6LHPY8WLyv9nvxwoOBjVwzjbYjBpJHeCLeZzG5R+NNgUqEqpye9bVYN1zcmtOA293YBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:01:13.467804Z"},"content_sha256":"57d5f8b2d9295631305fd026da5db560fe6c0d5db6c192b39198e7bcb62fde3c","schema_version":"1.0","event_id":"sha256:57d5f8b2d9295631305fd026da5db560fe6c0d5db6c192b39198e7bcb62fde3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/bundle.json","state_url":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6US5HG2MWPIWDI737HD4WFCQ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T08:01:13Z","links":{"resolver":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3","bundle":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/bundle.json","state":"https://pith.science/pith/I6US5HG2MWPIWDI737HD4WFCQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6US5HG2MWPIWDI737HD4WFCQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:I6US5HG2MWPIWDI737HD4WFCQ3","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":"8646695c1e29d144d48e79a96f473401c6cf4a9c3256cba380a919fd237894c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","title_canon_sha256":"a956ecb3fee2d14bdccf67a43ed09d8b0bfb52089315150f4330365170de5bbf"},"schema_version":"1.0","source":{"id":"1604.06833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.06833","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.06833v1","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06833","created_at":"2026-05-18T01:16:23Z"},{"alias_kind":"pith_short_12","alias_value":"I6US5HG2MWPI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"I6US5HG2MWPIWDI7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"I6US5HG2","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:57d5f8b2d9295631305fd026da5db560fe6c0d5db6c192b39198e7bcb62fde3c","target":"graph","created_at":"2026-05-18T01:16:23Z","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":"We prove that for any given $\\varepsilon>0$ and $d\\in [0,1]$, every sufficiently large $(\\varepsilon, d)$-dense graph $G$ contains for each odd integer $r$ at least $(d^r-\\varepsilon)|V(G)|^r$ cycles of length $r$. Here, $G$ being $(\\varepsilon, d)$-dense means that every set $X$ containing at least~$\\varepsilon\\,|V(G)|$ vertices spans at least $\\tfrac d2\\, |X|^2$ edges, and what we really count is the number of homomorphisms from an $r$-cycle into $G$.\n  The result adresses a question of Y. Kohayakawa, B. Nagle, V. R\\\"odl, and M. Schacht.","authors_text":"Christian Reiher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","title":"Counting odd cycles in locally dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06833","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:a8d665ed898daf32bec8c41f1ae6573e8c0cfc45b698fc6984c87fa5f771a3db","target":"record","created_at":"2026-05-18T01:16:23Z","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":"8646695c1e29d144d48e79a96f473401c6cf4a9c3256cba380a919fd237894c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-22T22:48:14Z","title_canon_sha256":"a956ecb3fee2d14bdccf67a43ed09d8b0bfb52089315150f4330365170de5bbf"},"schema_version":"1.0","source":{"id":"1604.06833","kind":"arxiv","version":1}},"canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47a92e9cda659e8b0d1fdfce3e58a286d742462a0bbb178f63da01097eac1fda","first_computed_at":"2026-05-18T01:16:23.840777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:23.840777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1N0eWQqP2KWwrvoH8oGAfxUN8VI8L5sodDHgcGr5QOpw3TpbLhszq2yj8gIOUBwB/FBA5PURizMVvoVH0k12AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:23.841361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.06833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8d665ed898daf32bec8c41f1ae6573e8c0cfc45b698fc6984c87fa5f771a3db","sha256:57d5f8b2d9295631305fd026da5db560fe6c0d5db6c192b39198e7bcb62fde3c"],"state_sha256":"b3763f5230870e85b04c15457da8ca8bcdc41de24329ad7abcd09deebdbc300e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LE6kvlKIgzMsSGUx0f5CVgJtxDaJsF+r3hVh85MLQtkabiP7f8tTEzKxH3Kp/rzDgbcq08r7gxF/vRNEHctAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:01:13.472199Z","bundle_sha256":"1310024f03aa82efea8960490570c9c80923935dcf140759115acd0c84dea61b"}}