{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UV42LPZKHMCXGKSX3M6O4SZEYU","short_pith_number":"pith:UV42LPZK","schema_version":"1.0","canonical_sha256":"a579a5bf2a3b05732a57db3cee4b24c512cf47373a14ba1a1867a021c921044a","source":{"kind":"arxiv","id":"1312.6524","version":1},"attestation_state":"computed","paper":{"title":"Bernoulli trials of fixed parity, random and randomly oriented graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christos Pelekis","submitted_at":"2013-12-23T11:27:19Z","abstract_excerpt":"Suppose you can color $n$ \\emph{biased} coins with $n$ colors, all coins having the same bias. It is forbidden to color both sides of a coin with the same color, but all other colors are allowed. Let $X$ be the number of different colors after a toss of the coins. We present a method to obtain an upper bound on a median of $X$. Our method is based on the analysis of the probability distribution of the number of vertices with even in-degree in graphs whose edges are given random orientations. Our analysis applies to the distribution of the number of vertices with odd degree in random sub-graphs"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.6524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.PR","submitted_at":"2013-12-23T11:27:19Z","cross_cats_sorted":[],"title_canon_sha256":"25a2811a03f4f4218f0a6140f260bd3ec4352bf7477b85bbc6ee81eac62d32d1","abstract_canon_sha256":"bbdabcfb036fd1edfd37bbdd1e48ff5b6036221c2f9f51cfac0031eba7c39e26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:58.010438Z","signature_b64":"eAtkL7gFlLFe9Q64lsj+gdkWkP+BKLeO46a/Ixya1zpUhofZDnhwBGgMHgoDb+LgYZSO8NFu5KG8GGbRt1JwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a579a5bf2a3b05732a57db3cee4b24c512cf47373a14ba1a1867a021c921044a","last_reissued_at":"2026-05-18T03:03:58.009826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:58.009826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bernoulli trials of fixed parity, random and randomly oriented graphs","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christos Pelekis","submitted_at":"2013-12-23T11:27:19Z","abstract_excerpt":"Suppose you can color $n$ \\emph{biased} coins with $n$ colors, all coins having the same bias. It is forbidden to color both sides of a coin with the same color, but all other colors are allowed. Let $X$ be the number of different colors after a toss of the coins. We present a method to obtain an upper bound on a median of $X$. Our method is based on the analysis of the probability distribution of the number of vertices with even in-degree in graphs whose edges are given random orientations. Our analysis applies to the distribution of the number of vertices with odd degree in random sub-graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6524","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.6524","created_at":"2026-05-18T03:03:58.009940+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.6524v1","created_at":"2026-05-18T03:03:58.009940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6524","created_at":"2026-05-18T03:03:58.009940+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV42LPZKHMCX","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV42LPZKHMCXGKSX","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV42LPZK","created_at":"2026-05-18T12:28:02.375192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU","json":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU.json","graph_json":"https://pith.science/api/pith-number/UV42LPZKHMCXGKSX3M6O4SZEYU/graph.json","events_json":"https://pith.science/api/pith-number/UV42LPZKHMCXGKSX3M6O4SZEYU/events.json","paper":"https://pith.science/paper/UV42LPZK"},"agent_actions":{"view_html":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU","download_json":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU.json","view_paper":"https://pith.science/paper/UV42LPZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.6524&json=true","fetch_graph":"https://pith.science/api/pith-number/UV42LPZKHMCXGKSX3M6O4SZEYU/graph.json","fetch_events":"https://pith.science/api/pith-number/UV42LPZKHMCXGKSX3M6O4SZEYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU/action/storage_attestation","attest_author":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU/action/author_attestation","sign_citation":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU/action/citation_signature","submit_replication":"https://pith.science/pith/UV42LPZKHMCXGKSX3M6O4SZEYU/action/replication_record"}},"created_at":"2026-05-18T03:03:58.009940+00:00","updated_at":"2026-05-18T03:03:58.009940+00:00"}