{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5EUS2MWBQIS6ILK4AX6E6AQLNK","short_pith_number":"pith:5EUS2MWB","canonical_record":{"source":{"id":"1710.03815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T20:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"7049037883b30ff690b3d45822d4dc9fbf46b841acd63076a79329d718fbc7b6","abstract_canon_sha256":"4142debe2c739dcaec97914e6a9fc1481308a7a30d4afafc20acdeb20036d37e"},"schema_version":"1.0"},"canonical_sha256":"e9292d32c18225e42d5c05fc4f020b6a9bfe85c2977136dfce8b9545ef515571","source":{"kind":"arxiv","id":"1710.03815","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03815","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03815v1","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03815","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"5EUS2MWBQIS6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5EUS2MWBQIS6ILK4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5EUS2MWB","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5EUS2MWBQIS6ILK4AX6E6AQLNK","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T20:42:06Z","cross_cats_sorted":[],"title_canon_sha256":"7049037883b30ff690b3d45822d4dc9fbf46b841acd63076a79329d718fbc7b6","abstract_canon_sha256":"4142debe2c739dcaec97914e6a9fc1481308a7a30d4afafc20acdeb20036d37e"},"schema_version":"1.0"},"canonical_sha256":"e9292d32c18225e42d5c05fc4f020b6a9bfe85c2977136dfce8b9545ef515571","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:05.909608Z","signature_b64":"ahtwZ0qhq2um4Ks5bPi0AeK9ZyJw0ooL6ekk977EX657cnOs9vCquKo9G/0zgCDDpAANjDqiAC5l4QqfhFrFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9292d32c18225e42d5c05fc4f020b6a9bfe85c2977136dfce8b9545ef515571","last_reissued_at":"2026-05-18T00:33:05.908957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:05.908957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03815","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-18T00:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPbjfDdADjoNkpSDURo5VMW11yxNRI2gFaILsvMd3RimVxrfeCrlvwfXMFz7+K80nWlSDUN9DpZbDNQJw+RXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:33.713125Z"},"content_sha256":"f10c74c2f7c273984eed46f060a0d4036c31c47a81930e6d25d9963652c63113","schema_version":"1.0","event_id":"sha256:f10c74c2f7c273984eed46f060a0d4036c31c47a81930e6d25d9963652c63113"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5EUS2MWBQIS6ILK4AX6E6AQLNK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability and exact Turan numbers for matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Kazuhiro Nomoto, Peter Nelson, Sammy Luo","submitted_at":"2017-10-10T20:42:06Z","abstract_excerpt":"We consider the Tur\\'an-type problem of bounding the size of a set $M \\subseteq \\mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \\subseteq \\mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\\H{o}s-Stone type theorem [5] in this setting gives a bound that is tight up to a $o(2^n)$ error term; our first main result gives a stability version of this theorem, showing that such an $M$ that is close in size to the upper bound in [5] is close in edit distance to the obvious extremal example. Our second result shows that the error term in [5] is exactly controlled by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03815","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-18T00:33:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zcc/Iw9e3HPZ0/ChHdHFsqRS1xUU8PWiqwp7uhTD+5Gy497/pFGkV5vwiFdMvpwTtza9pzCOQXapl4E1ztFWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:33.713479Z"},"content_sha256":"1ec9f41a824bc5e610c24d329bd57dad5bdac089ed17c8bbbfdf7e9491dc3dcc","schema_version":"1.0","event_id":"sha256:1ec9f41a824bc5e610c24d329bd57dad5bdac089ed17c8bbbfdf7e9491dc3dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/bundle.json","state_url":"https://pith.science/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/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-04T12:34:33Z","links":{"resolver":"https://pith.science/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK","bundle":"https://pith.science/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/bundle.json","state":"https://pith.science/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EUS2MWBQIS6ILK4AX6E6AQLNK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5EUS2MWBQIS6ILK4AX6E6AQLNK","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":"4142debe2c739dcaec97914e6a9fc1481308a7a30d4afafc20acdeb20036d37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T20:42:06Z","title_canon_sha256":"7049037883b30ff690b3d45822d4dc9fbf46b841acd63076a79329d718fbc7b6"},"schema_version":"1.0","source":{"id":"1710.03815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03815","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03815v1","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03815","created_at":"2026-05-18T00:33:05Z"},{"alias_kind":"pith_short_12","alias_value":"5EUS2MWBQIS6","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5EUS2MWBQIS6ILK4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5EUS2MWB","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:1ec9f41a824bc5e610c24d329bd57dad5bdac089ed17c8bbbfdf7e9491dc3dcc","target":"graph","created_at":"2026-05-18T00:33:05Z","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 consider the Tur\\'an-type problem of bounding the size of a set $M \\subseteq \\mathbb{F}_2^n$ that does not contain a linear copy of a given fixed set $N \\subseteq \\mathbb{F}_2^k$, where $n$ is large compared to $k$. An Erd\\H{o}s-Stone type theorem [5] in this setting gives a bound that is tight up to a $o(2^n)$ error term; our first main result gives a stability version of this theorem, showing that such an $M$ that is close in size to the upper bound in [5] is close in edit distance to the obvious extremal example. Our second result shows that the error term in [5] is exactly controlled by","authors_text":"Hong Liu, Kazuhiro Nomoto, Peter Nelson, Sammy Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T20:42:06Z","title":"Stability and exact Turan numbers for matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03815","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:f10c74c2f7c273984eed46f060a0d4036c31c47a81930e6d25d9963652c63113","target":"record","created_at":"2026-05-18T00:33:05Z","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":"4142debe2c739dcaec97914e6a9fc1481308a7a30d4afafc20acdeb20036d37e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-10T20:42:06Z","title_canon_sha256":"7049037883b30ff690b3d45822d4dc9fbf46b841acd63076a79329d718fbc7b6"},"schema_version":"1.0","source":{"id":"1710.03815","kind":"arxiv","version":1}},"canonical_sha256":"e9292d32c18225e42d5c05fc4f020b6a9bfe85c2977136dfce8b9545ef515571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9292d32c18225e42d5c05fc4f020b6a9bfe85c2977136dfce8b9545ef515571","first_computed_at":"2026-05-18T00:33:05.908957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:05.908957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ahtwZ0qhq2um4Ks5bPi0AeK9ZyJw0ooL6ekk977EX657cnOs9vCquKo9G/0zgCDDpAANjDqiAC5l4QqfhFrFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:05.909608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f10c74c2f7c273984eed46f060a0d4036c31c47a81930e6d25d9963652c63113","sha256:1ec9f41a824bc5e610c24d329bd57dad5bdac089ed17c8bbbfdf7e9491dc3dcc"],"state_sha256":"691e7ccfb5ad2e31651b3b5ffcbae0ac04a16ed915edc341dbee2a0b52b1d3cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZrfzirEOiEWnqiNCgMNP7bl2N7enXl9EdotoZv2hxxjnmQtiICRLDCjsg8ymtOeNzPNbirLuM4X6aNBW0uGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:34:33.715402Z","bundle_sha256":"c9a8f4798c16ff973eb6520b4c9b29707d6ccd3c8c1fdc6529c2cdb9a9bd28f2"}}