{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YXISNQP2AGUF2FJO6J2KKHCXTV","short_pith_number":"pith:YXISNQP2","canonical_record":{"source":{"id":"1406.5458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-06-20T16:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"70c7e6ec20a13cbd5a4bd5c98e640eb0023627d12b496f01f4214690df9b9a09","abstract_canon_sha256":"92c472cc3d2ba0a255381a94814dd04a6beea8a83d86f71bb7b0a0fbbb0990a8"},"schema_version":"1.0"},"canonical_sha256":"c5d126c1fa01a85d152ef274a51c579d6b24cb97124c2e1d32e773525a29cd87","source":{"kind":"arxiv","id":"1406.5458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5458","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5458v1","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5458","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"YXISNQP2AGUF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXISNQP2AGUF2FJO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXISNQP2","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YXISNQP2AGUF2FJO6J2KKHCXTV","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-06-20T16:40:18Z","cross_cats_sorted":[],"title_canon_sha256":"70c7e6ec20a13cbd5a4bd5c98e640eb0023627d12b496f01f4214690df9b9a09","abstract_canon_sha256":"92c472cc3d2ba0a255381a94814dd04a6beea8a83d86f71bb7b0a0fbbb0990a8"},"schema_version":"1.0"},"canonical_sha256":"c5d126c1fa01a85d152ef274a51c579d6b24cb97124c2e1d32e773525a29cd87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.035531Z","signature_b64":"TmRG07Q7AKJVswz23P+cs57G0I9cTOR1NxcugQDrlBjSIYUTuAj/jNga0XZy3G8tjSY+/pT4hk08R8VCS5f3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5d126c1fa01a85d152ef274a51c579d6b24cb97124c2e1d32e773525a29cd87","last_reissued_at":"2026-05-18T02:49:19.034793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.034793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5458","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-18T02:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWnzmsEbDUceug5W/n1pvI+q1mX6EUPnzDdnrPn55t3A325pcgTFyd/lUW4oTCkeAvoLBbWs9lN3N5fFOSHoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:16:19.826095Z"},"content_sha256":"fe750a3d3ce7c485987c1df4d36f4b366584a6b70c3d1b78e3a979cf368cc4e1","schema_version":"1.0","event_id":"sha256:fe750a3d3ce7c485987c1df4d36f4b366584a6b70c3d1b78e3a979cf368cc4e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YXISNQP2AGUF2FJO6J2KKHCXTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Another proof of two modulo 3 congruences and another SPT crank for the number of smallest parts in overpartitions with even smallest part","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chris Jennings-Shaffer","submitted_at":"2014-06-20T16:40:18Z","abstract_excerpt":"By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\\overline{\\mbox{spt}}_2(3n)\\equiv \\overline{\\mbox{spt}}_2(3n+1)\\equiv 0\\pmod{3}$. Here $\\overline{\\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5458","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-18T02:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"as1M5iTF6YrB9FmzxYq4wYtB9pzscdxu7uSnP+dEmnTX70Q8FYkAvdspfynioEilfoU3Lw4ZE0piphAHkhQDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:16:19.826448Z"},"content_sha256":"04c6c0ffc42060c307778b320ee74c5ccae610996a52337a3b89d1083aca485b","schema_version":"1.0","event_id":"sha256:04c6c0ffc42060c307778b320ee74c5ccae610996a52337a3b89d1083aca485b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/bundle.json","state_url":"https://pith.science/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/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-03T15:16:19Z","links":{"resolver":"https://pith.science/pith/YXISNQP2AGUF2FJO6J2KKHCXTV","bundle":"https://pith.science/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/bundle.json","state":"https://pith.science/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXISNQP2AGUF2FJO6J2KKHCXTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YXISNQP2AGUF2FJO6J2KKHCXTV","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":"92c472cc3d2ba0a255381a94814dd04a6beea8a83d86f71bb7b0a0fbbb0990a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-06-20T16:40:18Z","title_canon_sha256":"70c7e6ec20a13cbd5a4bd5c98e640eb0023627d12b496f01f4214690df9b9a09"},"schema_version":"1.0","source":{"id":"1406.5458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5458","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5458v1","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5458","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"YXISNQP2AGUF","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"YXISNQP2AGUF2FJO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"YXISNQP2","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:04c6c0ffc42060c307778b320ee74c5ccae610996a52337a3b89d1083aca485b","target":"graph","created_at":"2026-05-18T02:49:19Z","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":"By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\\overline{\\mbox{spt}}_2(3n)\\equiv \\overline{\\mbox{spt}}_2(3n+1)\\equiv 0\\pmod{3}$. Here $\\overline{\\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been ","authors_text":"Chris Jennings-Shaffer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-06-20T16:40:18Z","title":"Another proof of two modulo 3 congruences and another SPT crank for the number of smallest parts in overpartitions with even smallest part"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5458","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:fe750a3d3ce7c485987c1df4d36f4b366584a6b70c3d1b78e3a979cf368cc4e1","target":"record","created_at":"2026-05-18T02:49:19Z","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":"92c472cc3d2ba0a255381a94814dd04a6beea8a83d86f71bb7b0a0fbbb0990a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-06-20T16:40:18Z","title_canon_sha256":"70c7e6ec20a13cbd5a4bd5c98e640eb0023627d12b496f01f4214690df9b9a09"},"schema_version":"1.0","source":{"id":"1406.5458","kind":"arxiv","version":1}},"canonical_sha256":"c5d126c1fa01a85d152ef274a51c579d6b24cb97124c2e1d32e773525a29cd87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5d126c1fa01a85d152ef274a51c579d6b24cb97124c2e1d32e773525a29cd87","first_computed_at":"2026-05-18T02:49:19.034793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:19.034793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TmRG07Q7AKJVswz23P+cs57G0I9cTOR1NxcugQDrlBjSIYUTuAj/jNga0XZy3G8tjSY+/pT4hk08R8VCS5f3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:19.035531Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe750a3d3ce7c485987c1df4d36f4b366584a6b70c3d1b78e3a979cf368cc4e1","sha256:04c6c0ffc42060c307778b320ee74c5ccae610996a52337a3b89d1083aca485b"],"state_sha256":"675e33ecdaffb7509c79db8bf1d50103ade677044f567f3ae987129833cbb7ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vnpXrLmZJ5XmGJkWAzvGeh9qpLF3fDIjmrVkUG48SaqzYIDiFQ9Msa+uTnb/Xx8Cx9J5tGhsGOrRUufqgtEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:16:19.828396Z","bundle_sha256":"c28f1a64954c26805f56b0e85b61e2feafd416467c16c79b2c2c0d484d10ff6c"}}