{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7VLZNKVTQBE6YTOWA4N4XGIOZH","short_pith_number":"pith:7VLZNKVT","schema_version":"1.0","canonical_sha256":"fd5796aab38049ec4dd6071bcb990ec9d3abf8e3c2ba5046ff4c09510e3cab32","source":{"kind":"arxiv","id":"1512.02404","version":1},"attestation_state":"computed","paper":{"title":"A sufficient condition for a pair of sequences to be bipartite graphic","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":"2015-12-08T11:08:04Z","abstract_excerpt":"We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their 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":"1512.02404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-08T11:08:04Z","cross_cats_sorted":[],"title_canon_sha256":"b2af8b2073a4aa699b2b819271ec0f6024ad23a2726dbc7f2a99b7cd87719d9d","abstract_canon_sha256":"0cdd903932a9b76c771db55cc82805469f6d02f5397e9fef0b4f9bec0ed27ca1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:34.310786Z","signature_b64":"PkD4/fyhW1kwlhVdNmYciawGQF5g0pNPo19Ut5SPdDU/+9MjCWBN1PMmn4ZHYP/0OkNaVbp/zcPHgUM/cvXrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd5796aab38049ec4dd6071bcb990ec9d3abf8e3c2ba5046ff4c09510e3cab32","last_reissued_at":"2026-05-17T23:53:34.310096Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:34.310096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sufficient condition for a pair of sequences to be bipartite graphic","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":"2015-12-08T11:08:04Z","abstract_excerpt":"We present a sufficient condition for a pair of finite integer sequences to be degree sequences of a bipartite graph, based only on the lengths of the sequences and their largest and smallest elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02404","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":"1512.02404","created_at":"2026-05-17T23:53:34.310200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02404v1","created_at":"2026-05-17T23:53:34.310200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02404","created_at":"2026-05-17T23:53:34.310200+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VLZNKVTQBE6","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VLZNKVTQBE6YTOW","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VLZNKVT","created_at":"2026-05-18T12:29:10.953037+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/7VLZNKVTQBE6YTOWA4N4XGIOZH","json":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH.json","graph_json":"https://pith.science/api/pith-number/7VLZNKVTQBE6YTOWA4N4XGIOZH/graph.json","events_json":"https://pith.science/api/pith-number/7VLZNKVTQBE6YTOWA4N4XGIOZH/events.json","paper":"https://pith.science/paper/7VLZNKVT"},"agent_actions":{"view_html":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH","download_json":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH.json","view_paper":"https://pith.science/paper/7VLZNKVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02404&json=true","fetch_graph":"https://pith.science/api/pith-number/7VLZNKVTQBE6YTOWA4N4XGIOZH/graph.json","fetch_events":"https://pith.science/api/pith-number/7VLZNKVTQBE6YTOWA4N4XGIOZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH/action/storage_attestation","attest_author":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH/action/author_attestation","sign_citation":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH/action/citation_signature","submit_replication":"https://pith.science/pith/7VLZNKVTQBE6YTOWA4N4XGIOZH/action/replication_record"}},"created_at":"2026-05-17T23:53:34.310200+00:00","updated_at":"2026-05-17T23:53:34.310200+00:00"}