{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SBO4E527RTXMACSGHKFDZJUWQV","short_pith_number":"pith:SBO4E527","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"},"canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","source":{"kind":"arxiv","id":"1804.01207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01207","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01207v1","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01207","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBO4E527RTXM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBO4E527RTXMACSG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBO4E527","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SBO4E527RTXMACSGHKFDZJUWQV","target":"record","payload":{"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"},"canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","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"},"source_kind":"arxiv","source_id":"1804.01207","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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OL2VeUJs5hVctxfEL2WEv5WO4XjGZJWG7tJR0+GhmX8fhywdt7JfvGRrpiQ6Wdhuge0MgeQ8joNNTyNnblWJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:05:56.231391Z"},"content_sha256":"fb383fbfb672b9ffe4f81c0ba02644c4d8250a1c58beda0f2dd93fd7ff0a4cfc","schema_version":"1.0","event_id":"sha256:fb383fbfb672b9ffe4f81c0ba02644c4d8250a1c58beda0f2dd93fd7ff0a4cfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SBO4E527RTXMACSGHKFDZJUWQV","target":"graph","payload":{"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"},"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:19:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrX/LFbAYg84EOluh8FMNamxtifcunlP7l6vZ6uxmyaV3TKFMWo59jWc82hHOCfOa/1meoE6qb3LOR5psBwLCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T21:05:56.231750Z"},"content_sha256":"b42fe253a38254326dd87449464d5174222e3cb85395c83ca6755024a039f653","schema_version":"1.0","event_id":"sha256:b42fe253a38254326dd87449464d5174222e3cb85395c83ca6755024a039f653"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/bundle.json","state_url":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBO4E527RTXMACSGHKFDZJUWQV/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-07-01T21:05:56Z","links":{"resolver":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV","bundle":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/bundle.json","state":"https://pith.science/pith/SBO4E527RTXMACSGHKFDZJUWQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBO4E527RTXMACSGHKFDZJUWQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SBO4E527RTXMACSGHKFDZJUWQV","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":"05d9529be85ff08ff94bac6abd589c2392b7d457d81fa76b76f694042debea25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T01:41:59Z","title_canon_sha256":"66bfd3fe3bb2c1d427da8ab4d5857250980ed6d12efda11bfc980f470845122f"},"schema_version":"1.0","source":{"id":"1804.01207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01207","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01207v1","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01207","created_at":"2026-05-18T00:19:15Z"},{"alias_kind":"pith_short_12","alias_value":"SBO4E527RTXM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"SBO4E527RTXMACSG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"SBO4E527","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:b42fe253a38254326dd87449464d5174222e3cb85395c83ca6755024a039f653","target":"graph","created_at":"2026-05-18T00:19:15Z","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":"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","authors_text":"Luca Ghezzi, Roberto Baldacci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T01:41:59Z","title":"A Euclidean Algorithm for Binary Cycles with Minimal Variance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01207","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:fb383fbfb672b9ffe4f81c0ba02644c4d8250a1c58beda0f2dd93fd7ff0a4cfc","target":"record","created_at":"2026-05-18T00:19:15Z","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":"05d9529be85ff08ff94bac6abd589c2392b7d457d81fa76b76f694042debea25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-04T01:41:59Z","title_canon_sha256":"66bfd3fe3bb2c1d427da8ab4d5857250980ed6d12efda11bfc980f470845122f"},"schema_version":"1.0","source":{"id":"1804.01207","kind":"arxiv","version":1}},"canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"905dc2775f8ceec00a463a8a3ca696854129b9ccdb5cfb0fa8709892c290a12b","first_computed_at":"2026-05-18T00:19:15.742095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:15.742095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t4ZeggSFh8K/woli0Tax6/CrnZ2UvxApvhCHicLQiYfiw0mevKoKFB3EKdq+rjEQhXFP7A8QfreKZF6NP3dUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:15.742560Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb383fbfb672b9ffe4f81c0ba02644c4d8250a1c58beda0f2dd93fd7ff0a4cfc","sha256:b42fe253a38254326dd87449464d5174222e3cb85395c83ca6755024a039f653"],"state_sha256":"4dd74d6f97660cc5a2933e91e817ef41e3bff8f6b1c494d995042eb2ebf47783"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9596iXwUcC3hNgeg9bgSDi1YpEGZ+MTbPV6iIhe8JWyQnsfnMw8MP6fov4gECRh3g13CVD07uk2AGiKOQzNOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T21:05:56.233794Z","bundle_sha256":"af06016ddb8d2fde9219955ba04aa1b9f0a35e56706b8d08fe3ba89b29ef4734"}}