{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CW4NEYMDIHXX4AMLKNGH6BAHW2","short_pith_number":"pith:CW4NEYMD","schema_version":"1.0","canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","source":{"kind":"arxiv","id":"1501.00076","version":2},"attestation_state":"computed","paper":{"title":"On The Number of Similar Instances of a Pattern in a Finite Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bernardo Abrego, Daniel J. Katz, Levon Kolesnikov, Silvia Fernandez-Merchant","submitted_at":"2014-12-31T04:36:39Z","abstract_excerpt":"New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is shown to be no more than $\\lfloor{(4 n-1)(n-1)/18}\\rfloor$. The number of $k$-term arithmetic progressions that lie within an $n$-point subset of the line is shown to be at most $(n-r)(n+r-k+1)/(2 k-2)$, where $r$ is the remainder when $n$ is divided by $k-1$. This upper bound is achieved when the $n$ points themselves form an arithmetic progression, but for s"},"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":"1501.00076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T04:36:39Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"bf75ef490fe3cc51ecb9c8ce022ead55b5966c19903f2e3b343c5dd3e3f8328d","abstract_canon_sha256":"dd9640d521b6cc81abf957ab051b10d57dc16ee4d9eed47d28358465f3ad0234"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.416421Z","signature_b64":"+RAZn7AEwU43YY2M2uu8QRUZVcaVgkEyrfnvo4VDr2nK1LB87exIrAqmRKEpbaaZaXIsZIZI/JNbjIMbuMbiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","last_reissued_at":"2026-05-18T00:57:38.415725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.415725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On The Number of Similar Instances of a Pattern in a Finite Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Bernardo Abrego, Daniel J. Katz, Levon Kolesnikov, Silvia Fernandez-Merchant","submitted_at":"2014-12-31T04:36:39Z","abstract_excerpt":"New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is shown to be no more than $\\lfloor{(4 n-1)(n-1)/18}\\rfloor$. The number of $k$-term arithmetic progressions that lie within an $n$-point subset of the line is shown to be at most $(n-r)(n+r-k+1)/(2 k-2)$, where $r$ is the remainder when $n$ is divided by $k-1$. This upper bound is achieved when the $n$ points themselves form an arithmetic progression, but for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00076","kind":"arxiv","version":2},"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":"1501.00076","created_at":"2026-05-18T00:57:38.415825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00076v2","created_at":"2026-05-18T00:57:38.415825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00076","created_at":"2026-05-18T00:57:38.415825+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW4NEYMDIHXX","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW4NEYMDIHXX4AML","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW4NEYMD","created_at":"2026-05-18T12:28:25.294606+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/CW4NEYMDIHXX4AMLKNGH6BAHW2","json":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2.json","graph_json":"https://pith.science/api/pith-number/CW4NEYMDIHXX4AMLKNGH6BAHW2/graph.json","events_json":"https://pith.science/api/pith-number/CW4NEYMDIHXX4AMLKNGH6BAHW2/events.json","paper":"https://pith.science/paper/CW4NEYMD"},"agent_actions":{"view_html":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2","download_json":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2.json","view_paper":"https://pith.science/paper/CW4NEYMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00076&json=true","fetch_graph":"https://pith.science/api/pith-number/CW4NEYMDIHXX4AMLKNGH6BAHW2/graph.json","fetch_events":"https://pith.science/api/pith-number/CW4NEYMDIHXX4AMLKNGH6BAHW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/action/storage_attestation","attest_author":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/action/author_attestation","sign_citation":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/action/citation_signature","submit_replication":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/action/replication_record"}},"created_at":"2026-05-18T00:57:38.415825+00:00","updated_at":"2026-05-18T00:57:38.415825+00:00"}