{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SSLJXGLXXOHUA2UCCMDJQYFPL3","short_pith_number":"pith:SSLJXGLX","canonical_record":{"source":{"id":"1712.10072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T22:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"b54906fb671b2f4b8e81c92965b7b8df79a391b32e40e7ccf26d24b8433e884b","abstract_canon_sha256":"31d265ef28de2e1ed3b7d43e51cf6e38ed5fad58bb2b739b211b6d8b4feca007"},"schema_version":"1.0"},"canonical_sha256":"94969b9977bb8f406a8213069860af5eecfb3a1479bf00c9f112bc03840601b9","source":{"kind":"arxiv","id":"1712.10072","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10072","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10072v3","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10072","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"SSLJXGLXXOHU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SSLJXGLXXOHUA2UC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SSLJXGLX","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SSLJXGLXXOHUA2UCCMDJQYFPL3","target":"record","payload":{"canonical_record":{"source":{"id":"1712.10072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T22:31:43Z","cross_cats_sorted":[],"title_canon_sha256":"b54906fb671b2f4b8e81c92965b7b8df79a391b32e40e7ccf26d24b8433e884b","abstract_canon_sha256":"31d265ef28de2e1ed3b7d43e51cf6e38ed5fad58bb2b739b211b6d8b4feca007"},"schema_version":"1.0"},"canonical_sha256":"94969b9977bb8f406a8213069860af5eecfb3a1479bf00c9f112bc03840601b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:10.429655Z","signature_b64":"7Arc+N9bZidvAtej95Vny9WBmPye69HrLQsXBJlm/tsZYUwgC8MRG7yNEfvu+TbpkNQQuTV7kvyXaOptRG2TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94969b9977bb8f406a8213069860af5eecfb3a1479bf00c9f112bc03840601b9","last_reissued_at":"2026-05-18T00:22:10.429140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:10.429140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.10072","source_version":3,"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-18T00:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSo75Rdgqbpb5Dk26iGMVKHRkDsNlwfRP6DnXbctYf+C1MxhUqDHSBXWAeXPasGuKkZA81dmRqCIBs2fKoxWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:38:04.680937Z"},"content_sha256":"b1bfa2857124bf01ba29f3fb76fde7726f942776ecae75d1982e513af33c38f4","schema_version":"1.0","event_id":"sha256:b1bfa2857124bf01ba29f3fb76fde7726f942776ecae75d1982e513af33c38f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SSLJXGLXXOHUA2UCCMDJQYFPL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Zaleski, Doron Zeilberger","submitted_at":"2017-12-28T22:31:43Z","abstract_excerpt":"Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the Fibonacci number F_{n+2}), the enumeration of (n+1,n+2)-core partitions into odd parts remains elusive.\n  Straub computed the first eleven terms of that sequence, and asked for a \"formula,\" or at least a fast way, to compute many terms. While we are unable to find a \"fast\" algorithm, we did manage to find a \"faster\" algorithm, which enabled us to compute 23 terms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10072","kind":"arxiv","version":3},"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-18T00:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEphxacSLmeWOqMlbpR+uAyLpjJYHfENlxZs7DZhQnzO+zx6FqUnnE4oI3n5o2pTQkghmhBII7YUtiVzuYh5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:38:04.681644Z"},"content_sha256":"f9fd6aef9205e9f4cdcf4e6ad5649a4fca553cd73c0218025a281d6d3c970580","schema_version":"1.0","event_id":"sha256:f9fd6aef9205e9f4cdcf4e6ad5649a4fca553cd73c0218025a281d6d3c970580"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/bundle.json","state_url":"https://pith.science/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/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-06-08T01:38:04Z","links":{"resolver":"https://pith.science/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3","bundle":"https://pith.science/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/bundle.json","state":"https://pith.science/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSLJXGLXXOHUA2UCCMDJQYFPL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SSLJXGLXXOHUA2UCCMDJQYFPL3","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":"31d265ef28de2e1ed3b7d43e51cf6e38ed5fad58bb2b739b211b6d8b4feca007","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T22:31:43Z","title_canon_sha256":"b54906fb671b2f4b8e81c92965b7b8df79a391b32e40e7ccf26d24b8433e884b"},"schema_version":"1.0","source":{"id":"1712.10072","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10072","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10072v3","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10072","created_at":"2026-05-18T00:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"SSLJXGLXXOHU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SSLJXGLXXOHUA2UC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SSLJXGLX","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:f9fd6aef9205e9f4cdcf4e6ad5649a4fca553cd73c0218025a281d6d3c970580","target":"graph","created_at":"2026-05-18T00:22:10Z","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":"Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the Fibonacci number F_{n+2}), the enumeration of (n+1,n+2)-core partitions into odd parts remains elusive.\n  Straub computed the first eleven terms of that sequence, and asked for a \"formula,\" or at least a fast way, to compute many terms. While we are unable to find a \"fast\" algorithm, we did manage to find a \"faster\" algorithm, which enabled us to compute 23 terms ","authors_text":"Anthony Zaleski, Doron Zeilberger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T22:31:43Z","title":"On the Intriguing Problem of Counting (n+1,n+2)-Core Partitions into Odd Parts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10072","kind":"arxiv","version":3},"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:b1bfa2857124bf01ba29f3fb76fde7726f942776ecae75d1982e513af33c38f4","target":"record","created_at":"2026-05-18T00:22:10Z","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":"31d265ef28de2e1ed3b7d43e51cf6e38ed5fad58bb2b739b211b6d8b4feca007","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-28T22:31:43Z","title_canon_sha256":"b54906fb671b2f4b8e81c92965b7b8df79a391b32e40e7ccf26d24b8433e884b"},"schema_version":"1.0","source":{"id":"1712.10072","kind":"arxiv","version":3}},"canonical_sha256":"94969b9977bb8f406a8213069860af5eecfb3a1479bf00c9f112bc03840601b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94969b9977bb8f406a8213069860af5eecfb3a1479bf00c9f112bc03840601b9","first_computed_at":"2026-05-18T00:22:10.429140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:10.429140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Arc+N9bZidvAtej95Vny9WBmPye69HrLQsXBJlm/tsZYUwgC8MRG7yNEfvu+TbpkNQQuTV7kvyXaOptRG2TAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:10.429655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10072","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1bfa2857124bf01ba29f3fb76fde7726f942776ecae75d1982e513af33c38f4","sha256:f9fd6aef9205e9f4cdcf4e6ad5649a4fca553cd73c0218025a281d6d3c970580"],"state_sha256":"cb61ca0bfef98b35206b9f63ff34a52569c07379823c986e7a2bacd67ae0c230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pD/kb30iKPdKPooFYMN7iLoqrdTvlxqXKrcavFADhgKE3ZJtXhauz+2RhC6PWTql9WgMQpDnadmAVyxzsZKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:38:04.685507Z","bundle_sha256":"bffc96ac2ab1ea9e0e11d0bf0c7717b014b6615439cce1d6d9ffac883757d979"}}