{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SP5XCRBGEFWIVI4W653RWUWKR3","short_pith_number":"pith:SP5XCRBG","canonical_record":{"source":{"id":"1711.05091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-14T14:09:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e8e6695475748a0ec084df56fb8c86630e066cdcbd7c76bc4ca4ee4cacb2227a","abstract_canon_sha256":"98af1ff748bfeea8d16a294a2ff66c074c042caf254f18658a8130eb609a7309"},"schema_version":"1.0"},"canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","source":{"kind":"arxiv","id":"1711.05091","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05091","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05091v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05091","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"SP5XCRBGEFWI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SP5XCRBGEFWIVI4W","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SP5XCRBG","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SP5XCRBGEFWIVI4W653RWUWKR3","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-14T14:09:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e8e6695475748a0ec084df56fb8c86630e066cdcbd7c76bc4ca4ee4cacb2227a","abstract_canon_sha256":"98af1ff748bfeea8d16a294a2ff66c074c042caf254f18658a8130eb609a7309"},"schema_version":"1.0"},"canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.779100Z","signature_b64":"bMBCTPvIo72iAMNgRJOM57omCs80BBizscbqotlJ/h/oS99NSDU3z1w2TdhTljdQDZg8mEvJccp7BIpKmN67Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","last_reissued_at":"2026-05-18T00:30:34.778453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.778453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05091","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:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFhgPxQaZzO9UuMDopEiGQfaiFjGagMbxKjXT8UnI4vGWJIf/sEFHS3fNNOjF3KO5gPJTUJWnaKxa9FheFT5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:04:29.581875Z"},"content_sha256":"e9da2ee1bea2ab5c865235fb64864aef3a084e51a67698a1d5acc85be5fe87fa","schema_version":"1.0","event_id":"sha256:e9da2ee1bea2ab5c865235fb64864aef3a084e51a67698a1d5acc85be5fe87fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SP5XCRBGEFWIVI4W653RWUWKR3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequences of radius $k$ for complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Micha{\\l} D\\k{e}bski, Pawe{\\l} Rz\\k{a}\\.zewski, Zbigniew Lonc","submitted_at":"2017-11-14T14:09:59Z","abstract_excerpt":"A \\emph{$k$-radius sequence} for a graph $G$ is a sequence of vertices of $G$ (typically with repetitions) such that for every edge $uv$ of $G$ vertices $u$ and $v$ appear at least once within distance $k$ in the sequence. The length of a shortest $k$-radius sequence for $G$ is denoted by $f_k(G)$. We give an asymptotically tight estimation on $f_k(G)$ for complete bipartite graphs {which matches a lower bound, valid for all bipartite graphs}. We also show that determining $f_k(G)$ for an arbitrary graph $G$ is NP-hard for every constant $k>1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05091","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:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4E7S+IZnyvuylCvO7gC18eSgaJO+h+QC4IDzf81v2EcR2jvuO/pGayesSiWvDS7CpMyGndGvb49Ni4o09i6fAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:04:29.582641Z"},"content_sha256":"5e34f88715ea1c0c4ee7b5553241201fcddf39e92987134a2bd7172240178c79","schema_version":"1.0","event_id":"sha256:5e34f88715ea1c0c4ee7b5553241201fcddf39e92987134a2bd7172240178c79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/bundle.json","state_url":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SP5XCRBGEFWIVI4W653RWUWKR3/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-11T23:04:29Z","links":{"resolver":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3","bundle":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/bundle.json","state":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SP5XCRBGEFWIVI4W653RWUWKR3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SP5XCRBGEFWIVI4W653RWUWKR3","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":"98af1ff748bfeea8d16a294a2ff66c074c042caf254f18658a8130eb609a7309","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-14T14:09:59Z","title_canon_sha256":"e8e6695475748a0ec084df56fb8c86630e066cdcbd7c76bc4ca4ee4cacb2227a"},"schema_version":"1.0","source":{"id":"1711.05091","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05091","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05091v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05091","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"SP5XCRBGEFWI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SP5XCRBGEFWIVI4W","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SP5XCRBG","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:5e34f88715ea1c0c4ee7b5553241201fcddf39e92987134a2bd7172240178c79","target":"graph","created_at":"2026-05-18T00:30:34Z","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":"A \\emph{$k$-radius sequence} for a graph $G$ is a sequence of vertices of $G$ (typically with repetitions) such that for every edge $uv$ of $G$ vertices $u$ and $v$ appear at least once within distance $k$ in the sequence. The length of a shortest $k$-radius sequence for $G$ is denoted by $f_k(G)$. We give an asymptotically tight estimation on $f_k(G)$ for complete bipartite graphs {which matches a lower bound, valid for all bipartite graphs}. We also show that determining $f_k(G)$ for an arbitrary graph $G$ is NP-hard for every constant $k>1$.","authors_text":"Micha{\\l} D\\k{e}bski, Pawe{\\l} Rz\\k{a}\\.zewski, Zbigniew Lonc","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-14T14:09:59Z","title":"Sequences of radius $k$ for complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05091","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:e9da2ee1bea2ab5c865235fb64864aef3a084e51a67698a1d5acc85be5fe87fa","target":"record","created_at":"2026-05-18T00:30:34Z","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":"98af1ff748bfeea8d16a294a2ff66c074c042caf254f18658a8130eb609a7309","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-11-14T14:09:59Z","title_canon_sha256":"e8e6695475748a0ec084df56fb8c86630e066cdcbd7c76bc4ca4ee4cacb2227a"},"schema_version":"1.0","source":{"id":"1711.05091","kind":"arxiv","version":1}},"canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","first_computed_at":"2026-05-18T00:30:34.778453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:34.778453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bMBCTPvIo72iAMNgRJOM57omCs80BBizscbqotlJ/h/oS99NSDU3z1w2TdhTljdQDZg8mEvJccp7BIpKmN67Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:34.779100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05091","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9da2ee1bea2ab5c865235fb64864aef3a084e51a67698a1d5acc85be5fe87fa","sha256:5e34f88715ea1c0c4ee7b5553241201fcddf39e92987134a2bd7172240178c79"],"state_sha256":"4105860fab83ea9e45df8a66b08ce0478a262450d1a7e7b9aff4245f77183db8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/boy8Rw0uioh8uRzCHfdEDO5l8KSjyBbIR1rc5s01wHR8xPwH2w8d8GrX1PIA7VIFvnMvhABH3xx/I/oEx4KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:04:29.587353Z","bundle_sha256":"742dd905ea1beda1ab81f320c5192b22fd8f185ce3bcfa52700fe5c5664e89f7"}}