{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QZDWBT7HB6SNJYHAGCANTAXXF2","short_pith_number":"pith:QZDWBT7H","canonical_record":{"source":{"id":"1106.4997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T15:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"e3c11e5fa6f9ebaa0ea648dc18f2388a902dff3779a7937d3a943c4839004545","abstract_canon_sha256":"7d20c69a241321ad3491564459c1eaadcdf8b0b982f57ed52c29df782f5725e6"},"schema_version":"1.0"},"canonical_sha256":"864760cfe70fa4d4e0e03080d982f72eafe67e81fa53c15289c3c44dd70e5e1a","source":{"kind":"arxiv","id":"1106.4997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4997","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4997v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4997","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"QZDWBT7HB6SN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZDWBT7HB6SNJYHA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZDWBT7H","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QZDWBT7HB6SNJYHAGCANTAXXF2","target":"record","payload":{"canonical_record":{"source":{"id":"1106.4997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T15:33:43Z","cross_cats_sorted":[],"title_canon_sha256":"e3c11e5fa6f9ebaa0ea648dc18f2388a902dff3779a7937d3a943c4839004545","abstract_canon_sha256":"7d20c69a241321ad3491564459c1eaadcdf8b0b982f57ed52c29df782f5725e6"},"schema_version":"1.0"},"canonical_sha256":"864760cfe70fa4d4e0e03080d982f72eafe67e81fa53c15289c3c44dd70e5e1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:22.610077Z","signature_b64":"yx8ZYVu0SbqFPitF24jXyqgE51oG6dkeOvY7aaZ3tnh8p0Ah5V5Tn47KSs6hfWobBqLoomUVs4sSbgN9Jk4gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"864760cfe70fa4d4e0e03080d982f72eafe67e81fa53c15289c3c44dd70e5e1a","last_reissued_at":"2026-05-18T04:19:22.609692Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:22.609692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.4997","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z88FbjeFx2mGkNQJzqt06ZwFQa5aUvxOkepH6Wcz6JoagGSxRPrOLM8S4I/jV8SKM+EtPf9IDwYGxn7efr0EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:41:47.714689Z"},"content_sha256":"6788c6abf3ef96b5fc5bb50fd5d805e1fd3ecc17410d988324ae0a7d28155f40","schema_version":"1.0","event_id":"sha256:6788c6abf3ef96b5fc5bb50fd5d805e1fd3ecc17410d988324ae0a7d28155f40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QZDWBT7HB6SNJYHAGCANTAXXF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of hypercubic bipartitions of an integer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Geir Agnarsson","submitted_at":"2011-06-24T15:33:43Z","abstract_excerpt":"We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \\max(\\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs $(n_1,n_2)$ summing to $n$ that yield the maximum $f(n) = \\min(n_1,n_2) + f(n_1) + f(n_2)$. This new characterization allows us, for a given $n\\in\\nats$, to determine the number $h(n)$ of these bipartitions that yield the said maximum $f(n)$. We present recursive formulae for $h(n)$, a generating function $h(x)$, and an explicit formula for $h(n)$ in terms of a speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4997","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YJ9q4Lm1QChgJNnwwnja/ebAuGWnjbZgX+A2lafxOIUfqB50MvMxmh5xM2ap+IsK+e2GLQncX1ZI1c44sd2MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T02:41:47.715347Z"},"content_sha256":"63f17f5e8614b0ea66ea205ee642a15fe06840dd478b5a8b7772e5e871274acc","schema_version":"1.0","event_id":"sha256:63f17f5e8614b0ea66ea205ee642a15fe06840dd478b5a8b7772e5e871274acc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/bundle.json","state_url":"https://pith.science/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T02:41:47Z","links":{"resolver":"https://pith.science/pith/QZDWBT7HB6SNJYHAGCANTAXXF2","bundle":"https://pith.science/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/bundle.json","state":"https://pith.science/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZDWBT7HB6SNJYHAGCANTAXXF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QZDWBT7HB6SNJYHAGCANTAXXF2","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":"7d20c69a241321ad3491564459c1eaadcdf8b0b982f57ed52c29df782f5725e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T15:33:43Z","title_canon_sha256":"e3c11e5fa6f9ebaa0ea648dc18f2388a902dff3779a7937d3a943c4839004545"},"schema_version":"1.0","source":{"id":"1106.4997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.4997","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1106.4997v1","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.4997","created_at":"2026-05-18T04:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"QZDWBT7HB6SN","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZDWBT7HB6SNJYHA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZDWBT7H","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:63f17f5e8614b0ea66ea205ee642a15fe06840dd478b5a8b7772e5e871274acc","target":"graph","created_at":"2026-05-18T04:19:22Z","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":"We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \\max(\\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs $(n_1,n_2)$ summing to $n$ that yield the maximum $f(n) = \\min(n_1,n_2) + f(n_1) + f(n_2)$. This new characterization allows us, for a given $n\\in\\nats$, to determine the number $h(n)$ of these bipartitions that yield the said maximum $f(n)$. We present recursive formulae for $h(n)$, a generating function $h(x)$, and an explicit formula for $h(n)$ in terms of a speci","authors_text":"Geir Agnarsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T15:33:43Z","title":"On the number of hypercubic bipartitions of an integer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.4997","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:6788c6abf3ef96b5fc5bb50fd5d805e1fd3ecc17410d988324ae0a7d28155f40","target":"record","created_at":"2026-05-18T04:19:22Z","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":"7d20c69a241321ad3491564459c1eaadcdf8b0b982f57ed52c29df782f5725e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-24T15:33:43Z","title_canon_sha256":"e3c11e5fa6f9ebaa0ea648dc18f2388a902dff3779a7937d3a943c4839004545"},"schema_version":"1.0","source":{"id":"1106.4997","kind":"arxiv","version":1}},"canonical_sha256":"864760cfe70fa4d4e0e03080d982f72eafe67e81fa53c15289c3c44dd70e5e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"864760cfe70fa4d4e0e03080d982f72eafe67e81fa53c15289c3c44dd70e5e1a","first_computed_at":"2026-05-18T04:19:22.609692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:22.609692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yx8ZYVu0SbqFPitF24jXyqgE51oG6dkeOvY7aaZ3tnh8p0Ah5V5Tn47KSs6hfWobBqLoomUVs4sSbgN9Jk4gCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:22.610077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.4997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6788c6abf3ef96b5fc5bb50fd5d805e1fd3ecc17410d988324ae0a7d28155f40","sha256:63f17f5e8614b0ea66ea205ee642a15fe06840dd478b5a8b7772e5e871274acc"],"state_sha256":"b4b2a236e260c091a6c4a2d13a3ff56bd634cbc14f87cc0c66085dd5e4b6b75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbwGO/6n8U3G7OCtLiqcy2urOD14Q9iTRAaIp/8Q1VQsMCCvYBQeMjBAJFA27vcftLymYZKHAssHRs4x661hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T02:41:47.718639Z","bundle_sha256":"e8dafda3afa46b0471d9d8505ef6c40bd9240916aa59423b1c7195ba65bf104d"}}