{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SBO4E527RTXMACSGHKFDZJUWQV","short_pith_number":"pith:SBO4E527","schema_version":"1.0","canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","source":{"kind":"arxiv","id":"1804.01207","version":1},"attestation_state":"computed","paper":{"title":"A Euclidean Algorithm for Binary Cycles with Minimal Variance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luca Ghezzi, Roberto Baldacci","submitted_at":"2018-04-04T01:41:59Z","abstract_excerpt":"The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the well-known praxis in statistics and including mean and variance. Mean is seen to be invariant under permutations of the cycle. In the case of a binary alphabet of symbols, a fast, constructive, sequencing algorithm is introduced, strongly resembling the celebrated Euclidean method for greatest common divisor computation, and the cycle returned is characteriz"},"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":"1804.01207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T01:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"66bfd3fe3bb2c1d427da8ab4d5857250980ed6d12efda11bfc980f470845122f","abstract_canon_sha256":"05d9529be85ff08ff94bac6abd589c2392b7d457d81fa76b76f694042debea25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:15.742560Z","signature_b64":"t4ZeggSFh8K/woli0Tax6/CrnZ2UvxApvhCHicLQiYfiw0mevKoKFB3EKdq+rjEQhXFP7A8QfreKZF6NP3dUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","last_reissued_at":"2026-05-18T00:19:15.742095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:15.742095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Euclidean Algorithm for Binary Cycles with Minimal Variance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luca Ghezzi, Roberto Baldacci","submitted_at":"2018-04-04T01:41:59Z","abstract_excerpt":"The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the well-known praxis in statistics and including mean and variance. Mean is seen to be invariant under permutations of the cycle. In the case of a binary alphabet of symbols, a fast, constructive, sequencing algorithm is introduced, strongly resembling the celebrated Euclidean method for greatest common divisor computation, and the cycle returned is characteriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01207","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":"1804.01207","created_at":"2026-05-18T00:19:15.742169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01207v1","created_at":"2026-05-18T00:19:15.742169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01207","created_at":"2026-05-18T00:19:15.742169+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBO4E527RTXM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBO4E527RTXMACSG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBO4E527","created_at":"2026-05-18T12:32:50.500415+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/SBO4E527RTXMACSGHKFDZJUWQV","json":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV.json","graph_json":"https://pith.science/api/pith-number/SBO4E527RTXMACSGHKFDZJUWQV/graph.json","events_json":"https://pith.science/api/pith-number/SBO4E527RTXMACSGHKFDZJUWQV/events.json","paper":"https://pith.science/paper/SBO4E527"},"agent_actions":{"view_html":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV","download_json":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV.json","view_paper":"https://pith.science/paper/SBO4E527","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01207&json=true","fetch_graph":"https://pith.science/api/pith-number/SBO4E527RTXMACSGHKFDZJUWQV/graph.json","fetch_events":"https://pith.science/api/pith-number/SBO4E527RTXMACSGHKFDZJUWQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/action/storage_attestation","attest_author":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/action/author_attestation","sign_citation":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/action/citation_signature","submit_replication":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/action/replication_record"}},"created_at":"2026-05-18T00:19:15.742169+00:00","updated_at":"2026-05-18T00:19:15.742169+00:00"}