{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BCDL4YHLUDZDFTEVUY5R35VVY6","short_pith_number":"pith:BCDL4YHL","canonical_record":{"source":{"id":"1503.08396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-29T08:04:29Z","cross_cats_sorted":[],"title_canon_sha256":"fd5cd0d9fc90f6a8d205b198311af296d2b803f830ad96135c041e93efa409fa","abstract_canon_sha256":"0c0e63b9b8e00212a7c4eceaaf6a3084a9623b5a8cf6b718c2cd53934f394441"},"schema_version":"1.0"},"canonical_sha256":"0886be60eba0f232cc95a63b1df6b5c7b41f25809b90c276c4e07b68be09f7d4","source":{"kind":"arxiv","id":"1503.08396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08396","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08396v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08396","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"BCDL4YHLUDZD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCDL4YHLUDZDFTEV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCDL4YHL","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BCDL4YHLUDZDFTEVUY5R35VVY6","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-29T08:04:29Z","cross_cats_sorted":[],"title_canon_sha256":"fd5cd0d9fc90f6a8d205b198311af296d2b803f830ad96135c041e93efa409fa","abstract_canon_sha256":"0c0e63b9b8e00212a7c4eceaaf6a3084a9623b5a8cf6b718c2cd53934f394441"},"schema_version":"1.0"},"canonical_sha256":"0886be60eba0f232cc95a63b1df6b5c7b41f25809b90c276c4e07b68be09f7d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:01.916621Z","signature_b64":"XbRfkD+tmu6PGm+D0arf5w+nwk4y+M42Vx2dRB50RUS4tAB82rEKPIpVZ0VbPL5yreiOAXYTGLBsirpt6KTpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0886be60eba0f232cc95a63b1df6b5c7b41f25809b90c276c4e07b68be09f7d4","last_reissued_at":"2026-05-18T02:20:01.915985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:01.915985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08396","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-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OXKpNmrEWhEjOkEudfpJi5B6W7UWI26+K8xTSnf/3z2oaVLdZ5q5+zgZ/bVjh2+8nXdjmZo8tQWgM+8mfXarAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:20:56.711332Z"},"content_sha256":"6b1659658904eb908b351884e30f95d51d1912f523563139460164f31629ee56","schema_version":"1.0","event_id":"sha256:6b1659658904eb908b351884e30f95d51d1912f523563139460164f31629ee56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BCDL4YHLUDZDFTEVUY5R35VVY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Zimu Yuan","submitted_at":"2015-03-29T08:04:29Z","abstract_excerpt":"In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is worth to know how to construct paths to satisfy these flow demands with nodes placed as few as possible. In this paper, we study this flow demands oriented node placement problem that has not been addressed before. In particular, we divide and conquer the problem by three steps: calculating the maximal flow for single routing demand, calculating the maximal flow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08396","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-18T02:20:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laFSD3qOeplxSVPip0M9P8vPPX/LLNLpUjRqV45LMxSyWlbfxnTknvBMaL2nxcMhg85TYBLZc10Ufdccgx9sAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:20:56.711665Z"},"content_sha256":"d8c8c378b8fcbc2e72a3153d396492c28a1abcef4a53f9a8ee05829622c43d3d","schema_version":"1.0","event_id":"sha256:d8c8c378b8fcbc2e72a3153d396492c28a1abcef4a53f9a8ee05829622c43d3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/bundle.json","state_url":"https://pith.science/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/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-05T09:20:56Z","links":{"resolver":"https://pith.science/pith/BCDL4YHLUDZDFTEVUY5R35VVY6","bundle":"https://pith.science/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/bundle.json","state":"https://pith.science/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCDL4YHLUDZDFTEVUY5R35VVY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BCDL4YHLUDZDFTEVUY5R35VVY6","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":"0c0e63b9b8e00212a7c4eceaaf6a3084a9623b5a8cf6b718c2cd53934f394441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-29T08:04:29Z","title_canon_sha256":"fd5cd0d9fc90f6a8d205b198311af296d2b803f830ad96135c041e93efa409fa"},"schema_version":"1.0","source":{"id":"1503.08396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08396","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08396v1","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08396","created_at":"2026-05-18T02:20:01Z"},{"alias_kind":"pith_short_12","alias_value":"BCDL4YHLUDZD","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BCDL4YHLUDZDFTEV","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BCDL4YHL","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:d8c8c378b8fcbc2e72a3153d396492c28a1abcef4a53f9a8ee05829622c43d3d","target":"graph","created_at":"2026-05-18T02:20:01Z","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":"In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is worth to know how to construct paths to satisfy these flow demands with nodes placed as few as possible. In this paper, we study this flow demands oriented node placement problem that has not been addressed before. In particular, we divide and conquer the problem by three steps: calculating the maximal flow for single routing demand, calculating the maximal flow","authors_text":"Zimu Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-29T08:04:29Z","title":"Flow Demands Oriented Node Placement in Multi-Hop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08396","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:6b1659658904eb908b351884e30f95d51d1912f523563139460164f31629ee56","target":"record","created_at":"2026-05-18T02:20:01Z","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":"0c0e63b9b8e00212a7c4eceaaf6a3084a9623b5a8cf6b718c2cd53934f394441","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-03-29T08:04:29Z","title_canon_sha256":"fd5cd0d9fc90f6a8d205b198311af296d2b803f830ad96135c041e93efa409fa"},"schema_version":"1.0","source":{"id":"1503.08396","kind":"arxiv","version":1}},"canonical_sha256":"0886be60eba0f232cc95a63b1df6b5c7b41f25809b90c276c4e07b68be09f7d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0886be60eba0f232cc95a63b1df6b5c7b41f25809b90c276c4e07b68be09f7d4","first_computed_at":"2026-05-18T02:20:01.915985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:01.915985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbRfkD+tmu6PGm+D0arf5w+nwk4y+M42Vx2dRB50RUS4tAB82rEKPIpVZ0VbPL5yreiOAXYTGLBsirpt6KTpDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:01.916621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b1659658904eb908b351884e30f95d51d1912f523563139460164f31629ee56","sha256:d8c8c378b8fcbc2e72a3153d396492c28a1abcef4a53f9a8ee05829622c43d3d"],"state_sha256":"b68acb0aa1efdfcabae0db44a8abc4811ece7bc9779228991d57dc6ccc2de38f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s790V8fcBKkjeQj7XG0m37k+iBT9fAhw8HL1ISo/AbjElFoSLLI+gGvFtR5jTd26fKa6H8cK593UQi8JChysCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:20:56.713445Z","bundle_sha256":"b2350bb70ad4fc45e2f757f5ab39aefe203e5ed6a950205e6c2807440fa743c1"}}