{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HEH3TDHNEVKGNTF73UBEK3DCIL","short_pith_number":"pith:HEH3TDHN","schema_version":"1.0","canonical_sha256":"390fb98ced255466ccbfdd02456c6242ca9a1ff13cb5817ff3d48166bc3dadae","source":{"kind":"arxiv","id":"1402.5893","version":1},"attestation_state":"computed","paper":{"title":"Compound orbits break-up in constituents: an algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"A. Gonz\\'alez G\\'omez, Daniel Rodr\\'iguez-P\\'erez, Jes\\'us San Mart\\'in, Ma Jos\\'e Moscoso","submitted_at":"2014-02-24T17:08:52Z","abstract_excerpt":"In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient conditions for the break-up of compound orbits in their simpler constituents. A corollary to this theorem provides an algorithm for the computation of those orbits. This process closes the theoretical framework initiated in (Physica D, 239:1135--1146, 2010)."},"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":"1402.5893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.CD","submitted_at":"2014-02-24T17:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"717dfcf71604115671eeafc8dd653b1e2dfae9968a8d1b90066917286083c236","abstract_canon_sha256":"5232f2e37fb35f235f0b1cabff2c6e3d04d960a6606055f906f4bc834bf5ec7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:12.940039Z","signature_b64":"8xhJGSNcpgn4cCjSTmTTKAz7yWvfkW/9IT+7DbDIbvFD+oqBo1UcnUt+Pkd7VrPYKbQJ/dV5F05xtRfnYcFeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"390fb98ced255466ccbfdd02456c6242ca9a1ff13cb5817ff3d48166bc3dadae","last_reissued_at":"2026-05-18T02:58:12.939221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:12.939221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compound orbits break-up in constituents: an algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.CD","authors_text":"A. Gonz\\'alez G\\'omez, Daniel Rodr\\'iguez-P\\'erez, Jes\\'us San Mart\\'in, Ma Jos\\'e Moscoso","submitted_at":"2014-02-24T17:08:52Z","abstract_excerpt":"In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient conditions for the break-up of compound orbits in their simpler constituents. A corollary to this theorem provides an algorithm for the computation of those orbits. This process closes the theoretical framework initiated in (Physica D, 239:1135--1146, 2010)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5893","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":"1402.5893","created_at":"2026-05-18T02:58:12.939343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5893v1","created_at":"2026-05-18T02:58:12.939343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5893","created_at":"2026-05-18T02:58:12.939343+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEH3TDHNEVKG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEH3TDHNEVKGNTF7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEH3TDHN","created_at":"2026-05-18T12:28:30.664211+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/HEH3TDHNEVKGNTF73UBEK3DCIL","json":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL.json","graph_json":"https://pith.science/api/pith-number/HEH3TDHNEVKGNTF73UBEK3DCIL/graph.json","events_json":"https://pith.science/api/pith-number/HEH3TDHNEVKGNTF73UBEK3DCIL/events.json","paper":"https://pith.science/paper/HEH3TDHN"},"agent_actions":{"view_html":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL","download_json":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL.json","view_paper":"https://pith.science/paper/HEH3TDHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5893&json=true","fetch_graph":"https://pith.science/api/pith-number/HEH3TDHNEVKGNTF73UBEK3DCIL/graph.json","fetch_events":"https://pith.science/api/pith-number/HEH3TDHNEVKGNTF73UBEK3DCIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL/action/storage_attestation","attest_author":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL/action/author_attestation","sign_citation":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL/action/citation_signature","submit_replication":"https://pith.science/pith/HEH3TDHNEVKGNTF73UBEK3DCIL/action/replication_record"}},"created_at":"2026-05-18T02:58:12.939343+00:00","updated_at":"2026-05-18T02:58:12.939343+00:00"}