{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:76K4CZRU6D6CTIRTDJARXBELUZ","short_pith_number":"pith:76K4CZRU","schema_version":"1.0","canonical_sha256":"ff95c16634f0fc29a2331a411b848ba66f9a7957021e320aac2cb9418c9ad4bb","source":{"kind":"arxiv","id":"1902.08259","version":1},"attestation_state":"computed","paper":{"title":"On the Number of Discrete Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Sheffer, Eyvindur Ari Palsson, Steven Senger","submitted_at":"2019-02-21T20:54:28Z","abstract_excerpt":"We study a generalization of Erd\\H os's unit distances problem to chains of $k$ distances. Given $\\mathcal P,$ a set of $n$ points, and a sequence of distances $(\\delta_1,\\ldots,\\delta_k)$, we study the maximum possible number of tuples of distinct points $(p_1,\\ldots,p_{k+1})\\in \\mathcal P^{k+1}$ satisfying $|p_j p_{j+1}|=\\delta_j$ for every $1\\leq j \\leq k$. We study the problem in $\\mathbb R^2$ and in $\\mathbb R^3$, and derive upper and lower bounds for this family of problems."},"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":"1902.08259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-21T20:54:28Z","cross_cats_sorted":[],"title_canon_sha256":"9d16aa07247893f7b92c6ed3cc2d7a747b3aa14ffbebf66d05f29f8a59ac2bc2","abstract_canon_sha256":"6025bcb29f50552ccc2064c050b7e74554487e782fd474ed1213947ff06787f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:57.843854Z","signature_b64":"aor35x3FSMhMBzhBclotOnwXwdYr9YEqTwkjpSt9y3RYBa8W+7r4ViwXPI7xI/r9/JhypRKu8gNPpnc2UQHiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff95c16634f0fc29a2331a411b848ba66f9a7957021e320aac2cb9418c9ad4bb","last_reissued_at":"2026-05-17T23:52:57.843158Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:57.843158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Number of Discrete Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Sheffer, Eyvindur Ari Palsson, Steven Senger","submitted_at":"2019-02-21T20:54:28Z","abstract_excerpt":"We study a generalization of Erd\\H os's unit distances problem to chains of $k$ distances. Given $\\mathcal P,$ a set of $n$ points, and a sequence of distances $(\\delta_1,\\ldots,\\delta_k)$, we study the maximum possible number of tuples of distinct points $(p_1,\\ldots,p_{k+1})\\in \\mathcal P^{k+1}$ satisfying $|p_j p_{j+1}|=\\delta_j$ for every $1\\leq j \\leq k$. We study the problem in $\\mathbb R^2$ and in $\\mathbb R^3$, and derive upper and lower bounds for this family of problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08259","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":"1902.08259","created_at":"2026-05-17T23:52:57.843254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08259v1","created_at":"2026-05-17T23:52:57.843254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08259","created_at":"2026-05-17T23:52:57.843254+00:00"},{"alias_kind":"pith_short_12","alias_value":"76K4CZRU6D6C","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"76K4CZRU6D6CTIRT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"76K4CZRU","created_at":"2026-05-18T12:33:12.712433+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/76K4CZRU6D6CTIRTDJARXBELUZ","json":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ.json","graph_json":"https://pith.science/api/pith-number/76K4CZRU6D6CTIRTDJARXBELUZ/graph.json","events_json":"https://pith.science/api/pith-number/76K4CZRU6D6CTIRTDJARXBELUZ/events.json","paper":"https://pith.science/paper/76K4CZRU"},"agent_actions":{"view_html":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ","download_json":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ.json","view_paper":"https://pith.science/paper/76K4CZRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08259&json=true","fetch_graph":"https://pith.science/api/pith-number/76K4CZRU6D6CTIRTDJARXBELUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/76K4CZRU6D6CTIRTDJARXBELUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ/action/storage_attestation","attest_author":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ/action/author_attestation","sign_citation":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ/action/citation_signature","submit_replication":"https://pith.science/pith/76K4CZRU6D6CTIRTDJARXBELUZ/action/replication_record"}},"created_at":"2026-05-17T23:52:57.843254+00:00","updated_at":"2026-05-17T23:52:57.843254+00:00"}