{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IEGTWKBQH2IZKYKFXRXIHSBZZY","short_pith_number":"pith:IEGTWKBQ","canonical_record":{"source":{"id":"1110.4225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-19T09:48:56Z","cross_cats_sorted":["math.DS","math.NT"],"title_canon_sha256":"2c55548393539e336a240a9a039ffc98e287038d77dc99d5a6d25e2d73a24908","abstract_canon_sha256":"7b66ec9c0ed808b01898a54eabb97c9f72b51f060e81b33cf707847639e68b8c"},"schema_version":"1.0"},"canonical_sha256":"410d3b28303e91956145bc6e83c839ce0f0f4832a019f748a7884814c5929f9a","source":{"kind":"arxiv","id":"1110.4225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4225","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4225v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4225","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"IEGTWKBQH2IZ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEGTWKBQH2IZKYKF","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEGTWKBQ","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IEGTWKBQH2IZKYKFXRXIHSBZZY","target":"record","payload":{"canonical_record":{"source":{"id":"1110.4225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-19T09:48:56Z","cross_cats_sorted":["math.DS","math.NT"],"title_canon_sha256":"2c55548393539e336a240a9a039ffc98e287038d77dc99d5a6d25e2d73a24908","abstract_canon_sha256":"7b66ec9c0ed808b01898a54eabb97c9f72b51f060e81b33cf707847639e68b8c"},"schema_version":"1.0"},"canonical_sha256":"410d3b28303e91956145bc6e83c839ce0f0f4832a019f748a7884814c5929f9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:38.767642Z","signature_b64":"9qgpnpkELbTL25QLiHZ4HKgkomfhuVYfdAROpeEYdbBbOChnovA214ZtkkQGvHe05nAizwEyNPJpQcL29YiCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"410d3b28303e91956145bc6e83c839ce0f0f4832a019f748a7884814c5929f9a","last_reissued_at":"2026-05-18T03:35:38.766727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:38.766727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.4225","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-05-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB5/si+o/lxHKK8wep74PVXzH3fX8knvOLgNmA6bjp6krtMMY3PJg30By3g53F7KBjxZIssiU88MdqZdeZmpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:22:10.861904Z"},"content_sha256":"fa4edcccee34176400b1779567d169da293c665cd5a41a5b75db10f06a532cfc","schema_version":"1.0","event_id":"sha256:fa4edcccee34176400b1779567d169da293c665cd5a41a5b75db10f06a532cfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IEGTWKBQH2IZKYKFXRXIHSBZZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Central sets defined by words of low factor complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.NT"],"primary_cat":"math.CO","authors_text":"Luca Q. Zamboni, Michelangelo Bucci, Svetlana Puzynina","submitted_at":"2011-10-19T09:48:56Z","abstract_excerpt":"A subset $A$ of $\\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\\in \\mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing additional nice combinatorial properties: Each central set contains arbitrarily long arithmetic progressions, and solutions to all partition regular systems of homogeneous linear equations. In this paper we show how certain families of aperiodic words of low factor complexity may be used to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4225","kind":"arxiv","version":2},"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-18T03:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtjzenRbpUzTw+uonPmgz3TKm0kUYKl75270hSs14mWcfsBnX1fRXS2bz6d5TqFXM2MXFDdQW+eCcgWXSKiWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:22:10.862481Z"},"content_sha256":"b2e5d27da4c2edde47213d8d90c5e589f452bcc9be10d7b289bb32585bc7dd53","schema_version":"1.0","event_id":"sha256:b2e5d27da4c2edde47213d8d90c5e589f452bcc9be10d7b289bb32585bc7dd53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/bundle.json","state_url":"https://pith.science/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/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-04T18:22:10Z","links":{"resolver":"https://pith.science/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY","bundle":"https://pith.science/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/bundle.json","state":"https://pith.science/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEGTWKBQH2IZKYKFXRXIHSBZZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IEGTWKBQH2IZKYKFXRXIHSBZZY","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":"7b66ec9c0ed808b01898a54eabb97c9f72b51f060e81b33cf707847639e68b8c","cross_cats_sorted":["math.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-19T09:48:56Z","title_canon_sha256":"2c55548393539e336a240a9a039ffc98e287038d77dc99d5a6d25e2d73a24908"},"schema_version":"1.0","source":{"id":"1110.4225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.4225","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1110.4225v2","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4225","created_at":"2026-05-18T03:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"IEGTWKBQH2IZ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IEGTWKBQH2IZKYKF","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IEGTWKBQ","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:b2e5d27da4c2edde47213d8d90c5e589f452bcc9be10d7b289bb32585bc7dd53","target":"graph","created_at":"2026-05-18T03:35:38Z","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":"A subset $A$ of $\\mathbb{N}$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n)_{n\\in \\mathbb{N}} $ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing additional nice combinatorial properties: Each central set contains arbitrarily long arithmetic progressions, and solutions to all partition regular systems of homogeneous linear equations. In this paper we show how certain families of aperiodic words of low factor complexity may be used to ","authors_text":"Luca Q. Zamboni, Michelangelo Bucci, Svetlana Puzynina","cross_cats":["math.DS","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-19T09:48:56Z","title":"Central sets defined by words of low factor complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4225","kind":"arxiv","version":2},"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:fa4edcccee34176400b1779567d169da293c665cd5a41a5b75db10f06a532cfc","target":"record","created_at":"2026-05-18T03:35:38Z","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":"7b66ec9c0ed808b01898a54eabb97c9f72b51f060e81b33cf707847639e68b8c","cross_cats_sorted":["math.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-19T09:48:56Z","title_canon_sha256":"2c55548393539e336a240a9a039ffc98e287038d77dc99d5a6d25e2d73a24908"},"schema_version":"1.0","source":{"id":"1110.4225","kind":"arxiv","version":2}},"canonical_sha256":"410d3b28303e91956145bc6e83c839ce0f0f4832a019f748a7884814c5929f9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"410d3b28303e91956145bc6e83c839ce0f0f4832a019f748a7884814c5929f9a","first_computed_at":"2026-05-18T03:35:38.766727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:38.766727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9qgpnpkELbTL25QLiHZ4HKgkomfhuVYfdAROpeEYdbBbOChnovA214ZtkkQGvHe05nAizwEyNPJpQcL29YiCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:38.767642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.4225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa4edcccee34176400b1779567d169da293c665cd5a41a5b75db10f06a532cfc","sha256:b2e5d27da4c2edde47213d8d90c5e589f452bcc9be10d7b289bb32585bc7dd53"],"state_sha256":"9fed4f1976ded8aa803fffc5c7ed6b3561d5e89cf1d761b7db2684db859fb432"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3c0u7/5C+kft4cPhB5hWTCFnCCt9qdVNB4+RWrymF8HWPsOpdSobpOEmZ/clSCSjn84nT8gzuYERF/qGTBEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:22:10.865558Z","bundle_sha256":"038d19742af52b6eb17e56d65bf117918d313ade3615c4c364811f9537737488"}}