{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YWJNEYPJYOHOMCVYKHNHXPIJG6","short_pith_number":"pith:YWJNEYPJ","canonical_record":{"source":{"id":"1104.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-16T08:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"668366b3e5f4345ca09def1ffaa8671e98b224948facba01f6c8894b032ef353","abstract_canon_sha256":"a1f8294769d73c7031aedcc3dc8d919f422b15c560395d3626a03356841f07e8"},"schema_version":"1.0"},"canonical_sha256":"c592d261e9c38ee60ab851da7bbd09379e24713cb1a7c15adca62c7e4f1ba09b","source":{"kind":"arxiv","id":"1104.3208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3208","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3208v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3208","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"YWJNEYPJYOHO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YWJNEYPJYOHOMCVY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YWJNEYPJ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YWJNEYPJYOHOMCVYKHNHXPIJG6","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-16T08:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"668366b3e5f4345ca09def1ffaa8671e98b224948facba01f6c8894b032ef353","abstract_canon_sha256":"a1f8294769d73c7031aedcc3dc8d919f422b15c560395d3626a03356841f07e8"},"schema_version":"1.0"},"canonical_sha256":"c592d261e9c38ee60ab851da7bbd09379e24713cb1a7c15adca62c7e4f1ba09b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.588506Z","signature_b64":"TV5iGOBez4/c9XFdgvfL0uiM9T//6Oj40vluuf4eRpQkno9EAU7UGmL3hvkuMIQPWMLq0tRXC2IRZ2z9QAsPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c592d261e9c38ee60ab851da7bbd09379e24713cb1a7c15adca62c7e4f1ba09b","last_reissued_at":"2026-05-18T04:24:05.588012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.588012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3208","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKHI57EdNgEN6zfFiODZ2Kydu2uFxpQijdku4MAEPtOVus7AQRfPp/XLVVDEJb9SMoWRgodNvjARLWnQApP4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:33.233292Z"},"content_sha256":"b625632e6f2cc997f56210abcc0f8363944cb0d3218f457a4b37c87173a1abb9","schema_version":"1.0","event_id":"sha256:b625632e6f2cc997f56210abcc0f8363944cb0d3218f457a4b37c87173a1abb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YWJNEYPJYOHOMCVYKHNHXPIJG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of hamiltonian graphs with bounded degree and diameter O (log n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Aleksandar Ili\\' c, Dragan Stevanovi\\' c","submitted_at":"2011-04-16T08:11:25Z","abstract_excerpt":"Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum degree $\\Delta$ and diameter $O (\\log n)$, where $n$ is an arbitrary number. The number of edges is asymptotically bounded by $(2 - \\frac{1}{\\Delta - 1} - \\frac{(\\Delta - 2)^2}{(\\Delta - 1)^3}) n$. In particular, we construct a family of hamiltonian graphs with diameter at most $2 \\lfloor \\log_2 n \\rfloor$, maximum degree 3 and at most $1+11n/8$ edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3208","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-18T04:24:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdLAuADoftwzmSOCBGcZdjOh2+/lQrsj67dIRKNxGngKEQnzQKlDhxoMGrORU7nAgKV24ix77jWs7bmD+RFpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:35:33.234015Z"},"content_sha256":"3d53a5320b4a86259dbd282b49391e2fd7e5ed41ae9f676edaefbf459f367a3b","schema_version":"1.0","event_id":"sha256:3d53a5320b4a86259dbd282b49391e2fd7e5ed41ae9f676edaefbf459f367a3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/bundle.json","state_url":"https://pith.science/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/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-05-31T01:35:33Z","links":{"resolver":"https://pith.science/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6","bundle":"https://pith.science/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/bundle.json","state":"https://pith.science/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWJNEYPJYOHOMCVYKHNHXPIJG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YWJNEYPJYOHOMCVYKHNHXPIJG6","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":"a1f8294769d73c7031aedcc3dc8d919f422b15c560395d3626a03356841f07e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-16T08:11:25Z","title_canon_sha256":"668366b3e5f4345ca09def1ffaa8671e98b224948facba01f6c8894b032ef353"},"schema_version":"1.0","source":{"id":"1104.3208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3208","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3208v1","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3208","created_at":"2026-05-18T04:24:05Z"},{"alias_kind":"pith_short_12","alias_value":"YWJNEYPJYOHO","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YWJNEYPJYOHOMCVY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YWJNEYPJ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:3d53a5320b4a86259dbd282b49391e2fd7e5ed41ae9f676edaefbf459f367a3b","target":"graph","created_at":"2026-05-18T04:24:05Z","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":"Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum degree $\\Delta$ and diameter $O (\\log n)$, where $n$ is an arbitrary number. The number of edges is asymptotically bounded by $(2 - \\frac{1}{\\Delta - 1} - \\frac{(\\Delta - 2)^2}{(\\Delta - 1)^3}) n$. In particular, we construct a family of hamiltonian graphs with diameter at most $2 \\lfloor \\log_2 n \\rfloor$, maximum degree 3 and at most $1+11n/8$ edges.","authors_text":"Aleksandar Ili\\' c, Dragan Stevanovi\\' c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-16T08:11:25Z","title":"Constructions of hamiltonian graphs with bounded degree and diameter O (log n)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3208","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:b625632e6f2cc997f56210abcc0f8363944cb0d3218f457a4b37c87173a1abb9","target":"record","created_at":"2026-05-18T04:24:05Z","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":"a1f8294769d73c7031aedcc3dc8d919f422b15c560395d3626a03356841f07e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-04-16T08:11:25Z","title_canon_sha256":"668366b3e5f4345ca09def1ffaa8671e98b224948facba01f6c8894b032ef353"},"schema_version":"1.0","source":{"id":"1104.3208","kind":"arxiv","version":1}},"canonical_sha256":"c592d261e9c38ee60ab851da7bbd09379e24713cb1a7c15adca62c7e4f1ba09b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c592d261e9c38ee60ab851da7bbd09379e24713cb1a7c15adca62c7e4f1ba09b","first_computed_at":"2026-05-18T04:24:05.588012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:05.588012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TV5iGOBez4/c9XFdgvfL0uiM9T//6Oj40vluuf4eRpQkno9EAU7UGmL3hvkuMIQPWMLq0tRXC2IRZ2z9QAsPCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:05.588506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b625632e6f2cc997f56210abcc0f8363944cb0d3218f457a4b37c87173a1abb9","sha256:3d53a5320b4a86259dbd282b49391e2fd7e5ed41ae9f676edaefbf459f367a3b"],"state_sha256":"13913352fc60a447c3a9b39a396cebacedc321053f57b41030d6dc1754ff9ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0mQ2Nk1Uaclpw+SpN7U9gvZQyHqp8Rzpm5HZdjaDhFuSvJPVmkpjkCKDBUUgoqZGTmYwKWGV6vGXvbpAnZyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:35:33.237740Z","bundle_sha256":"3e4b8f4ab88d4b9229f7b0aea69b48d7624ef5b3ef30b7308e2e1382c41585ff"}}