{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3FKTXYVNSA345XZDRU7DFBEUV2","short_pith_number":"pith:3FKTXYVN","schema_version":"1.0","canonical_sha256":"d9553be2ad9037cedf238d3e328494aeb86add71e31491b283bf41c6c69ae811","source":{"kind":"arxiv","id":"1708.04162","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Almost Every $2r$-regular Graph has an Internal Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Linial, Sria Louis","submitted_at":"2017-08-14T14:57:30Z","abstract_excerpt":"An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every $2r$-regular graph has an internal partition."},"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":"1708.04162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-14T14:57:30Z","cross_cats_sorted":[],"title_canon_sha256":"e3dc358a7bead4b8bfeccf297d7163a6f72bd1e676cb2456a24cc7613a502e15","abstract_canon_sha256":"1fc6a021508491034fc28d064dbdcb37752e25a51c8f5235a3748330c46b2582"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:57.272356Z","signature_b64":"2S0XQ1k47U49XwNFPfIGTDO6v54KfJegsVkhVXGpJ4w5PEGGXkm+XuDvGLwxZXPz8SH8uavW7E8EFo0Fu42UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9553be2ad9037cedf238d3e328494aeb86add71e31491b283bf41c6c69ae811","last_reissued_at":"2026-05-18T00:37:57.271715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:57.271715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Almost Every $2r$-regular Graph has an Internal Partition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Linial, Sria Louis","submitted_at":"2017-08-14T14:57:30Z","abstract_excerpt":"An internal partition of a graph is a partitioning of the vertex set into two parts such that for every vertex, at least half of its neighbors are on its side. We prove that for every positive integer $r$, asymptotically almost every $2r$-regular graph has an internal partition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04162","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.04162","created_at":"2026-05-18T00:37:57.271842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04162v2","created_at":"2026-05-18T00:37:57.271842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04162","created_at":"2026-05-18T00:37:57.271842+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FKTXYVNSA34","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FKTXYVNSA345XZD","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FKTXYVN","created_at":"2026-05-18T12:30:58.224056+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/3FKTXYVNSA345XZDRU7DFBEUV2","json":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2.json","graph_json":"https://pith.science/api/pith-number/3FKTXYVNSA345XZDRU7DFBEUV2/graph.json","events_json":"https://pith.science/api/pith-number/3FKTXYVNSA345XZDRU7DFBEUV2/events.json","paper":"https://pith.science/paper/3FKTXYVN"},"agent_actions":{"view_html":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2","download_json":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2.json","view_paper":"https://pith.science/paper/3FKTXYVN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04162&json=true","fetch_graph":"https://pith.science/api/pith-number/3FKTXYVNSA345XZDRU7DFBEUV2/graph.json","fetch_events":"https://pith.science/api/pith-number/3FKTXYVNSA345XZDRU7DFBEUV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2/action/storage_attestation","attest_author":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2/action/author_attestation","sign_citation":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2/action/citation_signature","submit_replication":"https://pith.science/pith/3FKTXYVNSA345XZDRU7DFBEUV2/action/replication_record"}},"created_at":"2026-05-18T00:37:57.271842+00:00","updated_at":"2026-05-18T00:37:57.271842+00:00"}