{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5G2ZPM6BEBAJI3GHWZZZISAWFD","short_pith_number":"pith:5G2ZPM6B","canonical_record":{"source":{"id":"1903.00181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2019-03-01T07:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"f4becea752a5445297128dd5542262622bca162f1191111c3c429ed2ec9c3c6b","abstract_canon_sha256":"f00affc3c7e1630c242a623a576bf74924f55d6dd67394a46daca35d973f5ac4"},"schema_version":"1.0"},"canonical_sha256":"e9b597b3c12040946cc7b67394481628c1c394b4355d192d3fe52048b3afe4ae","source":{"kind":"arxiv","id":"1903.00181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00181","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00181v1","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00181","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"5G2ZPM6BEBAJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5G2ZPM6BEBAJI3GH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5G2ZPM6B","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5G2ZPM6BEBAJI3GHWZZZISAWFD","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2019-03-01T07:31:16Z","cross_cats_sorted":[],"title_canon_sha256":"f4becea752a5445297128dd5542262622bca162f1191111c3c429ed2ec9c3c6b","abstract_canon_sha256":"f00affc3c7e1630c242a623a576bf74924f55d6dd67394a46daca35d973f5ac4"},"schema_version":"1.0"},"canonical_sha256":"e9b597b3c12040946cc7b67394481628c1c394b4355d192d3fe52048b3afe4ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:45.116785Z","signature_b64":"8cD0wiJGsUVzac2yjkcuVkng1yzK/aLHx91we+wva6m+kOK95i4zs1JCk/+PKxk6MjYRhWnc5BeSv005/YvYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9b597b3c12040946cc7b67394481628c1c394b4355d192d3fe52048b3afe4ae","last_reissued_at":"2026-05-17T23:39:45.116125Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:45.116125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00181","source_version":1,"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-05-17T23:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLPybkmr+9SaJl9Z1BziLX3HIxJ6Riwyza3Qt5gIvrPaIYTegDPYtKRQTwS5/Q1O/B6COHh19rtM+9SYJQl1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:36:35.616449Z"},"content_sha256":"f3f93bbd5257e678398d41a3afd5bea92428b4c483527105980a47b9b8c12463","schema_version":"1.0","event_id":"sha256:f3f93bbd5257e678398d41a3afd5bea92428b4c483527105980a47b9b8c12463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5G2ZPM6BEBAJI3GHWZZZISAWFD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Growth of a tree with allocations rules: Part 1 Kinematics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"nlin.AO","authors_text":"Olivier Bui (CPT), Xavier Leoncini (CPT)","submitted_at":"2019-03-01T07:31:16Z","abstract_excerpt":"A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some general results are given on the viability tree-like networks that produce an amount of resource based on its amount of leaves while having a maintenance cost for each node. Some analytical studies and numerical surveys of the model in \"simple\" situations are made. The different outcomes are discussed and possible extensions of the model are then discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00181","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"},"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-05-17T23:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TBLevFV20rZj5xbH5OGr+rhYf9WfQZznlXBihEr1MIflEi8vl7SLT1zCrSESDfrx9khWVad5vo0yqW+hB7quCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:36:35.616790Z"},"content_sha256":"3b556fa508a27deed8c52aed8aeeaea79145ad2466111f42257e9184822c7487","schema_version":"1.0","event_id":"sha256:3b556fa508a27deed8c52aed8aeeaea79145ad2466111f42257e9184822c7487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/bundle.json","state_url":"https://pith.science/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/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-03T02:36:35Z","links":{"resolver":"https://pith.science/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD","bundle":"https://pith.science/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/bundle.json","state":"https://pith.science/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5G2ZPM6BEBAJI3GHWZZZISAWFD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5G2ZPM6BEBAJI3GHWZZZISAWFD","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":"f00affc3c7e1630c242a623a576bf74924f55d6dd67394a46daca35d973f5ac4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2019-03-01T07:31:16Z","title_canon_sha256":"f4becea752a5445297128dd5542262622bca162f1191111c3c429ed2ec9c3c6b"},"schema_version":"1.0","source":{"id":"1903.00181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00181","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00181v1","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00181","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"5G2ZPM6BEBAJ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5G2ZPM6BEBAJI3GH","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5G2ZPM6B","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3b556fa508a27deed8c52aed8aeeaea79145ad2466111f42257e9184822c7487","target":"graph","created_at":"2026-05-17T23:39: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"},"paper":{"abstract_excerpt":"A non-local model describing the growth of a tree-like transportation network with given allocation rules is proposed. In this model we focus on tree like networks, and the network transports the very resource it needs to build itself. Some general results are given on the viability tree-like networks that produce an amount of resource based on its amount of leaves while having a maintenance cost for each node. Some analytical studies and numerical surveys of the model in \"simple\" situations are made. The different outcomes are discussed and possible extensions of the model are then discussed.","authors_text":"Olivier Bui (CPT), Xavier Leoncini (CPT)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2019-03-01T07:31:16Z","title":"Growth of a tree with allocations rules: Part 1 Kinematics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00181","kind":"arxiv","version":1},"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:f3f93bbd5257e678398d41a3afd5bea92428b4c483527105980a47b9b8c12463","target":"record","created_at":"2026-05-17T23:39: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":"f00affc3c7e1630c242a623a576bf74924f55d6dd67394a46daca35d973f5ac4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2019-03-01T07:31:16Z","title_canon_sha256":"f4becea752a5445297128dd5542262622bca162f1191111c3c429ed2ec9c3c6b"},"schema_version":"1.0","source":{"id":"1903.00181","kind":"arxiv","version":1}},"canonical_sha256":"e9b597b3c12040946cc7b67394481628c1c394b4355d192d3fe52048b3afe4ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9b597b3c12040946cc7b67394481628c1c394b4355d192d3fe52048b3afe4ae","first_computed_at":"2026-05-17T23:39:45.116125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:45.116125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8cD0wiJGsUVzac2yjkcuVkng1yzK/aLHx91we+wva6m+kOK95i4zs1JCk/+PKxk6MjYRhWnc5BeSv005/YvYCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:45.116785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3f93bbd5257e678398d41a3afd5bea92428b4c483527105980a47b9b8c12463","sha256:3b556fa508a27deed8c52aed8aeeaea79145ad2466111f42257e9184822c7487"],"state_sha256":"24e09119ef2026d6feea5c754b488cfae664ea2125fa7b3d09492fe7f004c3f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqGnLZKrEjIJzXZj6CAbClPPupHPXdxDAdiA96gZ0OlhveF4Ys/8E1137kLA7h1QjdBfCpCYmJv003ttbWphDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T02:36:35.618681Z","bundle_sha256":"a32df9a24bda79a7ebff1afbb4dfa1264ece19e5e7126f8630dddb8746617be8"}}