{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NB2Z3GDD3WWHWOJBBNSTYONWAX","short_pith_number":"pith:NB2Z3GDD","canonical_record":{"source":{"id":"1611.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T02:39:54Z","cross_cats_sorted":["cs.DM","math.IT","q-bio.GN"],"title_canon_sha256":"b7fcfcd43c99a874db4432c7d6ff41af395c4fe30f7d9aebf8d839e34795ba17","abstract_canon_sha256":"34e47cf0b59f61f8d010de96b9a0f4c25a3ecc7c2235f24f7a6fd877cca2b8d7"},"schema_version":"1.0"},"canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","source":{"kind":"arxiv","id":"1611.05537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05537","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05537v1","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05537","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"NB2Z3GDD3WWH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB2Z3GDD3WWHWOJB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB2Z3GDD","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NB2Z3GDD3WWHWOJBBNSTYONWAX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T02:39:54Z","cross_cats_sorted":["cs.DM","math.IT","q-bio.GN"],"title_canon_sha256":"b7fcfcd43c99a874db4432c7d6ff41af395c4fe30f7d9aebf8d839e34795ba17","abstract_canon_sha256":"34e47cf0b59f61f8d010de96b9a0f4c25a3ecc7c2235f24f7a6fd877cca2b8d7"},"schema_version":"1.0"},"canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:03.295284Z","signature_b64":"AxSo1S7+MyMr80Om2MMWrTectEUg0Bt7LfixsRT+feHdCrCXipsWlC53j1o+iV2B5WNjF7HVjyM1XwnS4FmxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","last_reissued_at":"2026-05-18T00:58:03.294746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:03.294746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05537","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-18T00:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idOfszZ1H7mF+y5tmQ4lColcW9zDBTQkjCgu2e5zQDwWBJqcpb/y9v1KzgjGyAhivHjNhLnf12czsGw0mxUqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:44:27.252115Z"},"content_sha256":"f7e1f6f11e410947c4f68dfa857a87a9ec92fbc018f4187af1ae22c8d8513d5a","schema_version":"1.0","event_id":"sha256:f7e1f6f11e410947c4f68dfa857a87a9ec92fbc018f4187af1ae22c8d8513d5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NB2Z3GDD3WWHWOJBBNSTYONWAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Duplication Distance to the Root for Binary Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT","q-bio.GN"],"primary_cat":"cs.IT","authors_text":"Farzad Farnoud, Jehoshua Bruck, Noga Alon, Siddharth Jain","submitted_at":"2016-11-17T02:39:54Z","abstract_excerpt":"We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication operations of the form $\\seq x = \\seq a \\seq b \\seq c \\to \\seq y = \\seq a \\seq b \\seq b \\seq c$, where $\\seq x$ and $\\seq y$ are sequences and $\\seq a$, $\\seq b$, and $\\seq c$ are their substrings, needed to generate a binary sequence of length $n$ starting from a square-free sequence from the set $\\{0,1,01,10,010,101\\}$. This problem is a restricted case of finding the duplication/deduplication distance between two sequences, defined a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05537","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-18T00:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVe3u9rbfWmEqUuLCuZHwHAJB0Vfh/7aT9ABRcKTyBr7SKFdE0CUq6BCMYt9KfY+myW/pVe4ujSILpB0uNE5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:44:27.252555Z"},"content_sha256":"5a6effb91ae29ce6e64e30cc89df962e35481d2ae2067f1af200b48312a9482b","schema_version":"1.0","event_id":"sha256:5a6effb91ae29ce6e64e30cc89df962e35481d2ae2067f1af200b48312a9482b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/bundle.json","state_url":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/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-11T03:44:27Z","links":{"resolver":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX","bundle":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/bundle.json","state":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NB2Z3GDD3WWHWOJBBNSTYONWAX","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":"34e47cf0b59f61f8d010de96b9a0f4c25a3ecc7c2235f24f7a6fd877cca2b8d7","cross_cats_sorted":["cs.DM","math.IT","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T02:39:54Z","title_canon_sha256":"b7fcfcd43c99a874db4432c7d6ff41af395c4fe30f7d9aebf8d839e34795ba17"},"schema_version":"1.0","source":{"id":"1611.05537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05537","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05537v1","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05537","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"NB2Z3GDD3WWH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NB2Z3GDD3WWHWOJB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NB2Z3GDD","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:5a6effb91ae29ce6e64e30cc89df962e35481d2ae2067f1af200b48312a9482b","target":"graph","created_at":"2026-05-18T00:58: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":"We study the tandem duplication distance between binary sequences and their roots. In other words, the quantity of interest is the number of tandem duplication operations of the form $\\seq x = \\seq a \\seq b \\seq c \\to \\seq y = \\seq a \\seq b \\seq b \\seq c$, where $\\seq x$ and $\\seq y$ are sequences and $\\seq a$, $\\seq b$, and $\\seq c$ are their substrings, needed to generate a binary sequence of length $n$ starting from a square-free sequence from the set $\\{0,1,01,10,010,101\\}$. This problem is a restricted case of finding the duplication/deduplication distance between two sequences, defined a","authors_text":"Farzad Farnoud, Jehoshua Bruck, Noga Alon, Siddharth Jain","cross_cats":["cs.DM","math.IT","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T02:39:54Z","title":"Duplication Distance to the Root for Binary Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05537","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:f7e1f6f11e410947c4f68dfa857a87a9ec92fbc018f4187af1ae22c8d8513d5a","target":"record","created_at":"2026-05-18T00:58: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":"34e47cf0b59f61f8d010de96b9a0f4c25a3ecc7c2235f24f7a6fd877cca2b8d7","cross_cats_sorted":["cs.DM","math.IT","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-17T02:39:54Z","title_canon_sha256":"b7fcfcd43c99a874db4432c7d6ff41af395c4fe30f7d9aebf8d839e34795ba17"},"schema_version":"1.0","source":{"id":"1611.05537","kind":"arxiv","version":1}},"canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","first_computed_at":"2026-05-18T00:58:03.294746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:03.294746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AxSo1S7+MyMr80Om2MMWrTectEUg0Bt7LfixsRT+feHdCrCXipsWlC53j1o+iV2B5WNjF7HVjyM1XwnS4FmxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:03.295284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7e1f6f11e410947c4f68dfa857a87a9ec92fbc018f4187af1ae22c8d8513d5a","sha256:5a6effb91ae29ce6e64e30cc89df962e35481d2ae2067f1af200b48312a9482b"],"state_sha256":"ef2847e9ef542dc7d8692d69a3e366dcf38b1d8508440f87db29f309c0312ded"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6yRHKrOM9XnmfbomHTLDtBEHrl+58GqEAB0Fs9NF6LfxI+PpP3zOXTYGrC2fVAZSZ1XhRAxmiokY6i/kOnVuAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:44:27.255247Z","bundle_sha256":"600a697dbb86325ad4873062c1a8d58dee7a97cd256d1ebdeb3f1e8faa19634a"}}