{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SP5XCRBGEFWIVI4W653RWUWKR3","short_pith_number":"pith:SP5XCRBG","schema_version":"1.0","canonical_sha256":"93fb714426216c8aa396f7771b52ca8ef86fde60cf29fdddc730e199a6024c3c","source":{"kind":"arxiv","id":"1711.05091","version":1},"attestation_state":"computed","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$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.05091","created_at":"2026-05-18T00:30:34.778581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.05091v1","created_at":"2026-05-18T00:30:34.778581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05091","created_at":"2026-05-18T00:30:34.778581+00:00"},{"alias_kind":"pith_short_12","alias_value":"SP5XCRBGEFWI","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SP5XCRBGEFWIVI4W","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SP5XCRBG","created_at":"2026-05-18T12:31:43.269735+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/SP5XCRBGEFWIVI4W653RWUWKR3","json":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3.json","graph_json":"https://pith.science/api/pith-number/SP5XCRBGEFWIVI4W653RWUWKR3/graph.json","events_json":"https://pith.science/api/pith-number/SP5XCRBGEFWIVI4W653RWUWKR3/events.json","paper":"https://pith.science/paper/SP5XCRBG"},"agent_actions":{"view_html":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3","download_json":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3.json","view_paper":"https://pith.science/paper/SP5XCRBG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.05091&json=true","fetch_graph":"https://pith.science/api/pith-number/SP5XCRBGEFWIVI4W653RWUWKR3/graph.json","fetch_events":"https://pith.science/api/pith-number/SP5XCRBGEFWIVI4W653RWUWKR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/action/storage_attestation","attest_author":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/action/author_attestation","sign_citation":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/action/citation_signature","submit_replication":"https://pith.science/pith/SP5XCRBGEFWIVI4W653RWUWKR3/action/replication_record"}},"created_at":"2026-05-18T00:30:34.778581+00:00","updated_at":"2026-05-18T00:30:34.778581+00:00"}