{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JGYKX6JLNLFQ4S5GCL4XJSYITY","short_pith_number":"pith:JGYKX6JL","schema_version":"1.0","canonical_sha256":"49b0abf92b6acb0e4ba612f974cb089e2ee68fc85d358bb4ac36da0ade0713cb","source":{"kind":"arxiv","id":"1610.00809","version":3},"attestation_state":"computed","paper":{"title":"The 1/3-2/3 Conjecture for ordered sets whose cover graph is a forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imed Zaguia","submitted_at":"2016-10-04T00:52:34Z","abstract_excerpt":"A balanced pair in an ordered set $P=(V,\\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and claim any ordered set that has a good pair will satisfy the conjecture and furthermore every ordered set which is not totally ordered and has a forest as its cover graph has a good pair."},"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":"1610.00809","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T00:52:34Z","cross_cats_sorted":[],"title_canon_sha256":"c9c95c51eb1487d0df17a13546aef2f4222217986c550f4698f0180578613e8c","abstract_canon_sha256":"7062370cce6d33f27913a0aeaba03e377fc3cd94506912e105fc82549295dbf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:12.747204Z","signature_b64":"wNxiFqNv5ganwWMfx6Qwmw+4BMZi4Dp2omDu8D318zvQkyM5qfMpS8Ckit30CqV2FghpdfSq4xyX31F0ah60AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49b0abf92b6acb0e4ba612f974cb089e2ee68fc85d358bb4ac36da0ade0713cb","last_reissued_at":"2026-05-18T00:42:12.746620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.746620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 1/3-2/3 Conjecture for ordered sets whose cover graph is a forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imed Zaguia","submitted_at":"2016-10-04T00:52:34Z","abstract_excerpt":"A balanced pair in an ordered set $P=(V,\\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We define the notion of a good pair and claim any ordered set that has a good pair will satisfy the conjecture and furthermore every ordered set which is not totally ordered and has a forest as its cover graph has a good pair."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00809","kind":"arxiv","version":3},"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":"1610.00809","created_at":"2026-05-18T00:42:12.746715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00809v3","created_at":"2026-05-18T00:42:12.746715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00809","created_at":"2026-05-18T00:42:12.746715+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGYKX6JLNLFQ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGYKX6JLNLFQ4S5G","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGYKX6JL","created_at":"2026-05-18T12:30:25.849896+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/JGYKX6JLNLFQ4S5GCL4XJSYITY","json":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY.json","graph_json":"https://pith.science/api/pith-number/JGYKX6JLNLFQ4S5GCL4XJSYITY/graph.json","events_json":"https://pith.science/api/pith-number/JGYKX6JLNLFQ4S5GCL4XJSYITY/events.json","paper":"https://pith.science/paper/JGYKX6JL"},"agent_actions":{"view_html":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY","download_json":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY.json","view_paper":"https://pith.science/paper/JGYKX6JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00809&json=true","fetch_graph":"https://pith.science/api/pith-number/JGYKX6JLNLFQ4S5GCL4XJSYITY/graph.json","fetch_events":"https://pith.science/api/pith-number/JGYKX6JLNLFQ4S5GCL4XJSYITY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY/action/storage_attestation","attest_author":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY/action/author_attestation","sign_citation":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY/action/citation_signature","submit_replication":"https://pith.science/pith/JGYKX6JLNLFQ4S5GCL4XJSYITY/action/replication_record"}},"created_at":"2026-05-18T00:42:12.746715+00:00","updated_at":"2026-05-18T00:42:12.746715+00:00"}