{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V52RYXS2YFRNNEXGJOX7XVUE57","short_pith_number":"pith:V52RYXS2","schema_version":"1.0","canonical_sha256":"af751c5e5ac162d692e64baffbd684efe60519a199ea7ef1f16a4417c3554c55","source":{"kind":"arxiv","id":"1403.6307","version":1},"attestation_state":"computed","paper":{"title":"A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grant Cairns, Stacey Mendan, Yuri Nikolayevsky","submitted_at":"2014-03-25T11:25:23Z","abstract_excerpt":"We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends only on the length of the sequence and its largest and smallest elements."},"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":"1403.6307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-25T11:25:23Z","cross_cats_sorted":[],"title_canon_sha256":"d31ea2138cbce4fc4ea8ed6b5ecf161e3d1feb58ac282636ccffd36c66204a0f","abstract_canon_sha256":"3c71954dd37e6dec6fe949025f17fb8fddaed487b88d840c7b03d3567c27a494"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:37.253477Z","signature_b64":"BR73bXk3OvHKth1PfSwG4NvVo8JK3lNfwOqgEzIhgz3sLBOPJNWlih+W9FwVGr0gmhVmRldcQACLXGHoFD34Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af751c5e5ac162d692e64baffbd684efe60519a199ea7ef1f16a4417c3554c55","last_reissued_at":"2026-05-18T02:55:37.252906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:37.252906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp refinement of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Grant Cairns, Stacey Mendan, Yuri Nikolayevsky","submitted_at":"2014-03-25T11:25:23Z","abstract_excerpt":"We give a sharp refinement of a result of Alon, Ben-Shimon and Krivelevich. This gives a sufficient condition for a finite sequence of positive integers to be the vertex degree list of both parts of a bipartite graph. The condition depends only on the length of the sequence and its largest and smallest elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.6307","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":"1403.6307","created_at":"2026-05-18T02:55:37.252989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.6307v1","created_at":"2026-05-18T02:55:37.252989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.6307","created_at":"2026-05-18T02:55:37.252989+00:00"},{"alias_kind":"pith_short_12","alias_value":"V52RYXS2YFRN","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V52RYXS2YFRNNEXG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V52RYXS2","created_at":"2026-05-18T12:28:52.271510+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/V52RYXS2YFRNNEXGJOX7XVUE57","json":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57.json","graph_json":"https://pith.science/api/pith-number/V52RYXS2YFRNNEXGJOX7XVUE57/graph.json","events_json":"https://pith.science/api/pith-number/V52RYXS2YFRNNEXGJOX7XVUE57/events.json","paper":"https://pith.science/paper/V52RYXS2"},"agent_actions":{"view_html":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57","download_json":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57.json","view_paper":"https://pith.science/paper/V52RYXS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.6307&json=true","fetch_graph":"https://pith.science/api/pith-number/V52RYXS2YFRNNEXGJOX7XVUE57/graph.json","fetch_events":"https://pith.science/api/pith-number/V52RYXS2YFRNNEXGJOX7XVUE57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57/action/storage_attestation","attest_author":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57/action/author_attestation","sign_citation":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57/action/citation_signature","submit_replication":"https://pith.science/pith/V52RYXS2YFRNNEXGJOX7XVUE57/action/replication_record"}},"created_at":"2026-05-18T02:55:37.252989+00:00","updated_at":"2026-05-18T02:55:37.252989+00:00"}