{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D3X2OKO3K2EDIYAQ7L5TSKFKII","short_pith_number":"pith:D3X2OKO3","schema_version":"1.0","canonical_sha256":"1eefa729db5688346010fafb3928aa42395af6ca6c61be81dec0d247a1e12483","source":{"kind":"arxiv","id":"1201.3583","version":1},"attestation_state":"computed","paper":{"title":"Sharkovsky's Theorem and one-dimensional combinatorial dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Chris Bernhardt","submitted_at":"2012-01-17T18:18:19Z","abstract_excerpt":"A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an introduction to one-dimensional combinatorial dynamics."},"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":"1201.3583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2012-01-17T18:18:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b99921ff2db6e725d9d43b2ea2c2928b7dac25141e4955454a1d93d38b82d077","abstract_canon_sha256":"4d098177282715cab83e1f671da96e9653f54f34d7ab3622d99b5fbbb3789167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:28.866578Z","signature_b64":"CSdgw5Pcnbkk3WW2rYnBT/+lOrad6i8ppT5VNRLotix80qWesyKQh40/QUngDVOPW/QcR9xj+EoXFZsfdPByDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eefa729db5688346010fafb3928aa42395af6ca6c61be81dec0d247a1e12483","last_reissued_at":"2026-05-18T04:04:28.865813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:28.865813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharkovsky's Theorem and one-dimensional combinatorial dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Chris Bernhardt","submitted_at":"2012-01-17T18:18:19Z","abstract_excerpt":"A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an introduction to one-dimensional combinatorial dynamics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3583","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":"1201.3583","created_at":"2026-05-18T04:04:28.865904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3583v1","created_at":"2026-05-18T04:04:28.865904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3583","created_at":"2026-05-18T04:04:28.865904+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3X2OKO3K2ED","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3X2OKO3K2EDIYAQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3X2OKO3","created_at":"2026-05-18T12:27:01.376967+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/D3X2OKO3K2EDIYAQ7L5TSKFKII","json":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII.json","graph_json":"https://pith.science/api/pith-number/D3X2OKO3K2EDIYAQ7L5TSKFKII/graph.json","events_json":"https://pith.science/api/pith-number/D3X2OKO3K2EDIYAQ7L5TSKFKII/events.json","paper":"https://pith.science/paper/D3X2OKO3"},"agent_actions":{"view_html":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII","download_json":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII.json","view_paper":"https://pith.science/paper/D3X2OKO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3583&json=true","fetch_graph":"https://pith.science/api/pith-number/D3X2OKO3K2EDIYAQ7L5TSKFKII/graph.json","fetch_events":"https://pith.science/api/pith-number/D3X2OKO3K2EDIYAQ7L5TSKFKII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII/action/storage_attestation","attest_author":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII/action/author_attestation","sign_citation":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII/action/citation_signature","submit_replication":"https://pith.science/pith/D3X2OKO3K2EDIYAQ7L5TSKFKII/action/replication_record"}},"created_at":"2026-05-18T04:04:28.865904+00:00","updated_at":"2026-05-18T04:04:28.865904+00:00"}