{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O6ANDQYABT6LGGCCYP2O7HHWGP","short_pith_number":"pith:O6ANDQYA","canonical_record":{"source":{"id":"1103.0571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-02T22:02:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a84e974383c5258d333f26be8e67e4551f1f0ce3ba2632dee48caf04bb81a0c","abstract_canon_sha256":"f32639868c8b5ca63bf53901129cd5998fae8122dfadf34c618c245b7ccfeee6"},"schema_version":"1.0"},"canonical_sha256":"7780d1c3000cfcb31842c3f4ef9cf633d61774f6d46010a9682fcfeaf351e57f","source":{"kind":"arxiv","id":"1103.0571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0571","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0571v1","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0571","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"O6ANDQYABT6L","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_16","alias_value":"O6ANDQYABT6LGGCC","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_8","alias_value":"O6ANDQYA","created_at":"2026-07-05T03:10:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O6ANDQYABT6LGGCCYP2O7HHWGP","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0571","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-02T22:02:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7a84e974383c5258d333f26be8e67e4551f1f0ce3ba2632dee48caf04bb81a0c","abstract_canon_sha256":"f32639868c8b5ca63bf53901129cd5998fae8122dfadf34c618c245b7ccfeee6"},"schema_version":"1.0"},"canonical_sha256":"7780d1c3000cfcb31842c3f4ef9cf633d61774f6d46010a9682fcfeaf351e57f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:35.799653Z","signature_b64":"v6QRDhv2MuKjk407zirUaDaM7N1JyMWPtApdxy0Fh1rgwr0YMzKLfvPFOjNOD/ho4l9JmUJtWAhIdnLpvj3wBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7780d1c3000cfcb31842c3f4ef9cf633d61774f6d46010a9682fcfeaf351e57f","last_reissued_at":"2026-07-05T03:10:35.799171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:35.799171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0571","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-07-05T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oeh0hmoND0kWv48dBA+WqPoBEfVKkId1NjOKG6pUZPfgEAiJzVLbhWI+gXb+cof0I3P0U3VX+3SVRFqB6ODuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:25.251617Z"},"content_sha256":"5ac6d08c779ef5b483903fd30619afb922986feec97c240af5045030de00df5b","schema_version":"1.0","event_id":"sha256:5ac6d08c779ef5b483903fd30619afb922986feec97c240af5045030de00df5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O6ANDQYABT6LGGCCYP2O7HHWGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Ramified Optimal Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Qinglan Xia, Shaofeng Xu","submitted_at":"2011-03-02T22:02:19Z","abstract_excerpt":"This paper proposes an optimal allocation problem with ramified transport technology in a spatial economy. Ramified transportation is used to model the transport economy of scale in group transportation observed widely in both nature and efficiently designed transport systems of branching structures. The ramified allocation problem aims at finding an optimal allocation plan as well as an associated optimal allocation path to minimize overall cost of transporting commodity from factories to households. This problem differentiates itself from existing ramified transportation literature in that t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0571","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1103.0571/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hpWAb/6mqph2ENm/pOWFQu5J7Gkp0uueBTAXCJULsJwkTH4T9HM5XU0uOQ0JEnFtNHq2XZ4UkzbmvkhyiC9lCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:25.251988Z"},"content_sha256":"84e735c08430c2e0698d3a8faff60b1301b446b018b21fbb94b06f56033d629d","schema_version":"1.0","event_id":"sha256:84e735c08430c2e0698d3a8faff60b1301b446b018b21fbb94b06f56033d629d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/bundle.json","state_url":"https://pith.science/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/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-06T13:49:25Z","links":{"resolver":"https://pith.science/pith/O6ANDQYABT6LGGCCYP2O7HHWGP","bundle":"https://pith.science/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/bundle.json","state":"https://pith.science/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6ANDQYABT6LGGCCYP2O7HHWGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O6ANDQYABT6LGGCCYP2O7HHWGP","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":"f32639868c8b5ca63bf53901129cd5998fae8122dfadf34c618c245b7ccfeee6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-02T22:02:19Z","title_canon_sha256":"7a84e974383c5258d333f26be8e67e4551f1f0ce3ba2632dee48caf04bb81a0c"},"schema_version":"1.0","source":{"id":"1103.0571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0571","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0571v1","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0571","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"O6ANDQYABT6L","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_16","alias_value":"O6ANDQYABT6LGGCC","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_8","alias_value":"O6ANDQYA","created_at":"2026-07-05T03:10:35Z"}],"graph_snapshots":[{"event_id":"sha256:84e735c08430c2e0698d3a8faff60b1301b446b018b21fbb94b06f56033d629d","target":"graph","created_at":"2026-07-05T03:10:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1103.0571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes an optimal allocation problem with ramified transport technology in a spatial economy. Ramified transportation is used to model the transport economy of scale in group transportation observed widely in both nature and efficiently designed transport systems of branching structures. The ramified allocation problem aims at finding an optimal allocation plan as well as an associated optimal allocation path to minimize overall cost of transporting commodity from factories to households. This problem differentiates itself from existing ramified transportation literature in that t","authors_text":"Qinglan Xia, Shaofeng Xu","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-02T22:02:19Z","title":"On the Ramified Optimal Allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0571","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:5ac6d08c779ef5b483903fd30619afb922986feec97c240af5045030de00df5b","target":"record","created_at":"2026-07-05T03:10:35Z","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":"f32639868c8b5ca63bf53901129cd5998fae8122dfadf34c618c245b7ccfeee6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-02T22:02:19Z","title_canon_sha256":"7a84e974383c5258d333f26be8e67e4551f1f0ce3ba2632dee48caf04bb81a0c"},"schema_version":"1.0","source":{"id":"1103.0571","kind":"arxiv","version":1}},"canonical_sha256":"7780d1c3000cfcb31842c3f4ef9cf633d61774f6d46010a9682fcfeaf351e57f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7780d1c3000cfcb31842c3f4ef9cf633d61774f6d46010a9682fcfeaf351e57f","first_computed_at":"2026-07-05T03:10:35.799171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:10:35.799171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v6QRDhv2MuKjk407zirUaDaM7N1JyMWPtApdxy0Fh1rgwr0YMzKLfvPFOjNOD/ho4l9JmUJtWAhIdnLpvj3wBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:10:35.799653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ac6d08c779ef5b483903fd30619afb922986feec97c240af5045030de00df5b","sha256:84e735c08430c2e0698d3a8faff60b1301b446b018b21fbb94b06f56033d629d"],"state_sha256":"10075310322dd20b4dd73e84ca513507c9c211e6ee4296aaff0980f7b0276e18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajPPty8XLPDgA0dxzJ5CqWdoCKQuWQxItc0Ygop5RZz1vE8LbiyYYpTmJD1Zmc6zkBZ02wqB5pNyJk3HTpXzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:49:25.253986Z","bundle_sha256":"a126173c7b6c8497790e9925f5de34f2f1dcd26d83cef5533a5ed6e2797b6f87"}}