{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WXNMCRHK4XEDUBDFWPWHTSHF7P","short_pith_number":"pith:WXNMCRHK","schema_version":"1.0","canonical_sha256":"b5dac144eae5c83a0465b3ec79c8e5fbe624329ec0ab0008a0cef078857043df","source":{"kind":"arxiv","id":"0908.3393","version":1},"attestation_state":"computed","paper":{"title":"Can one classify finite Postnikov pieces?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Jerome Scherer, Jesper M. Moller","submitted_at":"2009-08-24T09:24:21Z","abstract_excerpt":"We compare the classical approach of constructing finite Postnikov systems by k-invariants and the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though the computational difficulty of the global approach is equivalent to that of the classical one."},"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":"0908.3393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2009-08-24T09:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"cde0bdf6fc62f9f86a34e72e93f5e65fe7dfc76b15eb9baf78add3c447cf4b3b","abstract_canon_sha256":"aca58a5b3833d2f6c85f216b293f2e68211e5546545a42d9c17a6e429b80424f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:14.164060Z","signature_b64":"rCkClzwq5xwR2vfIAXZLqiDPyyNyCycCdkqAqkXBxk/oMbFbVQoSdWNcvS6n9xbokM3Lve1ajWeoM56kmVNnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5dac144eae5c83a0465b3ec79c8e5fbe624329ec0ab0008a0cef078857043df","last_reissued_at":"2026-05-18T03:59:14.163402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:14.163402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can one classify finite Postnikov pieces?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AT","authors_text":"Jerome Scherer, Jesper M. Moller","submitted_at":"2009-08-24T09:24:21Z","abstract_excerpt":"We compare the classical approach of constructing finite Postnikov systems by k-invariants and the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though the computational difficulty of the global approach is equivalent to that of the classical one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3393","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":"0908.3393","created_at":"2026-05-18T03:59:14.163485+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3393v1","created_at":"2026-05-18T03:59:14.163485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3393","created_at":"2026-05-18T03:59:14.163485+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXNMCRHK4XED","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXNMCRHK4XEDUBDF","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXNMCRHK","created_at":"2026-05-18T12:26:02.257875+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/WXNMCRHK4XEDUBDFWPWHTSHF7P","json":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P.json","graph_json":"https://pith.science/api/pith-number/WXNMCRHK4XEDUBDFWPWHTSHF7P/graph.json","events_json":"https://pith.science/api/pith-number/WXNMCRHK4XEDUBDFWPWHTSHF7P/events.json","paper":"https://pith.science/paper/WXNMCRHK"},"agent_actions":{"view_html":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P","download_json":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P.json","view_paper":"https://pith.science/paper/WXNMCRHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3393&json=true","fetch_graph":"https://pith.science/api/pith-number/WXNMCRHK4XEDUBDFWPWHTSHF7P/graph.json","fetch_events":"https://pith.science/api/pith-number/WXNMCRHK4XEDUBDFWPWHTSHF7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P/action/storage_attestation","attest_author":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P/action/author_attestation","sign_citation":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P/action/citation_signature","submit_replication":"https://pith.science/pith/WXNMCRHK4XEDUBDFWPWHTSHF7P/action/replication_record"}},"created_at":"2026-05-18T03:59:14.163485+00:00","updated_at":"2026-05-18T03:59:14.163485+00:00"}