{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SFEAIOLPCVE3DVGH35LEKJGVQV","short_pith_number":"pith:SFEAIOLP","canonical_record":{"source":{"id":"1706.01814","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-06T15:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"b8254c8f3e3c9c110739ad87d96c3fc59f862a3f7c2aa8028c8d45ebe08c26b1","abstract_canon_sha256":"c7ba8a3275e7166fd8ac3796404c8f9b56dc63a5cb8e490d884fe1983c004d9c"},"schema_version":"1.0"},"canonical_sha256":"914804396f1549b1d4c7df564524d58569f3c882171d201aa3d09e1dd670d018","source":{"kind":"arxiv","id":"1706.01814","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01814","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01814v3","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01814","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"SFEAIOLPCVE3","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_16","alias_value":"SFEAIOLPCVE3DVGH","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_8","alias_value":"SFEAIOLP","created_at":"2026-07-05T04:32:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SFEAIOLPCVE3DVGH35LEKJGVQV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01814","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-06T15:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"b8254c8f3e3c9c110739ad87d96c3fc59f862a3f7c2aa8028c8d45ebe08c26b1","abstract_canon_sha256":"c7ba8a3275e7166fd8ac3796404c8f9b56dc63a5cb8e490d884fe1983c004d9c"},"schema_version":"1.0"},"canonical_sha256":"914804396f1549b1d4c7df564524d58569f3c882171d201aa3d09e1dd670d018","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:45.580984Z","signature_b64":"7dxcY715LM5SLHGBf00BHq0F9LfRAdlozz3rYhwNC2bqdQTqqUULKoRaqvR9L18Lm7omZCkVZy4LoP1mVrPlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"914804396f1549b1d4c7df564524d58569f3c882171d201aa3d09e1dd670d018","last_reissued_at":"2026-07-05T04:32:45.580580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:45.580580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01814","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-07-05T04:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RqnoSST9eBY0UJgsxMrYm4aEPsolBI1RYJ24gaCmXc+zgvjDoWRyUD6nmWDrIxsGqYRv3D69Cu4866B/fNMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:44:43.580177Z"},"content_sha256":"82b2d4729fb8da859ff2c53ffeb8b3a078b0a8e33339b01c6a92b621f3163f14","schema_version":"1.0","event_id":"sha256:82b2d4729fb8da859ff2c53ffeb8b3a078b0a8e33339b01c6a92b621f3163f14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SFEAIOLPCVE3DVGH35LEKJGVQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Effective Bounds for the Andrews spt-function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Madeline Locus Dawsey, Riad Masri","submitted_at":"2017-06-06T15:16:25Z","abstract_excerpt":"In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which involve the partition function $p(n)$ and $\\mathrm{spt}(n)$. Further, we strengthen one of the conjectures, and prove that for every $\\epsilon>0$ there is an effectively computable constant $N(\\epsilon) > 0$ such that for all $n\\geq N(\\epsilon)$, we have \\begin{equation*} \\frac{\\sqrt{6}}{\\pi}\\sqrt{n}\\,p(n)<\\mathrm{spt}(n)<\\left(\\frac{\\sqrt{6}}{\\pi}+\\epsilon\\rig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01814","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1706.01814/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxuIQ6AjOR9lu8qN9lFaBUrwdmXCghRHQsZQ6/n1sJlsnw/EBql58M0AbKIW1Z/mjGh+OS0L+hxL8QAWTC+QBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T17:44:43.580573Z"},"content_sha256":"ee30a9afea54c00b7b36a5074b3ff65cdc4df3799722138fb259dfa026d3f761","schema_version":"1.0","event_id":"sha256:ee30a9afea54c00b7b36a5074b3ff65cdc4df3799722138fb259dfa026d3f761"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/bundle.json","state_url":"https://pith.science/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/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-11T17:44:43Z","links":{"resolver":"https://pith.science/pith/SFEAIOLPCVE3DVGH35LEKJGVQV","bundle":"https://pith.science/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/bundle.json","state":"https://pith.science/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SFEAIOLPCVE3DVGH35LEKJGVQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SFEAIOLPCVE3DVGH35LEKJGVQV","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":"c7ba8a3275e7166fd8ac3796404c8f9b56dc63a5cb8e490d884fe1983c004d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-06T15:16:25Z","title_canon_sha256":"b8254c8f3e3c9c110739ad87d96c3fc59f862a3f7c2aa8028c8d45ebe08c26b1"},"schema_version":"1.0","source":{"id":"1706.01814","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01814","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01814v3","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01814","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"SFEAIOLPCVE3","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_16","alias_value":"SFEAIOLPCVE3DVGH","created_at":"2026-07-05T04:32:45Z"},{"alias_kind":"pith_short_8","alias_value":"SFEAIOLP","created_at":"2026-07-05T04:32:45Z"}],"graph_snapshots":[{"event_id":"sha256:ee30a9afea54c00b7b36a5074b3ff65cdc4df3799722138fb259dfa026d3f761","target":"graph","created_at":"2026-07-05T04:32:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1706.01814/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we establish an asymptotic formula with an effective bound on the error term for the Andrews smallest parts function $\\mathrm{spt}(n)$. We use this formula to prove recent conjectures of Chen concerning inequalities which involve the partition function $p(n)$ and $\\mathrm{spt}(n)$. Further, we strengthen one of the conjectures, and prove that for every $\\epsilon>0$ there is an effectively computable constant $N(\\epsilon) > 0$ such that for all $n\\geq N(\\epsilon)$, we have \\begin{equation*} \\frac{\\sqrt{6}}{\\pi}\\sqrt{n}\\,p(n)<\\mathrm{spt}(n)<\\left(\\frac{\\sqrt{6}}{\\pi}+\\epsilon\\rig","authors_text":"Madeline Locus Dawsey, Riad Masri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-06T15:16:25Z","title":"Effective Bounds for the Andrews spt-function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01814","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:82b2d4729fb8da859ff2c53ffeb8b3a078b0a8e33339b01c6a92b621f3163f14","target":"record","created_at":"2026-07-05T04:32:45Z","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":"c7ba8a3275e7166fd8ac3796404c8f9b56dc63a5cb8e490d884fe1983c004d9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-06-06T15:16:25Z","title_canon_sha256":"b8254c8f3e3c9c110739ad87d96c3fc59f862a3f7c2aa8028c8d45ebe08c26b1"},"schema_version":"1.0","source":{"id":"1706.01814","kind":"arxiv","version":3}},"canonical_sha256":"914804396f1549b1d4c7df564524d58569f3c882171d201aa3d09e1dd670d018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"914804396f1549b1d4c7df564524d58569f3c882171d201aa3d09e1dd670d018","first_computed_at":"2026-07-05T04:32:45.580580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:32:45.580580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dxcY715LM5SLHGBf00BHq0F9LfRAdlozz3rYhwNC2bqdQTqqUULKoRaqvR9L18Lm7omZCkVZy4LoP1mVrPlCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:32:45.580984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01814","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82b2d4729fb8da859ff2c53ffeb8b3a078b0a8e33339b01c6a92b621f3163f14","sha256:ee30a9afea54c00b7b36a5074b3ff65cdc4df3799722138fb259dfa026d3f761"],"state_sha256":"2a7bb0b7b938720e7a54d7ea1c2c5d738946a231cd641284b97000d0c310bb63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3dEvdZR1KibOptwdqAa/z5Q3VrjbkzOIziM6Uc+KTXbGGsbB060d4a6Sm5Bn3NXDSdy15z19uakSmnKfw8xBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T17:44:43.582680Z","bundle_sha256":"57a54850aaf12ceaf3df9a8f4007b8ba42b6b8f2bccf617d36c0b4a9a3bd361b"}}