{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3SEPQSOOPVUTDRFJ2ZMU6IKGJ3","short_pith_number":"pith:3SEPQSOO","schema_version":"1.0","canonical_sha256":"dc88f849ce7d6931c4a9d6594f21464ee28b8ec35250e224420ea57e056385e8","source":{"kind":"arxiv","id":"1307.5246","version":1},"attestation_state":"computed","paper":{"title":"Internal Partitions of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Ban, Nati Linial","submitted_at":"2013-07-19T15:00:57Z","abstract_excerpt":"An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$ vertices has an internal partition. Here we prove this for $d=6$. The case $d=n-4$ is of particular interest and leads to interesting new open problems on cubic graphs. We also provide new lower bounds on $N(d)$ and find new families of graphs with no internal partitions. Weighted versions of these problems are considered as well."},"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":"1307.5246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-19T15:00:57Z","cross_cats_sorted":[],"title_canon_sha256":"426b8b2cc58dc9618ceccbcd77a0cccff9758a4adda23f053839ac458037e967","abstract_canon_sha256":"4619a9df17f9d217fee58ddc063e6dea22c33d69f8fe3f67a656825a7c7e8a0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:05.342422Z","signature_b64":"P0GH1cnFzfErcvvmPjW8cD2fDCbefBm81s+tEMnawGmbBIrBHFV3LIwaKFj8lKtYpmABnMtLFkQHqA4x7a10CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc88f849ce7d6931c4a9d6594f21464ee28b8ec35250e224420ea57e056385e8","last_reissued_at":"2026-05-18T03:18:05.341688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:05.341688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Internal Partitions of Regular Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Ban, Nati Linial","submitted_at":"2013-07-19T15:00:57Z","abstract_excerpt":"An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$ vertices has an internal partition. Here we prove this for $d=6$. The case $d=n-4$ is of particular interest and leads to interesting new open problems on cubic graphs. We also provide new lower bounds on $N(d)$ and find new families of graphs with no internal partitions. Weighted versions of these problems are considered as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5246","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":"1307.5246","created_at":"2026-05-18T03:18:05.341799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5246v1","created_at":"2026-05-18T03:18:05.341799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5246","created_at":"2026-05-18T03:18:05.341799+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SEPQSOOPVUT","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SEPQSOOPVUTDRFJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SEPQSOO","created_at":"2026-05-18T12:27:32.513160+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/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3","json":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3.json","graph_json":"https://pith.science/api/pith-number/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/graph.json","events_json":"https://pith.science/api/pith-number/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/events.json","paper":"https://pith.science/paper/3SEPQSOO"},"agent_actions":{"view_html":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3","download_json":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3.json","view_paper":"https://pith.science/paper/3SEPQSOO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5246&json=true","fetch_graph":"https://pith.science/api/pith-number/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/graph.json","fetch_events":"https://pith.science/api/pith-number/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/action/storage_attestation","attest_author":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/action/author_attestation","sign_citation":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/action/citation_signature","submit_replication":"https://pith.science/pith/3SEPQSOOPVUTDRFJ2ZMU6IKGJ3/action/replication_record"}},"created_at":"2026-05-18T03:18:05.341799+00:00","updated_at":"2026-05-18T03:18:05.341799+00:00"}