{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HIJJQOGBLBLMCLBRTHXDQT73YI","short_pith_number":"pith:HIJJQOGB","canonical_record":{"source":{"id":"1511.08467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2015-11-26T18:19:00Z","cross_cats_sorted":["math.AP","math.OC"],"title_canon_sha256":"c7acdbf420476135883c2d32c3d33183b31179b43b6a725e69cdddf137cc9f7d","abstract_canon_sha256":"87d1bca73f8c11f61dbe3a1a74c8250c6244424f6221e8035c33dcf5306a3fd6"},"schema_version":"1.0"},"canonical_sha256":"3a129838c15856c12c3199ee384ffbc213ced4ef9c5a4fc2576e2478a158491e","source":{"kind":"arxiv","id":"1511.08467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08467","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08467v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08467","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"HIJJQOGBLBLM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HIJJQOGBLBLMCLBR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HIJJQOGB","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HIJJQOGBLBLMCLBRTHXDQT73YI","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2015-11-26T18:19:00Z","cross_cats_sorted":["math.AP","math.OC"],"title_canon_sha256":"c7acdbf420476135883c2d32c3d33183b31179b43b6a725e69cdddf137cc9f7d","abstract_canon_sha256":"87d1bca73f8c11f61dbe3a1a74c8250c6244424f6221e8035c33dcf5306a3fd6"},"schema_version":"1.0"},"canonical_sha256":"3a129838c15856c12c3199ee384ffbc213ced4ef9c5a4fc2576e2478a158491e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.107361Z","signature_b64":"ayOdYB4k3k6FU7G8+1LqN2BHWbakGQ/El8XJbKfhOera6hTXtMb5kA4ZEo98JHNF6nVqLFdCSILwMOSR2wUDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a129838c15856c12c3199ee384ffbc213ced4ef9c5a4fc2576e2478a158491e","last_reissued_at":"2026-05-18T00:30:33.106894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.106894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08467","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZgsUC81JqWW1+xCad+l0dwpV9pcbSXb1f9vbWnpw0CtV0W9cgY8w5BcG8YtUrbk8gcZxOFzPzUuWjibZE0ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:08:44.528429Z"},"content_sha256":"c78e1ce7cc1235092c59a3f99d5d45d0a22f3befdc2136176bd562ebef89d8c4","schema_version":"1.0","event_id":"sha256:c78e1ce7cc1235092c59a3f99d5d45d0a22f3befdc2136176bd562ebef89d8c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HIJJQOGBLBLMCLBRTHXDQT73YI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal micropatterns in transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP","math.OC"],"primary_cat":"math.CA","authors_text":"Alessio Brancolini, Benedikt Wirth","submitted_at":"2015-11-26T18:19:00Z","abstract_excerpt":"We consider two variational models for transport networks, an urban planning and a branched transport model, in which the degree of network complexity and ramification is governed by a small parameter $\\varepsilon>0$. Smaller $\\varepsilon$ leads to finer ramification patterns, and we analyse how optimal network patterns in a particular geometry behave as $\\varepsilon\\to0$ by proving an energy scaling law. This entails providing constructions of near-optimal networks as well as proving that no other construction can do better.\n  The motivation of this analysis is twofold. On the one hand, it pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08467","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtFoH8wXMYEHWUzekEkUWyaWvZysNukOIPSos9fSydogVK804+sdQpdE+GFDY1v56y8+SF9bSUDhVvDI8QNMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:08:44.529080Z"},"content_sha256":"e4e28aca52a5262bbc019d596e9344e3bc608b285dbef02f3fa53c45bedd1992","schema_version":"1.0","event_id":"sha256:e4e28aca52a5262bbc019d596e9344e3bc608b285dbef02f3fa53c45bedd1992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/bundle.json","state_url":"https://pith.science/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/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-06-10T20:08:44Z","links":{"resolver":"https://pith.science/pith/HIJJQOGBLBLMCLBRTHXDQT73YI","bundle":"https://pith.science/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/bundle.json","state":"https://pith.science/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HIJJQOGBLBLMCLBRTHXDQT73YI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HIJJQOGBLBLMCLBRTHXDQT73YI","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":"87d1bca73f8c11f61dbe3a1a74c8250c6244424f6221e8035c33dcf5306a3fd6","cross_cats_sorted":["math.AP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2015-11-26T18:19:00Z","title_canon_sha256":"c7acdbf420476135883c2d32c3d33183b31179b43b6a725e69cdddf137cc9f7d"},"schema_version":"1.0","source":{"id":"1511.08467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08467","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08467v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08467","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"HIJJQOGBLBLM","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HIJJQOGBLBLMCLBR","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HIJJQOGB","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:e4e28aca52a5262bbc019d596e9344e3bc608b285dbef02f3fa53c45bedd1992","target":"graph","created_at":"2026-05-18T00:30:33Z","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":"We consider two variational models for transport networks, an urban planning and a branched transport model, in which the degree of network complexity and ramification is governed by a small parameter $\\varepsilon>0$. Smaller $\\varepsilon$ leads to finer ramification patterns, and we analyse how optimal network patterns in a particular geometry behave as $\\varepsilon\\to0$ by proving an energy scaling law. This entails providing constructions of near-optimal networks as well as proving that no other construction can do better.\n  The motivation of this analysis is twofold. On the one hand, it pr","authors_text":"Alessio Brancolini, Benedikt Wirth","cross_cats":["math.AP","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2015-11-26T18:19:00Z","title":"Optimal micropatterns in transport networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08467","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:c78e1ce7cc1235092c59a3f99d5d45d0a22f3befdc2136176bd562ebef89d8c4","target":"record","created_at":"2026-05-18T00:30:33Z","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":"87d1bca73f8c11f61dbe3a1a74c8250c6244424f6221e8035c33dcf5306a3fd6","cross_cats_sorted":["math.AP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2015-11-26T18:19:00Z","title_canon_sha256":"c7acdbf420476135883c2d32c3d33183b31179b43b6a725e69cdddf137cc9f7d"},"schema_version":"1.0","source":{"id":"1511.08467","kind":"arxiv","version":1}},"canonical_sha256":"3a129838c15856c12c3199ee384ffbc213ced4ef9c5a4fc2576e2478a158491e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a129838c15856c12c3199ee384ffbc213ced4ef9c5a4fc2576e2478a158491e","first_computed_at":"2026-05-18T00:30:33.106894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:33.106894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ayOdYB4k3k6FU7G8+1LqN2BHWbakGQ/El8XJbKfhOera6hTXtMb5kA4ZEo98JHNF6nVqLFdCSILwMOSR2wUDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:33.107361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c78e1ce7cc1235092c59a3f99d5d45d0a22f3befdc2136176bd562ebef89d8c4","sha256:e4e28aca52a5262bbc019d596e9344e3bc608b285dbef02f3fa53c45bedd1992"],"state_sha256":"2a202d81fbec155b235de6ee5d443b132839e6989f68734bd0ba4b9d067e29a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbebI6aYu0e3QeaqWBaxbkL2qZsy1nK77BNfR7H7rVEqPnuhjRM6ACeV8QmWmmQsKKGa1kOqns6XEuBuEPHJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:08:44.532106Z","bundle_sha256":"098d2bc8c8819d8956efcd1b7e2133137313bbc29137823126cef2153f54c067"}}