{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4IELGUIEJJLUFIBBGKSD7IE7PX","short_pith_number":"pith:4IELGUIE","canonical_record":{"source":{"id":"1203.4302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T01:14:35Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"c8edb83d666f415b745fe115b4adb0c2943d82919f4830dd40b059f632f79c00","abstract_canon_sha256":"da816c4cfe05c4c21e4e8b7ba7c6db327f65518acee688c8182e69d53fbba747"},"schema_version":"1.0"},"canonical_sha256":"e208b351044a5742a02132a43fa09f7df3ba62b8d449c18be351f768f529e96e","source":{"kind":"arxiv","id":"1203.4302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4302","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4302v1","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4302","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"4IELGUIEJJLU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IELGUIEJJLUFIBB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IELGUIE","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4IELGUIEJJLUFIBBGKSD7IE7PX","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T01:14:35Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"c8edb83d666f415b745fe115b4adb0c2943d82919f4830dd40b059f632f79c00","abstract_canon_sha256":"da816c4cfe05c4c21e4e8b7ba7c6db327f65518acee688c8182e69d53fbba747"},"schema_version":"1.0"},"canonical_sha256":"e208b351044a5742a02132a43fa09f7df3ba62b8d449c18be351f768f529e96e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:39.446347Z","signature_b64":"tPd2HJb4vfV7ANOT3aAD87bIfrmydumcuK84VKAS5yKhfXBCZ0ewhcVWjbZUQ8LNzzgvo5GMOSjYH/TSNZU7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e208b351044a5742a02132a43fa09f7df3ba62b8d449c18be351f768f529e96e","last_reissued_at":"2026-05-18T03:59:39.445475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:39.445475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4302","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-18T03:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/d+vwUg9XStrAnUJ2KGqpQJjrY1s3z0s+fKxt2puqCrHwR/soeZrfuMxlIKniSC1UwoStnbp2dJMYLl74hjXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:47:56.216376Z"},"content_sha256":"44fa3ec5d5a1deec413e55a4786b2b0fa2b4524e9b6ee30a42f5cbebb6ed660e","schema_version":"1.0","event_id":"sha256:44fa3ec5d5a1deec413e55a4786b2b0fa2b4524e9b6ee30a42f5cbebb6ed660e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4IELGUIEJJLUFIBBGKSD7IE7PX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Overpartition Analogue of Bressoud's Theorem of Rogers-Ramanujan Type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Diane Y. H. Shi, Doris D. M. Sang, William Y. C. Chen","submitted_at":"2012-03-20T01:14:35Z","abstract_excerpt":"For $k\\geq i\\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then the total sum of the parts l and $l+1$ is congruent to $i-1$ modulo 2. Let $A_{k,i}(n)$ denote the number of partitions with parts not congruent to $i$, $2k-i$ and $2k$ modulo $2k$. Bressoud's theorem states that $A_{k,i}(n)=B_{k,i}(n)$. Corteel, Lovejoy, and Mallet found an overpartition analogue of Bressoud's theorem for $i=1$, that is, for partitions not co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4302","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-18T03:59:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnnxPhU7ZuabNwCEGaOfrfSbGeJgZRBid0672nl2vuolEN/3xzDthbwbUnZdSBwBWVR2tHCmZZWUDparEjiaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:47:56.216720Z"},"content_sha256":"73ea4275588793322211a2c7552757d2c39cbc8eb675f2d18f836a8dbe690431","schema_version":"1.0","event_id":"sha256:73ea4275588793322211a2c7552757d2c39cbc8eb675f2d18f836a8dbe690431"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/bundle.json","state_url":"https://pith.science/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/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-20T07:47:56Z","links":{"resolver":"https://pith.science/pith/4IELGUIEJJLUFIBBGKSD7IE7PX","bundle":"https://pith.science/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/bundle.json","state":"https://pith.science/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IELGUIEJJLUFIBBGKSD7IE7PX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4IELGUIEJJLUFIBBGKSD7IE7PX","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":"da816c4cfe05c4c21e4e8b7ba7c6db327f65518acee688c8182e69d53fbba747","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T01:14:35Z","title_canon_sha256":"c8edb83d666f415b745fe115b4adb0c2943d82919f4830dd40b059f632f79c00"},"schema_version":"1.0","source":{"id":"1203.4302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4302","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4302v1","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4302","created_at":"2026-05-18T03:59:39Z"},{"alias_kind":"pith_short_12","alias_value":"4IELGUIEJJLU","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4IELGUIEJJLUFIBB","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4IELGUIE","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:73ea4275588793322211a2c7552757d2c39cbc8eb675f2d18f836a8dbe690431","target":"graph","created_at":"2026-05-18T03:59:39Z","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":"For $k\\geq i\\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then the total sum of the parts l and $l+1$ is congruent to $i-1$ modulo 2. Let $A_{k,i}(n)$ denote the number of partitions with parts not congruent to $i$, $2k-i$ and $2k$ modulo $2k$. Bressoud's theorem states that $A_{k,i}(n)=B_{k,i}(n)$. Corteel, Lovejoy, and Mallet found an overpartition analogue of Bressoud's theorem for $i=1$, that is, for partitions not co","authors_text":"Diane Y. H. Shi, Doris D. M. Sang, William Y. C. Chen","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T01:14:35Z","title":"An Overpartition Analogue of Bressoud's Theorem of Rogers-Ramanujan Type"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4302","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:44fa3ec5d5a1deec413e55a4786b2b0fa2b4524e9b6ee30a42f5cbebb6ed660e","target":"record","created_at":"2026-05-18T03:59:39Z","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":"da816c4cfe05c4c21e4e8b7ba7c6db327f65518acee688c8182e69d53fbba747","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T01:14:35Z","title_canon_sha256":"c8edb83d666f415b745fe115b4adb0c2943d82919f4830dd40b059f632f79c00"},"schema_version":"1.0","source":{"id":"1203.4302","kind":"arxiv","version":1}},"canonical_sha256":"e208b351044a5742a02132a43fa09f7df3ba62b8d449c18be351f768f529e96e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e208b351044a5742a02132a43fa09f7df3ba62b8d449c18be351f768f529e96e","first_computed_at":"2026-05-18T03:59:39.445475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:39.445475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tPd2HJb4vfV7ANOT3aAD87bIfrmydumcuK84VKAS5yKhfXBCZ0ewhcVWjbZUQ8LNzzgvo5GMOSjYH/TSNZU7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:39.446347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44fa3ec5d5a1deec413e55a4786b2b0fa2b4524e9b6ee30a42f5cbebb6ed660e","sha256:73ea4275588793322211a2c7552757d2c39cbc8eb675f2d18f836a8dbe690431"],"state_sha256":"4743ed85e2b400d21d7f6605757173d98a4b3943f425eb3e46f6f9f2a8904eb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNGRUxfbZEyWW9nOEiH9yNcBVfhi9vXYMSRasKY/jAQmxLLEr9EuTuuRE19lnHWq/h13r3fMf3GrZ+yTyIUaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:47:56.218659Z","bundle_sha256":"943304edda139516ccb201ed77490a84a0933be9680c34dd4da4d685647b900d"}}