{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MQYGWCZYCH2L4SMOFBBWG65KEJ","short_pith_number":"pith:MQYGWCZY","canonical_record":{"source":{"id":"1309.0644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:14:30Z","cross_cats_sorted":[],"title_canon_sha256":"2ce354b43a2e4dc9ca55fdca917e3a2e904fef2610cf0e24a3ff0f9f177acf6d","abstract_canon_sha256":"2c36ef155154a4e568bb8ebb3007f48dcddca0d93f52f0b2dbe18d1d4142e583"},"schema_version":"1.0"},"canonical_sha256":"64306b0b3811f4be498e2843637baa2244f8f8257a0da8f4cd858339022b688c","source":{"kind":"arxiv","id":"1309.0644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0644","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0644v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0644","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"MQYGWCZYCH2L","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQYGWCZYCH2L4SMO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQYGWCZY","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MQYGWCZYCH2L4SMOFBBWG65KEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.0644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:14:30Z","cross_cats_sorted":[],"title_canon_sha256":"2ce354b43a2e4dc9ca55fdca917e3a2e904fef2610cf0e24a3ff0f9f177acf6d","abstract_canon_sha256":"2c36ef155154a4e568bb8ebb3007f48dcddca0d93f52f0b2dbe18d1d4142e583"},"schema_version":"1.0"},"canonical_sha256":"64306b0b3811f4be498e2843637baa2244f8f8257a0da8f4cd858339022b688c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:18.464788Z","signature_b64":"YPCI2EytQOUEQJuYi90kyh4UtCdmUAull8jjmsd/jBYhyGtRWTNXR3irBdYcBOVEq4Mnk6MqCcT7QTsLYlU7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64306b0b3811f4be498e2843637baa2244f8f8257a0da8f4cd858339022b688c","last_reissued_at":"2026-05-18T03:14:18.464203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:18.464203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.0644","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fb4hfo5fXiVuEiHHo6h8AJq6n+td0IvnF0oXXyUbUn2BNc7/JxV0Vfq+F+vIal2esSAn3gfd1/aAbflNgZOSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:24:03.760065Z"},"content_sha256":"842bacd46800d87db387dc34e5066e9c85ed76cb4c19965e561d9a32abb99f55","schema_version":"1.0","event_id":"sha256:842bacd46800d87db387dc34e5066e9c85ed76cb4c19965e561d9a32abb99f55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MQYGWCZYCH2L4SMOFBBWG65KEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding linear patterns of complexity one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xuancheng Shao","submitted_at":"2013-09-03T11:14:30Z","abstract_excerpt":"We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the averages (x_i+x_j)/2. Our main result states that if a set A contained in {1,2,...,N} has density at least (log N)^{-c(s)} for some positive constant c(s)>0 depending on s, then A contains a nontrivial s-configuration. We also deduce, as a corollary, an improvement of a problem involving sumfree subsets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0644","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-18T03:14:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBNkHXHztSRwLV1fDRToVUzG/rDXCnHrmOyGHUkQMiEzLtzew6GSA1XUd6dZVqiEzZJdsLpVccmGZHbmnpjdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T09:24:03.760416Z"},"content_sha256":"bcdc24af795a40125d7ba2981a0fc23c5e0f5e00318ebdf03ac41f96ceaf8b1e","schema_version":"1.0","event_id":"sha256:bcdc24af795a40125d7ba2981a0fc23c5e0f5e00318ebdf03ac41f96ceaf8b1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/bundle.json","state_url":"https://pith.science/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/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-02T09:24:03Z","links":{"resolver":"https://pith.science/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ","bundle":"https://pith.science/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/bundle.json","state":"https://pith.science/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQYGWCZYCH2L4SMOFBBWG65KEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MQYGWCZYCH2L4SMOFBBWG65KEJ","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":"2c36ef155154a4e568bb8ebb3007f48dcddca0d93f52f0b2dbe18d1d4142e583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:14:30Z","title_canon_sha256":"2ce354b43a2e4dc9ca55fdca917e3a2e904fef2610cf0e24a3ff0f9f177acf6d"},"schema_version":"1.0","source":{"id":"1309.0644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.0644","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1309.0644v1","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.0644","created_at":"2026-05-18T03:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"MQYGWCZYCH2L","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MQYGWCZYCH2L4SMO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MQYGWCZY","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:bcdc24af795a40125d7ba2981a0fc23c5e0f5e00318ebdf03ac41f96ceaf8b1e","target":"graph","created_at":"2026-05-18T03:14:18Z","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":"We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the averages (x_i+x_j)/2. Our main result states that if a set A contained in {1,2,...,N} has density at least (log N)^{-c(s)} for some positive constant c(s)>0 depending on s, then A contains a nontrivial s-configuration. We also deduce, as a corollary, an improvement of a problem involving sumfree subsets.","authors_text":"Xuancheng Shao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:14:30Z","title":"Finding linear patterns of complexity one"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.0644","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:842bacd46800d87db387dc34e5066e9c85ed76cb4c19965e561d9a32abb99f55","target":"record","created_at":"2026-05-18T03:14:18Z","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":"2c36ef155154a4e568bb8ebb3007f48dcddca0d93f52f0b2dbe18d1d4142e583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-03T11:14:30Z","title_canon_sha256":"2ce354b43a2e4dc9ca55fdca917e3a2e904fef2610cf0e24a3ff0f9f177acf6d"},"schema_version":"1.0","source":{"id":"1309.0644","kind":"arxiv","version":1}},"canonical_sha256":"64306b0b3811f4be498e2843637baa2244f8f8257a0da8f4cd858339022b688c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64306b0b3811f4be498e2843637baa2244f8f8257a0da8f4cd858339022b688c","first_computed_at":"2026-05-18T03:14:18.464203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:18.464203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPCI2EytQOUEQJuYi90kyh4UtCdmUAull8jjmsd/jBYhyGtRWTNXR3irBdYcBOVEq4Mnk6MqCcT7QTsLYlU7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:18.464788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.0644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:842bacd46800d87db387dc34e5066e9c85ed76cb4c19965e561d9a32abb99f55","sha256:bcdc24af795a40125d7ba2981a0fc23c5e0f5e00318ebdf03ac41f96ceaf8b1e"],"state_sha256":"9ac314dc44c19b0985412385f7af22ede71055c7e09f720c046a33babf10cd03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/+IXyE+fgTN5c1a/wNIuKEyRGFRh8hn45IahglDn1xsRBIvq/ASZp60mW3qfPR6GPKRyuubxU6YgG9kVbGSBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T09:24:03.762256Z","bundle_sha256":"90a37b5f54802ffe49a52ff66f1ec0102b423ba6b6b768a8c9365f488e0afa45"}}