{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4BITGB5HAYOU6QUSZSMWIJRTH2","short_pith_number":"pith:4BITGB5H","schema_version":"1.0","canonical_sha256":"e0513307a7061d4f4292cc996426333e99749b36827377371ea69f8d4d78a956","source":{"kind":"arxiv","id":"1312.0693","version":1},"attestation_state":"computed","paper":{"title":"Compositions, Partitions, and Fibonacci Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew V. Sills","submitted_at":"2013-12-03T04:20:33Z","abstract_excerpt":"A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.0693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T04:20:33Z","cross_cats_sorted":[],"title_canon_sha256":"54723c4a022f6c3bc3920e4cf25c95192e28510d09d7c3f37b48dfc6a87e9978","abstract_canon_sha256":"6a5235e8597d5618aaf2f6e21c80f80fed14a2f149944dac9bb75bdfe716ddfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.971207Z","signature_b64":"K6XQeP8+CEZVZbMYdvtsLru8aCa9NWV/iY25ki+k4I0aSHvtSZKE350A8Vh0cuTt7l40oFC0IjTeMbCfwD7BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0513307a7061d4f4292cc996426333e99749b36827377371ea69f8d4d78a956","last_reissued_at":"2026-05-18T03:05:36.970473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.970473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositions, Partitions, and Fibonacci Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew V. Sills","submitted_at":"2013-12-03T04:20:33Z","abstract_excerpt":"A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0693","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0693","created_at":"2026-05-18T03:05:36.970586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0693v1","created_at":"2026-05-18T03:05:36.970586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0693","created_at":"2026-05-18T03:05:36.970586+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BITGB5HAYOU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BITGB5HAYOU6QUS","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BITGB5H","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2","json":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2.json","graph_json":"https://pith.science/api/pith-number/4BITGB5HAYOU6QUSZSMWIJRTH2/graph.json","events_json":"https://pith.science/api/pith-number/4BITGB5HAYOU6QUSZSMWIJRTH2/events.json","paper":"https://pith.science/paper/4BITGB5H"},"agent_actions":{"view_html":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2","download_json":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2.json","view_paper":"https://pith.science/paper/4BITGB5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0693&json=true","fetch_graph":"https://pith.science/api/pith-number/4BITGB5HAYOU6QUSZSMWIJRTH2/graph.json","fetch_events":"https://pith.science/api/pith-number/4BITGB5HAYOU6QUSZSMWIJRTH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2/action/storage_attestation","attest_author":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2/action/author_attestation","sign_citation":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2/action/citation_signature","submit_replication":"https://pith.science/pith/4BITGB5HAYOU6QUSZSMWIJRTH2/action/replication_record"}},"created_at":"2026-05-18T03:05:36.970586+00:00","updated_at":"2026-05-18T03:05:36.970586+00:00"}