{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UWHSM4TTMXVBPXFX34NLW7JDRU","short_pith_number":"pith:UWHSM4TT","canonical_record":{"source":{"id":"1212.5063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T14:46:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6a10b8ace274d7702a8d3287ce7037b2c4ea62c229378ec9d8105a1ff0c542f2","abstract_canon_sha256":"3a731d187687243255ad0b510482723b3d654b743eb96635e14e38f45f5e56f2"},"schema_version":"1.0"},"canonical_sha256":"a58f26727365ea17dcb7df1abb7d238d3734603d5d61252598856be1e3790519","source":{"kind":"arxiv","id":"1212.5063","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5063","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5063v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5063","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"UWHSM4TTMXVB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UWHSM4TTMXVBPXFX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UWHSM4TT","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UWHSM4TTMXVBPXFX34NLW7JDRU","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T14:46:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6a10b8ace274d7702a8d3287ce7037b2c4ea62c229378ec9d8105a1ff0c542f2","abstract_canon_sha256":"3a731d187687243255ad0b510482723b3d654b743eb96635e14e38f45f5e56f2"},"schema_version":"1.0"},"canonical_sha256":"a58f26727365ea17dcb7df1abb7d238d3734603d5d61252598856be1e3790519","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:35.682836Z","signature_b64":"5vJ89bQ8UPbA7LC6eU1W3BlzztgGjJuECdIGYe0eSZrVmGe8EMQBwXCyfUEiBdW+31rlaEtNnpRZS+kaQxIVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a58f26727365ea17dcb7df1abb7d238d3734603d5d61252598856be1e3790519","last_reissued_at":"2026-05-18T02:23:35.682033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:35.682033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5063","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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kACYFlHRsjWIiZaFW6ADjnp66NwMZSh4WdgQIhEGjUS4kLb3vBraU56JQI1dHoid7EnTzgSU0jSQTxLkEHQ4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:47.722021Z"},"content_sha256":"840c9b6a1104c6e53939bf78b651c06262d472b8b6473c6520043c208def414e","schema_version":"1.0","event_id":"sha256:840c9b6a1104c6e53939bf78b651c06262d472b8b6473c6520043c208def414e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UWHSM4TTMXVBPXFX34NLW7JDRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On constant-multiple-free sets contained in a random set of integers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Sang June Lee","submitted_at":"2012-12-20T14:46:29Z","abstract_excerpt":"For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$.\n  The extremal problem on estimating the maximum possible size of $r$-multiple-free sets contained in $[n]:={1,2,...,n}$ has been studied for its own interest in combinatorial number theory and application to coding theory. Let $a$, $b$ be positive integers such that $a<b$ and the greatest common divisor of $a$ and $b$ is 1. Wakeham and Wood showed that the maximum size of $(b/a)$-multiple-free sets contained in $[n]$ is $\\frac{b}{b+1}n+O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5063","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-18T02:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rG+nl5L9xMR/UIhyDyBWmHfTbnjlaGABiJ2U5aYOVjFLrzjMer9V8LTOWH9iXRaftVX9l6DL6mf1Kq/5kGECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:47.722651Z"},"content_sha256":"977985e064b9a4b48f97fb0c63e1fe54ddb8e2effcd85e2af12cb3e066632fd3","schema_version":"1.0","event_id":"sha256:977985e064b9a4b48f97fb0c63e1fe54ddb8e2effcd85e2af12cb3e066632fd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/bundle.json","state_url":"https://pith.science/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/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-05-27T16:10:47Z","links":{"resolver":"https://pith.science/pith/UWHSM4TTMXVBPXFX34NLW7JDRU","bundle":"https://pith.science/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/bundle.json","state":"https://pith.science/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWHSM4TTMXVBPXFX34NLW7JDRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UWHSM4TTMXVBPXFX34NLW7JDRU","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":"3a731d187687243255ad0b510482723b3d654b743eb96635e14e38f45f5e56f2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T14:46:29Z","title_canon_sha256":"6a10b8ace274d7702a8d3287ce7037b2c4ea62c229378ec9d8105a1ff0c542f2"},"schema_version":"1.0","source":{"id":"1212.5063","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5063","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5063v2","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5063","created_at":"2026-05-18T02:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"UWHSM4TTMXVB","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"UWHSM4TTMXVBPXFX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"UWHSM4TT","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:977985e064b9a4b48f97fb0c63e1fe54ddb8e2effcd85e2af12cb3e066632fd3","target":"graph","created_at":"2026-05-18T02:23:35Z","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 a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$.\n  The extremal problem on estimating the maximum possible size of $r$-multiple-free sets contained in $[n]:={1,2,...,n}$ has been studied for its own interest in combinatorial number theory and application to coding theory. Let $a$, $b$ be positive integers such that $a<b$ and the greatest common divisor of $a$ and $b$ is 1. Wakeham and Wood showed that the maximum size of $(b/a)$-multiple-free sets contained in $[n]$ is $\\frac{b}{b+1}n+O","authors_text":"Sang June Lee","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T14:46:29Z","title":"On constant-multiple-free sets contained in a random set of integers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5063","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:840c9b6a1104c6e53939bf78b651c06262d472b8b6473c6520043c208def414e","target":"record","created_at":"2026-05-18T02:23:35Z","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":"3a731d187687243255ad0b510482723b3d654b743eb96635e14e38f45f5e56f2","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T14:46:29Z","title_canon_sha256":"6a10b8ace274d7702a8d3287ce7037b2c4ea62c229378ec9d8105a1ff0c542f2"},"schema_version":"1.0","source":{"id":"1212.5063","kind":"arxiv","version":2}},"canonical_sha256":"a58f26727365ea17dcb7df1abb7d238d3734603d5d61252598856be1e3790519","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a58f26727365ea17dcb7df1abb7d238d3734603d5d61252598856be1e3790519","first_computed_at":"2026-05-18T02:23:35.682033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:35.682033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vJ89bQ8UPbA7LC6eU1W3BlzztgGjJuECdIGYe0eSZrVmGe8EMQBwXCyfUEiBdW+31rlaEtNnpRZS+kaQxIVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:35.682836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5063","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:840c9b6a1104c6e53939bf78b651c06262d472b8b6473c6520043c208def414e","sha256:977985e064b9a4b48f97fb0c63e1fe54ddb8e2effcd85e2af12cb3e066632fd3"],"state_sha256":"8a8ff6394177aa55a6e35b57dba15bdf3524f49a292d68e9fef5740eaae9fb76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yLtS6sP1cnvj6yxpK7MGIsnSMf4NkxEvc8R63nCPSRlZnG9RdnG2WCWuBiHjYsFsMbArP3S5cYdnvYOeKA3VDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:47.725561Z","bundle_sha256":"a149c5916de8a8b970df24f0088c1aaa16408376bdfaf9b57e5ce56dcf16934c"}}