{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CW4NEYMDIHXX4AMLKNGH6BAHW2","short_pith_number":"pith:CW4NEYMD","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"},"canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","source":{"kind":"arxiv","id":"1501.00076","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00076","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00076v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00076","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"CW4NEYMDIHXX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CW4NEYMDIHXX4AML","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CW4NEYMD","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CW4NEYMDIHXX4AMLKNGH6BAHW2","target":"record","payload":{"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"},"canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","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"},"source_kind":"arxiv","source_id":"1501.00076","source_version":2,"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:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOGetTCth2CydYMu51I0TOYzMXALeHMHjHpBImDIm0x1ejcxeNtjn2s1N8MCYhce2fDyoijLmh/Azl7uy7wiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:45:52.544452Z"},"content_sha256":"2d5af95083dcc655d15f02ca54d10122201c972de74fdf10e7d7dd01362fa3c8","schema_version":"1.0","event_id":"sha256:2d5af95083dcc655d15f02ca54d10122201c972de74fdf10e7d7dd01362fa3c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CW4NEYMDIHXX4AMLKNGH6BAHW2","target":"graph","payload":{"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"},"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:57:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SphggnQM86f6wwJQ0vVtzbLgUWLA61eU39Y4jEydMj43RsajpM7XJc1V6l5qr3ryGPTPPoV4ikjvxAQjYbW+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:45:52.544799Z"},"content_sha256":"93782ba41ba5cf705910e8b161dcc8da6078567e5cf52b2c150bc45ac0d13969","schema_version":"1.0","event_id":"sha256:93782ba41ba5cf705910e8b161dcc8da6078567e5cf52b2c150bc45ac0d13969"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/bundle.json","state_url":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/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-02T19:45:52Z","links":{"resolver":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2","bundle":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/bundle.json","state":"https://pith.science/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CW4NEYMDIHXX4AMLKNGH6BAHW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CW4NEYMDIHXX4AMLKNGH6BAHW2","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":"dd9640d521b6cc81abf957ab051b10d57dc16ee4d9eed47d28358465f3ad0234","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T04:36:39Z","title_canon_sha256":"bf75ef490fe3cc51ecb9c8ce022ead55b5966c19903f2e3b343c5dd3e3f8328d"},"schema_version":"1.0","source":{"id":"1501.00076","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00076","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00076v2","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00076","created_at":"2026-05-18T00:57:38Z"},{"alias_kind":"pith_short_12","alias_value":"CW4NEYMDIHXX","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CW4NEYMDIHXX4AML","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CW4NEYMD","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:93782ba41ba5cf705910e8b161dcc8da6078567e5cf52b2c150bc45ac0d13969","target":"graph","created_at":"2026-05-18T00:57:38Z","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":"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","authors_text":"Bernardo Abrego, Daniel J. Katz, Levon Kolesnikov, Silvia Fernandez-Merchant","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T04:36:39Z","title":"On The Number of Similar Instances of a Pattern in a Finite Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00076","kind":"arxiv","version":2},"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:2d5af95083dcc655d15f02ca54d10122201c972de74fdf10e7d7dd01362fa3c8","target":"record","created_at":"2026-05-18T00:57:38Z","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":"dd9640d521b6cc81abf957ab051b10d57dc16ee4d9eed47d28358465f3ad0234","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T04:36:39Z","title_canon_sha256":"bf75ef490fe3cc51ecb9c8ce022ead55b5966c19903f2e3b343c5dd3e3f8328d"},"schema_version":"1.0","source":{"id":"1501.00076","kind":"arxiv","version":2}},"canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15b8d2618341ef7e018b534c7f0407b6b03a8565b6b945f394110e53aaa1e91f","first_computed_at":"2026-05-18T00:57:38.415725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:38.415725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+RAZn7AEwU43YY2M2uu8QRUZVcaVgkEyrfnvo4VDr2nK1LB87exIrAqmRKEpbaaZaXIsZIZI/JNbjIMbuMbiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:38.416421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00076","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d5af95083dcc655d15f02ca54d10122201c972de74fdf10e7d7dd01362fa3c8","sha256:93782ba41ba5cf705910e8b161dcc8da6078567e5cf52b2c150bc45ac0d13969"],"state_sha256":"2a3f8a13d3c773d1f8ec9f8fc6bb370f519b4498cf75c97c9dcd995efd38d082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eicXwfV96lxhNkE82E0/StDptFCkovtRAe0o1ul2WqJi80CI74+evJlCq07qHCIvexBsJplPRTe2FeQzwvVkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:45:52.546727Z","bundle_sha256":"68618c26d09e4c3688947dcbb32c5034523e7795ba035a9f59cf0a8f47e63d6f"}}