{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7JQQVKVBMQZQGKETB2MZDWADVC","short_pith_number":"pith:7JQQVKVB","canonical_record":{"source":{"id":"1701.00948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-04T10:16:30Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"71ef1e79fde2999366375fde5d376ac91b39b3220bc4fda38ccd7f7b9d1e3a8c","abstract_canon_sha256":"3f02d1e665af1d59c310e75b268dc384701eb999d0d20b4c29bf256e36e7e629"},"schema_version":"1.0"},"canonical_sha256":"fa610aaaa164330328930e9991d803a8ac3b5313d4494cb5794d76affb0d92c1","source":{"kind":"arxiv","id":"1701.00948","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00948","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00948v3","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00948","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"7JQQVKVBMQZQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7JQQVKVBMQZQGKET","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7JQQVKVB","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7JQQVKVBMQZQGKETB2MZDWADVC","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00948","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-04T10:16:30Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"71ef1e79fde2999366375fde5d376ac91b39b3220bc4fda38ccd7f7b9d1e3a8c","abstract_canon_sha256":"3f02d1e665af1d59c310e75b268dc384701eb999d0d20b4c29bf256e36e7e629"},"schema_version":"1.0"},"canonical_sha256":"fa610aaaa164330328930e9991d803a8ac3b5313d4494cb5794d76affb0d92c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:03.875412Z","signature_b64":"UQ9Dq5p+ZW1CR+ZzwVbPA31RpSocMAQ/zQICrWwceqBZxwdSfxBtOqzNGwlfVuk/sg6AhkMNZ+GZLXq6TaghAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa610aaaa164330328930e9991d803a8ac3b5313d4494cb5794d76affb0d92c1","last_reissued_at":"2026-05-18T00:50:03.874922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:03.874922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00948","source_version":3,"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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nXWPB+64xu8L0P3Z7bXsUoOa9cSwfNlpApc+5hTu15MC6EhsghV3Dm6CpgAzB+LAc4oqk85sjkm9oIWCEi5gBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:39.107219Z"},"content_sha256":"1737fca4d5d86a7b3cd98c55db01cb04d9b2f5b964b26b44548d02fae8debd39","schema_version":"1.0","event_id":"sha256:1737fca4d5d86a7b3cd98c55db01cb04d9b2f5b964b26b44548d02fae8debd39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7JQQVKVBMQZQGKETB2MZDWADVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abelian-Square-Rich Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Filippo Mignosi, Gabriele Fici, Jeffrey Shallit","submitted_at":"2017-01-04T10:16:30Z","abstract_excerpt":"An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\\Theta(n^2)$ distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length $n$ grows quadratically with $n$. More precisely, we say that an infinite word $w$ is {\\it abelian-square-rich} if, for every $n$, every factor of $w$ of length $n$ contains, on average, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00948","kind":"arxiv","version":3},"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-18T00:50:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzNlnV8LxEFAuEpErdfvOwBB9LmmMLvVO2I1inx0SnQQbVffQfErk0mndqiP4RueRfWwldwtpvCQKlaugTChAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:39.107697Z"},"content_sha256":"2336196ab4675f0883c6d053bf7ec1d31d66cc994a3cd6c35abb5d09070618ae","schema_version":"1.0","event_id":"sha256:2336196ab4675f0883c6d053bf7ec1d31d66cc994a3cd6c35abb5d09070618ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JQQVKVBMQZQGKETB2MZDWADVC/bundle.json","state_url":"https://pith.science/pith/7JQQVKVBMQZQGKETB2MZDWADVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JQQVKVBMQZQGKETB2MZDWADVC/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-05-26T15:27:39Z","links":{"resolver":"https://pith.science/pith/7JQQVKVBMQZQGKETB2MZDWADVC","bundle":"https://pith.science/pith/7JQQVKVBMQZQGKETB2MZDWADVC/bundle.json","state":"https://pith.science/pith/7JQQVKVBMQZQGKETB2MZDWADVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JQQVKVBMQZQGKETB2MZDWADVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7JQQVKVBMQZQGKETB2MZDWADVC","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":"3f02d1e665af1d59c310e75b268dc384701eb999d0d20b4c29bf256e36e7e629","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-04T10:16:30Z","title_canon_sha256":"71ef1e79fde2999366375fde5d376ac91b39b3220bc4fda38ccd7f7b9d1e3a8c"},"schema_version":"1.0","source":{"id":"1701.00948","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00948","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00948v3","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00948","created_at":"2026-05-18T00:50:03Z"},{"alias_kind":"pith_short_12","alias_value":"7JQQVKVBMQZQ","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7JQQVKVBMQZQGKET","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7JQQVKVB","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:2336196ab4675f0883c6d053bf7ec1d31d66cc994a3cd6c35abb5d09070618ae","target":"graph","created_at":"2026-05-18T00:50:03Z","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":"An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\\Theta(n^2)$ distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length $n$ grows quadratically with $n$. More precisely, we say that an infinite word $w$ is {\\it abelian-square-rich} if, for every $n$, every factor of $w$ of length $n$ contains, on average, ","authors_text":"Filippo Mignosi, Gabriele Fici, Jeffrey Shallit","cross_cats":["cs.FL","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-04T10:16:30Z","title":"Abelian-Square-Rich Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00948","kind":"arxiv","version":3},"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:1737fca4d5d86a7b3cd98c55db01cb04d9b2f5b964b26b44548d02fae8debd39","target":"record","created_at":"2026-05-18T00:50:03Z","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":"3f02d1e665af1d59c310e75b268dc384701eb999d0d20b4c29bf256e36e7e629","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-04T10:16:30Z","title_canon_sha256":"71ef1e79fde2999366375fde5d376ac91b39b3220bc4fda38ccd7f7b9d1e3a8c"},"schema_version":"1.0","source":{"id":"1701.00948","kind":"arxiv","version":3}},"canonical_sha256":"fa610aaaa164330328930e9991d803a8ac3b5313d4494cb5794d76affb0d92c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa610aaaa164330328930e9991d803a8ac3b5313d4494cb5794d76affb0d92c1","first_computed_at":"2026-05-18T00:50:03.874922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:03.874922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UQ9Dq5p+ZW1CR+ZzwVbPA31RpSocMAQ/zQICrWwceqBZxwdSfxBtOqzNGwlfVuk/sg6AhkMNZ+GZLXq6TaghAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:03.875412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00948","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1737fca4d5d86a7b3cd98c55db01cb04d9b2f5b964b26b44548d02fae8debd39","sha256:2336196ab4675f0883c6d053bf7ec1d31d66cc994a3cd6c35abb5d09070618ae"],"state_sha256":"83f4d31c9a6d5aa5a4d6dc23a9068328678d626054b6f10cd940391ae72f5d4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRI0ZFiqkbugtZTqVMB2NFCCiSOyvgKcIq9Ac+U2I5geuGqWDbH8k1zVMg+QV6fLulD2/pJhIoATE+sAG1ALCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:27:39.110812Z","bundle_sha256":"3b9aa39ee0f513dcd17a728da7d908ab477f7d4d6c04b5c46fa4696944e80303"}}