{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:QZ2VC4KJG3HDRWFBQ7S5TO6P6Z","short_pith_number":"pith:QZ2VC4KJ","canonical_record":{"source":{"id":"0905.0298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T00:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"b720430863cb71b67dc73c0b0ceed5bbefa968ea715923f12386ff4a386d257b","abstract_canon_sha256":"eeb680c561435ef882e80184f4d62b5207235487a857f00c3aa122e94fe2dc0c"},"schema_version":"1.0"},"canonical_sha256":"867551714936ce38d8a187e5d9bbcff65b9de7d929f115d9f139b0dbdd763837","source":{"kind":"arxiv","id":"0905.0298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0298","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0298v1","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0298","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"QZ2VC4KJG3HD","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QZ2VC4KJG3HDRWFB","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QZ2VC4KJ","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:QZ2VC4KJG3HDRWFBQ7S5TO6P6Z","target":"record","payload":{"canonical_record":{"source":{"id":"0905.0298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T00:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"b720430863cb71b67dc73c0b0ceed5bbefa968ea715923f12386ff4a386d257b","abstract_canon_sha256":"eeb680c561435ef882e80184f4d62b5207235487a857f00c3aa122e94fe2dc0c"},"schema_version":"1.0"},"canonical_sha256":"867551714936ce38d8a187e5d9bbcff65b9de7d929f115d9f139b0dbdd763837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:57.345663Z","signature_b64":"5LsOz7AE8wV3rjtHDC0ty3H+fQPwY0g6o76taWJ6PIdLfWOdFeD8P5ePoRgC71mZJ55H1uH3oAsEKgeGgObCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"867551714936ce38d8a187e5d9bbcff65b9de7d929f115d9f139b0dbdd763837","last_reissued_at":"2026-05-18T04:27:57.345006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:57.345006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.0298","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-18T04:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k1C3trI5XrsSE87Bhg4lXYuGmmSQXoflN26zqWDIzCiTBHGaU5pvD56hjpXDyKe/+mZ2pQ1VvIf31MIoUqq/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:30.815609Z"},"content_sha256":"64a3dc429fa29fdbb55b72b6ccecaecd3f56d116907e78430d3bff9f2ceef205","schema_version":"1.0","event_id":"sha256:64a3dc429fa29fdbb55b72b6ccecaecd3f56d116907e78430d3bff9f2ceef205"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:QZ2VC4KJG3HDRWFBQ7S5TO6P6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point-sets in general position with many similar copies of a pattern","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernardo M. \\'Abrego, Silvia Fern\\'andez-Merchant","submitted_at":"2009-05-04T00:10:22Z","abstract_excerpt":"For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction, based on iterated Minkovski sums, is used to obtain new lower bounds for $S_{P}(n,m)$ when $P$ is an arbitrary pattern. Improved bounds are obtained when $P$ is a triangle or a regular polygon with few sides. It is also shown that $S_{P}(n,m)\\geq n^{2-\\epsilon}$ whenever $m(n)\\to \\infty$ as $n \\to\\infty$. Finite sets with no collinear triples and not containing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0298","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-18T04:27:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NP6C4xGrhkX8+k3J+tlsaHIZ6TL6P1ak7Swg5SlRNgKN1prihfqdFwT85txDiNjz78kZUL4t5oWGFu+6Z+NmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:04:30.815961Z"},"content_sha256":"6579d61d2ec9859e4e6f45986a881fac94a74a6d82bc909eb149b641820f1682","schema_version":"1.0","event_id":"sha256:6579d61d2ec9859e4e6f45986a881fac94a74a6d82bc909eb149b641820f1682"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/bundle.json","state_url":"https://pith.science/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/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-04T06:04:30Z","links":{"resolver":"https://pith.science/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z","bundle":"https://pith.science/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/bundle.json","state":"https://pith.science/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZ2VC4KJG3HDRWFBQ7S5TO6P6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:QZ2VC4KJG3HDRWFBQ7S5TO6P6Z","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":"eeb680c561435ef882e80184f4d62b5207235487a857f00c3aa122e94fe2dc0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T00:10:22Z","title_canon_sha256":"b720430863cb71b67dc73c0b0ceed5bbefa968ea715923f12386ff4a386d257b"},"schema_version":"1.0","source":{"id":"0905.0298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.0298","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"arxiv_version","alias_value":"0905.0298v1","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.0298","created_at":"2026-05-18T04:27:57Z"},{"alias_kind":"pith_short_12","alias_value":"QZ2VC4KJG3HD","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"QZ2VC4KJG3HDRWFB","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"QZ2VC4KJ","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:6579d61d2ec9859e4e6f45986a881fac94a74a6d82bc909eb149b641820f1682","target":"graph","created_at":"2026-05-18T04:27:57Z","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":"For every pattern $P$, consisting of a finite set of points in the plane, $S_{P}(n,m)$ is defined as the largest number of similar copies of $P$ among sets of $n$ points in the plane without $m$ points on a line. A general construction, based on iterated Minkovski sums, is used to obtain new lower bounds for $S_{P}(n,m)$ when $P$ is an arbitrary pattern. Improved bounds are obtained when $P$ is a triangle or a regular polygon with few sides. It is also shown that $S_{P}(n,m)\\geq n^{2-\\epsilon}$ whenever $m(n)\\to \\infty$ as $n \\to\\infty$. Finite sets with no collinear triples and not containing","authors_text":"Bernardo M. \\'Abrego, Silvia Fern\\'andez-Merchant","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T00:10:22Z","title":"Point-sets in general position with many similar copies of a pattern"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.0298","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:64a3dc429fa29fdbb55b72b6ccecaecd3f56d116907e78430d3bff9f2ceef205","target":"record","created_at":"2026-05-18T04:27:57Z","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":"eeb680c561435ef882e80184f4d62b5207235487a857f00c3aa122e94fe2dc0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-04T00:10:22Z","title_canon_sha256":"b720430863cb71b67dc73c0b0ceed5bbefa968ea715923f12386ff4a386d257b"},"schema_version":"1.0","source":{"id":"0905.0298","kind":"arxiv","version":1}},"canonical_sha256":"867551714936ce38d8a187e5d9bbcff65b9de7d929f115d9f139b0dbdd763837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"867551714936ce38d8a187e5d9bbcff65b9de7d929f115d9f139b0dbdd763837","first_computed_at":"2026-05-18T04:27:57.345006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:57.345006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5LsOz7AE8wV3rjtHDC0ty3H+fQPwY0g6o76taWJ6PIdLfWOdFeD8P5ePoRgC71mZJ55H1uH3oAsEKgeGgObCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:57.345663Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.0298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64a3dc429fa29fdbb55b72b6ccecaecd3f56d116907e78430d3bff9f2ceef205","sha256:6579d61d2ec9859e4e6f45986a881fac94a74a6d82bc909eb149b641820f1682"],"state_sha256":"5bd51b00d21221bdfcda72358e1ab73146beca4ee6b4bc2936f05f18d841b363"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iqunMy6/Fss0wRNnxeRf9BhTc/IuvTUnXzebtBwEomKHyi7FNiGQ9PmTAlP+omXni77EWGN955/WvNrTZMSaBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:04:30.817915Z","bundle_sha256":"9d6040f24e9cc49eb2b5e70c201adde827d3244837f61496bf4025c27b8d0785"}}