{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3SEPQSOOPVUTDRFJ2ZMU6IKGJ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4619a9df17f9d217fee58ddc063e6dea22c33d69f8fe3f67a656825a7c7e8a0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-19T15:00:57Z","title_canon_sha256":"426b8b2cc58dc9618ceccbcd77a0cccff9758a4adda23f053839ac458037e967"},"schema_version":"1.0","source":{"id":"1307.5246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.5246","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"arxiv_version","alias_value":"1307.5246v1","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5246","created_at":"2026-05-18T03:18:05Z"},{"alias_kind":"pith_short_12","alias_value":"3SEPQSOOPVUT","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3SEPQSOOPVUTDRFJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3SEPQSOO","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:246e0d338f92ffb92f490be6420e42c6f17a792a414c7425c4727a8ea4b2ce6d","target":"graph","created_at":"2026-05-18T03:18:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Amir Ban, Nati Linial","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-19T15:00:57Z","title":"Internal Partitions of Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5246","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3fec36967775ed4015db52c9778c07ad131d41f096dbc1fb24f272d05768917a","target":"record","created_at":"2026-05-18T03:18:05Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4619a9df17f9d217fee58ddc063e6dea22c33d69f8fe3f67a656825a7c7e8a0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-19T15:00:57Z","title_canon_sha256":"426b8b2cc58dc9618ceccbcd77a0cccff9758a4adda23f053839ac458037e967"},"schema_version":"1.0","source":{"id":"1307.5246","kind":"arxiv","version":1}},"canonical_sha256":"dc88f849ce7d6931c4a9d6594f21464ee28b8ec35250e224420ea57e056385e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc88f849ce7d6931c4a9d6594f21464ee28b8ec35250e224420ea57e056385e8","first_computed_at":"2026-05-18T03:18:05.341688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:05.341688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P0GH1cnFzfErcvvmPjW8cD2fDCbefBm81s+tEMnawGmbBIrBHFV3LIwaKFj8lKtYpmABnMtLFkQHqA4x7a10CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:05.342422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.5246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fec36967775ed4015db52c9778c07ad131d41f096dbc1fb24f272d05768917a","sha256:246e0d338f92ffb92f490be6420e42c6f17a792a414c7425c4727a8ea4b2ce6d"],"state_sha256":"62980e259c4df407f4e5125d62e594fbad624572ed17dc51dd0827ecc745ba90"}