{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JYEZFNFSSCK7SVL4EZ7BUJ4JXW","short_pith_number":"pith:JYEZFNFS","canonical_record":{"source":{"id":"1504.01472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-07T05:12:43Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"b9eac404468d68b6b7930870d55108deb61fcfea95dadbf170a6bfba436e050c","abstract_canon_sha256":"ac51d47690a3bd11cf8ca52905039be41a1d46922f504a2603b9a9cb53c9e483"},"schema_version":"1.0"},"canonical_sha256":"4e0992b4b29095f9557c267e1a2789bd9fb0e5b885a232dc450427868a46c381","source":{"kind":"arxiv","id":"1504.01472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01472","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01472v1","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01472","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"JYEZFNFSSCK7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JYEZFNFSSCK7SVL4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JYEZFNFS","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JYEZFNFSSCK7SVL4EZ7BUJ4JXW","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-07T05:12:43Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"b9eac404468d68b6b7930870d55108deb61fcfea95dadbf170a6bfba436e050c","abstract_canon_sha256":"ac51d47690a3bd11cf8ca52905039be41a1d46922f504a2603b9a9cb53c9e483"},"schema_version":"1.0"},"canonical_sha256":"4e0992b4b29095f9557c267e1a2789bd9fb0e5b885a232dc450427868a46c381","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:27.037816Z","signature_b64":"WK10dYpEzb/uDjG8US95DLHTaHebhpNtfILg9Um4tIaH8+cYpzjYlkHvNq68iFv1ZKKcfhW4Yo8taPHy5I0bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0992b4b29095f9557c267e1a2789bd9fb0e5b885a232dc450427868a46c381","last_reissued_at":"2026-05-18T02:19:27.034417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:27.034417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01472","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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIKqgTYiTgPt4/Rf7Whc+7f5E97yNKwEiNA3voPWPoE6AmCgE6v/tueIW1xXRNk1TxUgkuYbH5CULhV+1bNrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:48:30.527693Z"},"content_sha256":"4c91538940ea2babb5da96fe62d3277e0e8f41a5e30034e1f082c33fbf8912d7","schema_version":"1.0","event_id":"sha256:4c91538940ea2babb5da96fe62d3277e0e8f41a5e30034e1f082c33fbf8912d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JYEZFNFSSCK7SVL4EZ7BUJ4JXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Lower Bounds for the Shannon Capacity of Odd Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"K. Ashik Mathew, Patric R. J. \\\"Osterg{\\aa}rd","submitted_at":"2015-04-07T05:12:43Z","abstract_excerpt":"The Shannon capacity of a graph $G$ is defined as $c(G)=\\sup_{d\\geq 1}(\\alpha(G^d))^{\\frac{1}{d}},$ where $\\alpha(G)$ is the independence number of $G$. The Shannon capacity of the cycle $C_5$ on $5$ vertices was determined by Lov\\'{a}sz in 1979, but the Shannon capacity of a cycle $C_p$ for general odd $p$ remains one of the most notorious open problems in information theory. By prescribing stabilizers for the independent sets in $C_p^d$ and using stochastic search methods, we show that $\\alpha(C_7^5)\\geq 350$, $\\alpha(C_{11}^4)\\geq 748$, $\\alpha(C_{13}^4)\\geq 1534$ and $\\alpha(C_{15}^3)\\geq "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01472","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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IxKJ9egLRpUBsRcnQLXBeWvx+fenj+BFyJHi/vWgykRFLt+LXjERr3mws+xoEjiYMor97lGvEUsTuTNkca8tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:48:30.528042Z"},"content_sha256":"b35cda89e7ff5681c560aa15436f28f6ab81b7f540f6e5574d68e0822f9fb808","schema_version":"1.0","event_id":"sha256:b35cda89e7ff5681c560aa15436f28f6ab81b7f540f6e5574d68e0822f9fb808"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/bundle.json","state_url":"https://pith.science/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/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-20T19:48:30Z","links":{"resolver":"https://pith.science/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW","bundle":"https://pith.science/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/bundle.json","state":"https://pith.science/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYEZFNFSSCK7SVL4EZ7BUJ4JXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JYEZFNFSSCK7SVL4EZ7BUJ4JXW","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":"ac51d47690a3bd11cf8ca52905039be41a1d46922f504a2603b9a9cb53c9e483","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-07T05:12:43Z","title_canon_sha256":"b9eac404468d68b6b7930870d55108deb61fcfea95dadbf170a6bfba436e050c"},"schema_version":"1.0","source":{"id":"1504.01472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01472","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01472v1","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01472","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"JYEZFNFSSCK7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JYEZFNFSSCK7SVL4","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JYEZFNFS","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:b35cda89e7ff5681c560aa15436f28f6ab81b7f540f6e5574d68e0822f9fb808","target":"graph","created_at":"2026-05-18T02:19:27Z","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":"The Shannon capacity of a graph $G$ is defined as $c(G)=\\sup_{d\\geq 1}(\\alpha(G^d))^{\\frac{1}{d}},$ where $\\alpha(G)$ is the independence number of $G$. The Shannon capacity of the cycle $C_5$ on $5$ vertices was determined by Lov\\'{a}sz in 1979, but the Shannon capacity of a cycle $C_p$ for general odd $p$ remains one of the most notorious open problems in information theory. By prescribing stabilizers for the independent sets in $C_p^d$ and using stochastic search methods, we show that $\\alpha(C_7^5)\\geq 350$, $\\alpha(C_{11}^4)\\geq 748$, $\\alpha(C_{13}^4)\\geq 1534$ and $\\alpha(C_{15}^3)\\geq ","authors_text":"K. Ashik Mathew, Patric R. J. \\\"Osterg{\\aa}rd","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-07T05:12:43Z","title":"New Lower Bounds for the Shannon Capacity of Odd Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01472","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:4c91538940ea2babb5da96fe62d3277e0e8f41a5e30034e1f082c33fbf8912d7","target":"record","created_at":"2026-05-18T02:19:27Z","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":"ac51d47690a3bd11cf8ca52905039be41a1d46922f504a2603b9a9cb53c9e483","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-07T05:12:43Z","title_canon_sha256":"b9eac404468d68b6b7930870d55108deb61fcfea95dadbf170a6bfba436e050c"},"schema_version":"1.0","source":{"id":"1504.01472","kind":"arxiv","version":1}},"canonical_sha256":"4e0992b4b29095f9557c267e1a2789bd9fb0e5b885a232dc450427868a46c381","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e0992b4b29095f9557c267e1a2789bd9fb0e5b885a232dc450427868a46c381","first_computed_at":"2026-05-18T02:19:27.034417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:27.034417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WK10dYpEzb/uDjG8US95DLHTaHebhpNtfILg9Um4tIaH8+cYpzjYlkHvNq68iFv1ZKKcfhW4Yo8taPHy5I0bBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:27.037816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c91538940ea2babb5da96fe62d3277e0e8f41a5e30034e1f082c33fbf8912d7","sha256:b35cda89e7ff5681c560aa15436f28f6ab81b7f540f6e5574d68e0822f9fb808"],"state_sha256":"917ed584e76c407405919e991bd54df46064c15fbfdd0078ab6c06f1edb9fa74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rsVjmy1edLShbyXHLsjlYzx+JRLGtuvr7A5cI+ufv63wCQKUg81fweZwlG+t2Kn8Dz9qTEJNmjSu/laMrk/2BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:48:30.530092Z","bundle_sha256":"98449cb5aa2b70fca70e5b2710a00bd4da8aeaa2035f5394c3c803e1aa99c311"}}