{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ADOS4MWUQS6K6CCOGFKU6USNHU","short_pith_number":"pith:ADOS4MWU","canonical_record":{"source":{"id":"2604.14671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-16T06:28:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7bf300320d4201f32ecce59977c4c06d09785493e6c5e8a4d09000a98de52d26","abstract_canon_sha256":"0386ae242a656c2168dd42cf7499b1b56d4cb4ae3c3213777720c59253ced8a7"},"schema_version":"1.0"},"canonical_sha256":"00dd2e32d484bcaf084e31554f524d3d135c964c6611190fa56688fc5205b931","source":{"kind":"arxiv","id":"2604.14671","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.14671","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"2604.14671v2","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.14671","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"ADOS4MWUQS6K","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_16","alias_value":"ADOS4MWUQS6K6CCO","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_8","alias_value":"ADOS4MWU","created_at":"2026-06-11T01:09:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ADOS4MWUQS6K6CCOGFKU6USNHU","target":"record","payload":{"canonical_record":{"source":{"id":"2604.14671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-16T06:28:49Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7bf300320d4201f32ecce59977c4c06d09785493e6c5e8a4d09000a98de52d26","abstract_canon_sha256":"0386ae242a656c2168dd42cf7499b1b56d4cb4ae3c3213777720c59253ced8a7"},"schema_version":"1.0"},"canonical_sha256":"00dd2e32d484bcaf084e31554f524d3d135c964c6611190fa56688fc5205b931","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:09:35.655704Z","signature_b64":"9AZWyqQUHf3vwodH+BEGILUgfSv3ZZHF0WxwnlX9Ji+cq/3wN4+ANDNmNJ5PvIjRNh+DQrHklh7UaXooc0agDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00dd2e32d484bcaf084e31554f524d3d135c964c6611190fa56688fc5205b931","last_reissued_at":"2026-06-11T01:09:35.654748Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:09:35.654748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.14671","source_version":2,"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-06-11T01:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sp7arZ8zIw8twQdk6TT1DE+vzYWcq6vij3k6Nsos5bUcGyPSzfAjGt8wszosuetS8S4aCXoYxQc4H7UeuFBoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:38:12.569738Z"},"content_sha256":"b73c1a7fa9848729bf1b895c42b9c2d9e5632f1ee827c62c009da4970317d732","schema_version":"1.0","event_id":"sha256:b73c1a7fa9848729bf1b895c42b9c2d9e5632f1ee827c62c009da4970317d732"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ADOS4MWUQS6K6CCOGFKU6USNHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the independence number of de Bruijn graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube.","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Matteo Novaga, Pietro Majer","submitted_at":"2026-04-16T06:28:49Z","abstract_excerpt":"We derive the asymptotic formula $\\alpha(k,q)=\\lambda_{k-1}q^k+o(q^k)$, where $\\alpha(k,q)$ is the independence number of the de Bruijn graph $B(k,q)$, and $\\lambda_{k-1}$ is a constant arising from a variational problem on the unit $(k-1)$-dimensional cube. When $k=4$, we show the bounds $91/240\\le \\lambda_3\\le 11/28$. For odd prime $k$, we analyse the binary case $q=2$ via a phase reduction on rotation orbits. For $k=11,13,17$ this yields compact orbit-marker certificates for optimal constructions. Combined with a lifting theorem by Lichiardopol, these certificates give exact formulas for $\\"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We derive the asymptotic formula α(k,q)=λ_{k-1}q^k+o(q^k), where λ_{k-1} is a constant arising from a variational problem on the unit (k-1)-dimensional cube. ... For k=11 and k=13 this yields certified optimal constructions, which combined with a lifting theorem by Lichiardopol give exact formulas for α(11,q) and α(13,q) for all q≥2.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The variational problem on the (k-1)-cube correctly captures the asymptotic density of maximum independent sets, and the phase-reduction constructions for odd-prime k are optimal in the binary case so that the cited lifting theorem extends them exactly to all q.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"92c13cf0069f61e3c4215f223f17f5cd7733f28efe2f4203f82860a42046b3e0"},"source":{"id":"2604.14671","kind":"arxiv","version":2},"verdict":{"id":"5774d9a3-b8e5-4081-afce-5f747c6a8621","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T11:22:28.857098Z","strongest_claim":"We derive the asymptotic formula α(k,q)=λ_{k-1}q^k+o(q^k), where λ_{k-1} is a constant arising from a variational problem on the unit (k-1)-dimensional cube. ... For k=11 and k=13 this yields certified optimal constructions, which combined with a lifting theorem by Lichiardopol give exact formulas for α(11,q) and α(13,q) for all q≥2.","one_line_summary":"α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The variational problem on the (k-1)-cube correctly captures the asymptotic density of maximum independent sets, and the phase-reduction constructions for odd-prime k are optimal in the binary case so that the cited lifting theorem extends them exactly to all q.","pith_extraction_headline":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.14671/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"5774d9a3-b8e5-4081-afce-5f747c6a8621"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T01:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCAykgWYQ3gCX3EYH8JikBr3omB+6vbwFq54xKSGtG2D8AHhIoJhkjhKI8i0W4fF/UWRomtz7mjrfkp203D+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:38:12.570305Z"},"content_sha256":"5d2e13c6340dcb3b58c144d119ff9596d6579df02f119c40f4e34d9470b1aa2f","schema_version":"1.0","event_id":"sha256:5d2e13c6340dcb3b58c144d119ff9596d6579df02f119c40f4e34d9470b1aa2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/bundle.json","state_url":"https://pith.science/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/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-26T03:38:12Z","links":{"resolver":"https://pith.science/pith/ADOS4MWUQS6K6CCOGFKU6USNHU","bundle":"https://pith.science/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/bundle.json","state":"https://pith.science/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADOS4MWUQS6K6CCOGFKU6USNHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ADOS4MWUQS6K6CCOGFKU6USNHU","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":"0386ae242a656c2168dd42cf7499b1b56d4cb4ae3c3213777720c59253ced8a7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-16T06:28:49Z","title_canon_sha256":"7bf300320d4201f32ecce59977c4c06d09785493e6c5e8a4d09000a98de52d26"},"schema_version":"1.0","source":{"id":"2604.14671","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.14671","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"2604.14671v2","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.14671","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"ADOS4MWUQS6K","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_16","alias_value":"ADOS4MWUQS6K6CCO","created_at":"2026-06-11T01:09:35Z"},{"alias_kind":"pith_short_8","alias_value":"ADOS4MWU","created_at":"2026-06-11T01:09:35Z"}],"graph_snapshots":[{"event_id":"sha256:5d2e13c6340dcb3b58c144d119ff9596d6579df02f119c40f4e34d9470b1aa2f","target":"graph","created_at":"2026-06-11T01:09:35Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We derive the asymptotic formula α(k,q)=λ_{k-1}q^k+o(q^k), where λ_{k-1} is a constant arising from a variational problem on the unit (k-1)-dimensional cube. ... For k=11 and k=13 this yields certified optimal constructions, which combined with a lifting theorem by Lichiardopol give exact formulas for α(11,q) and α(13,q) for all q≥2."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The variational problem on the (k-1)-cube correctly captures the asymptotic density of maximum independent sets, and the phase-reduction constructions for odd-prime k are optimal in the binary case so that the cited lifting theorem extends them exactly to all q."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube."}],"snapshot_sha256":"92c13cf0069f61e3c4215f223f17f5cd7733f28efe2f4203f82860a42046b3e0"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.14671/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We derive the asymptotic formula $\\alpha(k,q)=\\lambda_{k-1}q^k+o(q^k)$, where $\\alpha(k,q)$ is the independence number of the de Bruijn graph $B(k,q)$, and $\\lambda_{k-1}$ is a constant arising from a variational problem on the unit $(k-1)$-dimensional cube. When $k=4$, we show the bounds $91/240\\le \\lambda_3\\le 11/28$. For odd prime $k$, we analyse the binary case $q=2$ via a phase reduction on rotation orbits. For $k=11,13,17$ this yields compact orbit-marker certificates for optimal constructions. Combined with a lifting theorem by Lichiardopol, these certificates give exact formulas for $\\","authors_text":"Matteo Novaga, Pietro Majer","cross_cats":["cs.IT","math.IT"],"headline":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-16T06:28:49Z","title":"On the independence number of de Bruijn graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.14671","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T11:22:28.857098Z","id":"5774d9a3-b8e5-4081-afce-5f747c6a8621","model_set":{"reader":"grok-4.3"},"one_line_summary":"α(k,q) = λ_{k-1} q^k + o(q^k) where λ_{k-1} arises from a variational problem on the (k-1)-cube; exact formulas hold for k=11,13 via phase reduction and lifting, with bounds 91/240 ≤ λ_3 ≤ 11/28 for k=4.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The independence number of the de Bruijn graph B(k,q) equals λ_{k-1} q^k plus a smaller term, where λ_{k-1} is the value of a variational problem on the unit (k-1)-cube.","strongest_claim":"We derive the asymptotic formula α(k,q)=λ_{k-1}q^k+o(q^k), where λ_{k-1} is a constant arising from a variational problem on the unit (k-1)-dimensional cube. ... For k=11 and k=13 this yields certified optimal constructions, which combined with a lifting theorem by Lichiardopol give exact formulas for α(11,q) and α(13,q) for all q≥2.","weakest_assumption":"The variational problem on the (k-1)-cube correctly captures the asymptotic density of maximum independent sets, and the phase-reduction constructions for odd-prime k are optimal in the binary case so that the cited lifting theorem extends them exactly to all q."}},"verdict_id":"5774d9a3-b8e5-4081-afce-5f747c6a8621"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b73c1a7fa9848729bf1b895c42b9c2d9e5632f1ee827c62c009da4970317d732","target":"record","created_at":"2026-06-11T01:09:35Z","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":"0386ae242a656c2168dd42cf7499b1b56d4cb4ae3c3213777720c59253ced8a7","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-16T06:28:49Z","title_canon_sha256":"7bf300320d4201f32ecce59977c4c06d09785493e6c5e8a4d09000a98de52d26"},"schema_version":"1.0","source":{"id":"2604.14671","kind":"arxiv","version":2}},"canonical_sha256":"00dd2e32d484bcaf084e31554f524d3d135c964c6611190fa56688fc5205b931","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00dd2e32d484bcaf084e31554f524d3d135c964c6611190fa56688fc5205b931","first_computed_at":"2026-06-11T01:09:35.654748Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:35.654748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9AZWyqQUHf3vwodH+BEGILUgfSv3ZZHF0WxwnlX9Ji+cq/3wN4+ANDNmNJ5PvIjRNh+DQrHklh7UaXooc0agDA==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:35.655704Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.14671","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b73c1a7fa9848729bf1b895c42b9c2d9e5632f1ee827c62c009da4970317d732","sha256:5d2e13c6340dcb3b58c144d119ff9596d6579df02f119c40f4e34d9470b1aa2f"],"state_sha256":"c792ed8ab8decdd12697492291baf190ec051dec3c484c8947712d31473aab67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZ+tKIpwd8PJithFgWQyo/vVqrHaM3lMpShZQF0wkGs3/qZmi6vUUEvMcjKEInBWFd80Luirn/47k4gA+rJpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:38:12.573131Z","bundle_sha256":"17a41e609864e54fd07ee6c4001244947d83b1a39c9680213dd146607c61c929"}}