{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:SN7H4WEBJYLHY5FG7URNLDNROI","short_pith_number":"pith:SN7H4WEB","canonical_record":{"source":{"id":"2112.12716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-23T17:09:59Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"4aafece2f72f1151c0d6141ef42ede580caacf37b189e1845e1dd51ba68b51e7","abstract_canon_sha256":"8200cc1b6d9c2d4b7c929727fcbf1243451d7890e96c9a0b3ce8b4d35bdb8ab5"},"schema_version":"1.0"},"canonical_sha256":"937e7e58814e167c74a6fd22d58db1722ac99ecba3595b5e18450b39c9bd7715","source":{"kind":"arxiv","id":"2112.12716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.12716","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"2112.12716v1","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12716","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"SN7H4WEBJYLH","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_16","alias_value":"SN7H4WEBJYLHY5FG","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_8","alias_value":"SN7H4WEB","created_at":"2026-07-05T03:43:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:SN7H4WEBJYLHY5FG7URNLDNROI","target":"record","payload":{"canonical_record":{"source":{"id":"2112.12716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-23T17:09:59Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"4aafece2f72f1151c0d6141ef42ede580caacf37b189e1845e1dd51ba68b51e7","abstract_canon_sha256":"8200cc1b6d9c2d4b7c929727fcbf1243451d7890e96c9a0b3ce8b4d35bdb8ab5"},"schema_version":"1.0"},"canonical_sha256":"937e7e58814e167c74a6fd22d58db1722ac99ecba3595b5e18450b39c9bd7715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:43:30.460585Z","signature_b64":"smtRCjR/p0HauROe7SRk1+4GLnKRrSuge5DGqMgUk2RIGa2dtCeYFOfOsuU3vo/Elhf5GzqyoidI6NFZYATLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"937e7e58814e167c74a6fd22d58db1722ac99ecba3595b5e18450b39c9bd7715","last_reissued_at":"2026-07-05T03:43:30.460185Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:43:30.460185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.12716","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-07-05T03:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJJWlYD6hR7Xous+ebfx5oq7DZKLcZs0ytCXhZPmZnpfhdjenAcoUkvzSq+Mv1UGSeWHRmqJ/S7dkRvI9204Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:03:58.928384Z"},"content_sha256":"4e5e6609b9e35c3bc30d339cbcb63fa80703dd05937af83c24e721ce0ae4769b","schema_version":"1.0","event_id":"sha256:4e5e6609b9e35c3bc30d339cbcb63fa80703dd05937af83c24e721ce0ae4769b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:SN7H4WEBJYLHY5FG7URNLDNROI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Plane point sets with many squares or isosceles right triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Sascha Kurz","submitted_at":"2021-12-23T17:09:59Z","abstract_excerpt":"How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\\square}(n)$ of squares and determine the exact values for all $n\\le 17$. For $18\\le n\\le 100$ we give lower bounds for $S_{\\square}(n)$. Besides that a few preliminary structural results are obtained. For the related problem of the maximum possible number of isosceles right triangles we determine the exact values for $n\\le 14$ and give lower bounds for $15\\le n\\le 50$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12716","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.12716/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:43:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hXoSzpKgIdiFNNvq+e9RXFzTnMJ5GTCNvtEz+9EOseMLMZmqV0GmS9HIcAsJmoqebxZuvBQJpPYAAdAg6UJLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T08:03:58.929362Z"},"content_sha256":"fd1fac2bfed54284235599ecd8200b97adab8afcf301cd07f107259b2279c533","schema_version":"1.0","event_id":"sha256:fd1fac2bfed54284235599ecd8200b97adab8afcf301cd07f107259b2279c533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SN7H4WEBJYLHY5FG7URNLDNROI/bundle.json","state_url":"https://pith.science/pith/SN7H4WEBJYLHY5FG7URNLDNROI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SN7H4WEBJYLHY5FG7URNLDNROI/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-08-11T08:03:58Z","links":{"resolver":"https://pith.science/pith/SN7H4WEBJYLHY5FG7URNLDNROI","bundle":"https://pith.science/pith/SN7H4WEBJYLHY5FG7URNLDNROI/bundle.json","state":"https://pith.science/pith/SN7H4WEBJYLHY5FG7URNLDNROI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SN7H4WEBJYLHY5FG7URNLDNROI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:SN7H4WEBJYLHY5FG7URNLDNROI","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":"8200cc1b6d9c2d4b7c929727fcbf1243451d7890e96c9a0b3ce8b4d35bdb8ab5","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-23T17:09:59Z","title_canon_sha256":"4aafece2f72f1151c0d6141ef42ede580caacf37b189e1845e1dd51ba68b51e7"},"schema_version":"1.0","source":{"id":"2112.12716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.12716","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"arxiv_version","alias_value":"2112.12716v1","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12716","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_12","alias_value":"SN7H4WEBJYLH","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_16","alias_value":"SN7H4WEBJYLHY5FG","created_at":"2026-07-05T03:43:30Z"},{"alias_kind":"pith_short_8","alias_value":"SN7H4WEB","created_at":"2026-07-05T03:43:30Z"}],"graph_snapshots":[{"event_id":"sha256:fd1fac2bfed54284235599ecd8200b97adab8afcf301cd07f107259b2279c533","target":"graph","created_at":"2026-07-05T03:43:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.12716/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"How many squares are spanned by $n$ points in the plane? Here we study the corresponding maximum possible number $S_{\\square}(n)$ of squares and determine the exact values for all $n\\le 17$. For $18\\le n\\le 100$ we give lower bounds for $S_{\\square}(n)$. Besides that a few preliminary structural results are obtained. For the related problem of the maximum possible number of isosceles right triangles we determine the exact values for $n\\le 14$ and give lower bounds for $15\\le n\\le 50$.","authors_text":"Sascha Kurz","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-23T17:09:59Z","title":"Plane point sets with many squares or isosceles right triangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12716","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:4e5e6609b9e35c3bc30d339cbcb63fa80703dd05937af83c24e721ce0ae4769b","target":"record","created_at":"2026-07-05T03:43:30Z","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":"8200cc1b6d9c2d4b7c929727fcbf1243451d7890e96c9a0b3ce8b4d35bdb8ab5","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-23T17:09:59Z","title_canon_sha256":"4aafece2f72f1151c0d6141ef42ede580caacf37b189e1845e1dd51ba68b51e7"},"schema_version":"1.0","source":{"id":"2112.12716","kind":"arxiv","version":1}},"canonical_sha256":"937e7e58814e167c74a6fd22d58db1722ac99ecba3595b5e18450b39c9bd7715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"937e7e58814e167c74a6fd22d58db1722ac99ecba3595b5e18450b39c9bd7715","first_computed_at":"2026-07-05T03:43:30.460185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:43:30.460185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"smtRCjR/p0HauROe7SRk1+4GLnKRrSuge5DGqMgUk2RIGa2dtCeYFOfOsuU3vo/Elhf5GzqyoidI6NFZYATLAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:43:30.460585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.12716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e5e6609b9e35c3bc30d339cbcb63fa80703dd05937af83c24e721ce0ae4769b","sha256:fd1fac2bfed54284235599ecd8200b97adab8afcf301cd07f107259b2279c533"],"state_sha256":"9b84a25a3d4b0e75cd30a42c5f49cd0e8e16c69f38fed9d36cf992d375741905"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jrsm2R+UEgghM7o54CB2NCUA5ulSGIsuVFMrshH7vov/rY4z7YqTxl3ZKcZgo553tmMdrna6+DjX46OEGa8cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T08:03:58.936823Z","bundle_sha256":"f5674ed20407beb86b511742a6c226896d0f270c3c80c710444c22c8d33ecd2b"}}