{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:MGBDXBYEHQQ7C3D5KDQMJCF3BW","short_pith_number":"pith:MGBDXBYE","canonical_record":{"source":{"id":"0911.1370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-11-06T23:05:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"464caca55bfba325037ab19a467b08f2f35ed0835d685557db33ecdfb050c247","abstract_canon_sha256":"4c448ce289c44440985e7bb73e846f7dfb7930273f6afa8fd677d34718aae16c"},"schema_version":"1.0"},"canonical_sha256":"61823b87043c21f16c7d50e0c488bb0d83a2b1fd649ee8a9b417fa2d99ded20b","source":{"kind":"arxiv","id":"0911.1370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1370","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1370v1","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1370","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGBDXBYEHQQ7","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MGBDXBYEHQQ7C3D5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MGBDXBYE","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:MGBDXBYEHQQ7C3D5KDQMJCF3BW","target":"record","payload":{"canonical_record":{"source":{"id":"0911.1370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-11-06T23:05:30Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"464caca55bfba325037ab19a467b08f2f35ed0835d685557db33ecdfb050c247","abstract_canon_sha256":"4c448ce289c44440985e7bb73e846f7dfb7930273f6afa8fd677d34718aae16c"},"schema_version":"1.0"},"canonical_sha256":"61823b87043c21f16c7d50e0c488bb0d83a2b1fd649ee8a9b417fa2d99ded20b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:10:58.492128Z","signature_b64":"apu7RBGV1Uy/lR02Iv7Cr/sBRYlCs3EfanhDhMmxDDxAAn0tEnP+M3ZZ0EClHZ/Sn1G6tHAZSZOWgxEFC/fHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61823b87043c21f16c7d50e0c488bb0d83a2b1fd649ee8a9b417fa2d99ded20b","last_reissued_at":"2026-05-18T02:10:58.491189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:10:58.491189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.1370","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+WdopirXzdLclJhyl7xLJ2STuBG56P4xuHNfYwLEk+fh7a5YrT9OwHQJaP315T59e1cAF+dIvkuDlHtN/J4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:23:31.875570Z"},"content_sha256":"0de799c88d71a88c4881d00b6970a80b299192360a6efc8682959ef07c7b4f57","schema_version":"1.0","event_id":"sha256:0de799c88d71a88c4881d00b6970a80b299192360a6efc8682959ef07c7b4f57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:MGBDXBYEHQQ7C3D5KDQMJCF3BW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the maximal number of cubic subwords in a string","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.FL","authors_text":"Jakub Radoszewski, Marcin Kubica, Tomasz Walen, Wojciech Rytter","submitted_at":"2009-11-06T23:05:30Z","abstract_excerpt":"We investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are produced in the paper. We consider two simple problems related to the maximum number of subwords which are squares or which are highly repetitive; then we provide a nontrivial estimation for the number of cubes. We show that the maximum number of squares $xx$ such that $x$ is not a primitive word (nonprimitive squa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1370","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXqGaJs0y0jo8nj8fXALz9WyuXMulMMND1HGw9nmi+M/ma2qc4zgOrGRSq5BnKP5YWjX9PcW5YCdmiJ/2X+UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:23:31.876187Z"},"content_sha256":"74ba4168dcd07c59879f4c3a4e3c93cbd7e4498519ab98ff81f4bcc9eb87fab6","schema_version":"1.0","event_id":"sha256:74ba4168dcd07c59879f4c3a4e3c93cbd7e4498519ab98ff81f4bcc9eb87fab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/bundle.json","state_url":"https://pith.science/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/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-01T02:23:31Z","links":{"resolver":"https://pith.science/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW","bundle":"https://pith.science/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/bundle.json","state":"https://pith.science/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGBDXBYEHQQ7C3D5KDQMJCF3BW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:MGBDXBYEHQQ7C3D5KDQMJCF3BW","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":"4c448ce289c44440985e7bb73e846f7dfb7930273f6afa8fd677d34718aae16c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-11-06T23:05:30Z","title_canon_sha256":"464caca55bfba325037ab19a467b08f2f35ed0835d685557db33ecdfb050c247"},"schema_version":"1.0","source":{"id":"0911.1370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.1370","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"0911.1370v1","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.1370","created_at":"2026-05-18T02:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGBDXBYEHQQ7","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"MGBDXBYEHQQ7C3D5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"MGBDXBYE","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:74ba4168dcd07c59879f4c3a4e3c93cbd7e4498519ab98ff81f4bcc9eb87fab6","target":"graph","created_at":"2026-05-18T02:10:58Z","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 investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are produced in the paper. We consider two simple problems related to the maximum number of subwords which are squares or which are highly repetitive; then we provide a nontrivial estimation for the number of cubes. We show that the maximum number of squares $xx$ such that $x$ is not a primitive word (nonprimitive squa","authors_text":"Jakub Radoszewski, Marcin Kubica, Tomasz Walen, Wojciech Rytter","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-11-06T23:05:30Z","title":"On the maximal number of cubic subwords in a string"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.1370","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:0de799c88d71a88c4881d00b6970a80b299192360a6efc8682959ef07c7b4f57","target":"record","created_at":"2026-05-18T02:10:58Z","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":"4c448ce289c44440985e7bb73e846f7dfb7930273f6afa8fd677d34718aae16c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-11-06T23:05:30Z","title_canon_sha256":"464caca55bfba325037ab19a467b08f2f35ed0835d685557db33ecdfb050c247"},"schema_version":"1.0","source":{"id":"0911.1370","kind":"arxiv","version":1}},"canonical_sha256":"61823b87043c21f16c7d50e0c488bb0d83a2b1fd649ee8a9b417fa2d99ded20b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61823b87043c21f16c7d50e0c488bb0d83a2b1fd649ee8a9b417fa2d99ded20b","first_computed_at":"2026-05-18T02:10:58.491189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:10:58.491189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"apu7RBGV1Uy/lR02Iv7Cr/sBRYlCs3EfanhDhMmxDDxAAn0tEnP+M3ZZ0EClHZ/Sn1G6tHAZSZOWgxEFC/fHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:10:58.492128Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.1370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0de799c88d71a88c4881d00b6970a80b299192360a6efc8682959ef07c7b4f57","sha256:74ba4168dcd07c59879f4c3a4e3c93cbd7e4498519ab98ff81f4bcc9eb87fab6"],"state_sha256":"b79bc063de1a2d47f79d70551887ca8326cd2d62595358aa1be7f3821b555abe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asM3IH8zarGWKYhB22q0rLcuOZ9v6UaHJoNCCp83iXvvA4rYQSEOQi5jBaf5qsppI/lKSFLmrH3Y1ZMszD89AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:23:31.880253Z","bundle_sha256":"f61e882f37e0202a0a6db99ec6eca960c239154a0854d1ce2379b07174140fcc"}}