{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PTSJF3AD66KDSE3LCWJ73FULDT","short_pith_number":"pith:PTSJF3AD","canonical_record":{"source":{"id":"1711.02696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T19:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"a5444be0f329e3f1c079e149be2eeaaa8c7e86e674f4aff2e998867682a89719","abstract_canon_sha256":"a06dce20dfb24c211d706871ada1c25dc8ce670da23f2c6607a08026f832e596"},"schema_version":"1.0"},"canonical_sha256":"7ce492ec03f79439136b1593fd968b1cf87f17813ff7ef105057c8770e4eaff6","source":{"kind":"arxiv","id":"1711.02696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02696","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02696v1","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02696","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"PTSJF3AD66KD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTSJF3AD66KDSE3L","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTSJF3AD","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PTSJF3AD66KDSE3LCWJ73FULDT","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T19:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"a5444be0f329e3f1c079e149be2eeaaa8c7e86e674f4aff2e998867682a89719","abstract_canon_sha256":"a06dce20dfb24c211d706871ada1c25dc8ce670da23f2c6607a08026f832e596"},"schema_version":"1.0"},"canonical_sha256":"7ce492ec03f79439136b1593fd968b1cf87f17813ff7ef105057c8770e4eaff6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:02.049792Z","signature_b64":"Ga7gUTLaVSX5GYxd/6wOA8dWGGA6c5/tTByaBLHXGIG4Phl4HVY/qyMSKy1PL/CFprlRsi3ZPaappsDpC9w9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ce492ec03f79439136b1593fd968b1cf87f17813ff7ef105057c8770e4eaff6","last_reissued_at":"2026-05-18T00:31:02.048996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:02.048996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02696","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:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/Rc+0kRK8tTHfVmv6D5kic4SOxek/z4cJhfMXmiy+cbNpk9Lm3Jb/JenFLnt5wQbh5GpFbL4nUlEaKuP92vDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:42:28.830345Z"},"content_sha256":"354cff1082c9c76185dafcbc007828bf9c59c8ad3064e5567c5935ef2772a49d","schema_version":"1.0","event_id":"sha256:354cff1082c9c76185dafcbc007828bf9c59c8ad3064e5567c5935ef2772a49d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PTSJF3AD66KDSE3LCWJ73FULDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Unit Acquisition Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Raleigh, Douglas B. West, Frederick Johnson, Paul S. Wenger","submitted_at":"2017-11-07T19:25:51Z","abstract_excerpt":"Let $G$ be a graph with nonnegative integer weights. A {\\it unit acquisition move} transfers one unit of weight from a vertex to a neighbor that has at least as much weight. The {\\it unit acquisition number} of a graph $G$, denoted $a_u(G)$, is the minimum size that the set of vertices with positive weight can be reduced to via successive unit acquisition moves when starting from the configuration in which every vertex has weight $1$.\n  For a graph $G$ with $n$ vertices and minimum degree $k$, we prove $a_u(G)\\le (n-1)/k$, with equality for complete graphs and $C_5$. Also $a_u(G)$ is at most t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02696","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:31:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsOYenTZarMxdbizoGPWjVa2/K7hA40mSHxUsgXCtNXAvAF3wmCLXLOeS1sdIBHMvgrHdeSEqW8kctDQu/2HAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:42:28.831014Z"},"content_sha256":"443d87e68ed30835769390b10fd929450580f86666cbe145e65b3ecc8d6baea7","schema_version":"1.0","event_id":"sha256:443d87e68ed30835769390b10fd929450580f86666cbe145e65b3ecc8d6baea7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTSJF3AD66KDSE3LCWJ73FULDT/bundle.json","state_url":"https://pith.science/pith/PTSJF3AD66KDSE3LCWJ73FULDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTSJF3AD66KDSE3LCWJ73FULDT/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-05-26T09:42:28Z","links":{"resolver":"https://pith.science/pith/PTSJF3AD66KDSE3LCWJ73FULDT","bundle":"https://pith.science/pith/PTSJF3AD66KDSE3LCWJ73FULDT/bundle.json","state":"https://pith.science/pith/PTSJF3AD66KDSE3LCWJ73FULDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTSJF3AD66KDSE3LCWJ73FULDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PTSJF3AD66KDSE3LCWJ73FULDT","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":"a06dce20dfb24c211d706871ada1c25dc8ce670da23f2c6607a08026f832e596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T19:25:51Z","title_canon_sha256":"a5444be0f329e3f1c079e149be2eeaaa8c7e86e674f4aff2e998867682a89719"},"schema_version":"1.0","source":{"id":"1711.02696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02696","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02696v1","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02696","created_at":"2026-05-18T00:31:02Z"},{"alias_kind":"pith_short_12","alias_value":"PTSJF3AD66KD","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTSJF3AD66KDSE3L","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTSJF3AD","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:443d87e68ed30835769390b10fd929450580f86666cbe145e65b3ecc8d6baea7","target":"graph","created_at":"2026-05-18T00:31:02Z","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":"Let $G$ be a graph with nonnegative integer weights. A {\\it unit acquisition move} transfers one unit of weight from a vertex to a neighbor that has at least as much weight. The {\\it unit acquisition number} of a graph $G$, denoted $a_u(G)$, is the minimum size that the set of vertices with positive weight can be reduced to via successive unit acquisition moves when starting from the configuration in which every vertex has weight $1$.\n  For a graph $G$ with $n$ vertices and minimum degree $k$, we prove $a_u(G)\\le (n-1)/k$, with equality for complete graphs and $C_5$. Also $a_u(G)$ is at most t","authors_text":"Anna Raleigh, Douglas B. West, Frederick Johnson, Paul S. Wenger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T19:25:51Z","title":"The Unit Acquisition Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02696","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:354cff1082c9c76185dafcbc007828bf9c59c8ad3064e5567c5935ef2772a49d","target":"record","created_at":"2026-05-18T00:31:02Z","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":"a06dce20dfb24c211d706871ada1c25dc8ce670da23f2c6607a08026f832e596","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-07T19:25:51Z","title_canon_sha256":"a5444be0f329e3f1c079e149be2eeaaa8c7e86e674f4aff2e998867682a89719"},"schema_version":"1.0","source":{"id":"1711.02696","kind":"arxiv","version":1}},"canonical_sha256":"7ce492ec03f79439136b1593fd968b1cf87f17813ff7ef105057c8770e4eaff6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ce492ec03f79439136b1593fd968b1cf87f17813ff7ef105057c8770e4eaff6","first_computed_at":"2026-05-18T00:31:02.048996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:02.048996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ga7gUTLaVSX5GYxd/6wOA8dWGGA6c5/tTByaBLHXGIG4Phl4HVY/qyMSKy1PL/CFprlRsi3ZPaappsDpC9w9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:02.049792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:354cff1082c9c76185dafcbc007828bf9c59c8ad3064e5567c5935ef2772a49d","sha256:443d87e68ed30835769390b10fd929450580f86666cbe145e65b3ecc8d6baea7"],"state_sha256":"284d80b78c16ac5a2059ddd9dd61edf5792cf2d974f2d4d8cc6a57949a67441d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxnK2CcwJt65Vy2b7eJlW2RWvo+QookFY1m4EXbbif9AURXc92LkGsnLS8vKS/UMt1ZUyN79xqv+75KTzuA+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:42:28.834268Z","bundle_sha256":"7efcb02553cbd170261831abcbb77fe69e7c1f3c5e594eb1f25afcc434f06116"}}