{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NB2Z3GDD3WWHWOJBBNSTYONWAX","short_pith_number":"pith:NB2Z3GDD","schema_version":"1.0","canonical_sha256":"68759d9863ddac7b39210b653c39b605ef525a1fe4662842778f94bd49d8e1ba","source":{"kind":"arxiv","id":"1611.05537","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05537","created_at":"2026-05-18T00:58:03.294829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05537v1","created_at":"2026-05-18T00:58:03.294829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05537","created_at":"2026-05-18T00:58:03.294829+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB2Z3GDD3WWH","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB2Z3GDD3WWHWOJB","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB2Z3GDD","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX","json":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX.json","graph_json":"https://pith.science/api/pith-number/NB2Z3GDD3WWHWOJBBNSTYONWAX/graph.json","events_json":"https://pith.science/api/pith-number/NB2Z3GDD3WWHWOJBBNSTYONWAX/events.json","paper":"https://pith.science/paper/NB2Z3GDD"},"agent_actions":{"view_html":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX","download_json":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX.json","view_paper":"https://pith.science/paper/NB2Z3GDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/NB2Z3GDD3WWHWOJBBNSTYONWAX/graph.json","fetch_events":"https://pith.science/api/pith-number/NB2Z3GDD3WWHWOJBBNSTYONWAX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/action/storage_attestation","attest_author":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/action/author_attestation","sign_citation":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/action/citation_signature","submit_replication":"https://pith.science/pith/NB2Z3GDD3WWHWOJBBNSTYONWAX/action/replication_record"}},"created_at":"2026-05-18T00:58:03.294829+00:00","updated_at":"2026-05-18T00:58:03.294829+00:00"}