{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FRQKDJSSQCB4AW2PC6J2YKXSVY","short_pith_number":"pith:FRQKDJSS","canonical_record":{"source":{"id":"2501.17610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-29T12:33:16Z","cross_cats_sorted":[],"title_canon_sha256":"385e5ecfb896e66c99eda104429d1459f175e4efcc106b7ae6508aecdd7a5dcf","abstract_canon_sha256":"a199c49b46c67c11319c3e2276ddfcbb960b5ed4a41515c59e9f12f650a5b856"},"schema_version":"1.0"},"canonical_sha256":"2c60a1a6528083c05b4f1793ac2af2ae3b8c0b082a5e2920c7c8fb575452c67f","source":{"kind":"arxiv","id":"2501.17610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17610","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17610v2","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17610","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"FRQKDJSSQCB4","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_16","alias_value":"FRQKDJSSQCB4AW2P","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_8","alias_value":"FRQKDJSS","created_at":"2026-07-05T10:41:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FRQKDJSSQCB4AW2PC6J2YKXSVY","target":"record","payload":{"canonical_record":{"source":{"id":"2501.17610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-29T12:33:16Z","cross_cats_sorted":[],"title_canon_sha256":"385e5ecfb896e66c99eda104429d1459f175e4efcc106b7ae6508aecdd7a5dcf","abstract_canon_sha256":"a199c49b46c67c11319c3e2276ddfcbb960b5ed4a41515c59e9f12f650a5b856"},"schema_version":"1.0"},"canonical_sha256":"2c60a1a6528083c05b4f1793ac2af2ae3b8c0b082a5e2920c7c8fb575452c67f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:41:52.128133Z","signature_b64":"pIGy+m16rMJqd0pli3x+vLFIQSUrXm2+Wc5PhcSPENJT3IBIGtVP0kRUA2DNUCpkudRAU7CoIM39NSLUvgZ/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c60a1a6528083c05b4f1793ac2af2ae3b8c0b082a5e2920c7c8fb575452c67f","last_reissued_at":"2026-07-05T10:41:52.127704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:41:52.127704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.17610","source_version":2,"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-05T10:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8cTRBbuBEA+Q95gzTdePtq+IV7PcJnNANVFukbjnjL4lMTrBFyocG7saQnBiKG4BlmvWk7ZtzpABdoOeUrfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:42:33.079236Z"},"content_sha256":"e0ad90642763d3d6b161ecfece049d6bfd700637e90801c64107cf11c9133f8a","schema_version":"1.0","event_id":"sha256:e0ad90642763d3d6b161ecfece049d6bfd700637e90801c64107cf11c9133f8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FRQKDJSSQCB4AW2PC6J2YKXSVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FeedSign: Robust Full-parameter Federated Fine-tuning of Large Models with Extremely Low Communication Overhead of One Bit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guangxu Zhu, Haolong Chen, Zhijie Cai","submitted_at":"2025-01-29T12:33:16Z","abstract_excerpt":"Federated fine-tuning (FFT) attempts to fine-tune a pre-trained model with private data from distributed clients by exchanging models rather than data under the orchestration of a parameter server (PS). To overcome the bottleneck forged by the growing communication and memory overhead for clients in such systems due to the growing model sizes, we propose \\textit{FeedSign}, an FFT algorithm in which the upload and download payload for an aggregation step is exactly $1$ bit per step, while the memory overhead is squeezed to the amount needed for inference. This is realized by utilizing zeroth-or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17610","kind":"arxiv","version":2},"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/2501.17610/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-05T10:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzmvexOhlvxVrIKDQeIZ4USFnVJvwSFwAgRRka5brauVG+ts0Zxjgs1EllccLtMLr5loSA8aS9RByecmxq3oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:42:33.079749Z"},"content_sha256":"fdb93ea57a3bdb554e2e05304764463de3c8cf079a182fc2103684d3a4b4e16f","schema_version":"1.0","event_id":"sha256:fdb93ea57a3bdb554e2e05304764463de3c8cf079a182fc2103684d3a4b4e16f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/bundle.json","state_url":"https://pith.science/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/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-08-04T07:42:33Z","links":{"resolver":"https://pith.science/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY","bundle":"https://pith.science/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/bundle.json","state":"https://pith.science/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRQKDJSSQCB4AW2PC6J2YKXSVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FRQKDJSSQCB4AW2PC6J2YKXSVY","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":"a199c49b46c67c11319c3e2276ddfcbb960b5ed4a41515c59e9f12f650a5b856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-29T12:33:16Z","title_canon_sha256":"385e5ecfb896e66c99eda104429d1459f175e4efcc106b7ae6508aecdd7a5dcf"},"schema_version":"1.0","source":{"id":"2501.17610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.17610","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"2501.17610v2","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17610","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"FRQKDJSSQCB4","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_16","alias_value":"FRQKDJSSQCB4AW2P","created_at":"2026-07-05T10:41:52Z"},{"alias_kind":"pith_short_8","alias_value":"FRQKDJSS","created_at":"2026-07-05T10:41:52Z"}],"graph_snapshots":[{"event_id":"sha256:fdb93ea57a3bdb554e2e05304764463de3c8cf079a182fc2103684d3a4b4e16f","target":"graph","created_at":"2026-07-05T10:41:52Z","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/2501.17610/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Federated fine-tuning (FFT) attempts to fine-tune a pre-trained model with private data from distributed clients by exchanging models rather than data under the orchestration of a parameter server (PS). To overcome the bottleneck forged by the growing communication and memory overhead for clients in such systems due to the growing model sizes, we propose \\textit{FeedSign}, an FFT algorithm in which the upload and download payload for an aggregation step is exactly $1$ bit per step, while the memory overhead is squeezed to the amount needed for inference. This is realized by utilizing zeroth-or","authors_text":"Guangxu Zhu, Haolong Chen, Zhijie Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-29T12:33:16Z","title":"FeedSign: Robust Full-parameter Federated Fine-tuning of Large Models with Extremely Low Communication Overhead of One Bit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17610","kind":"arxiv","version":2},"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:e0ad90642763d3d6b161ecfece049d6bfd700637e90801c64107cf11c9133f8a","target":"record","created_at":"2026-07-05T10:41:52Z","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":"a199c49b46c67c11319c3e2276ddfcbb960b5ed4a41515c59e9f12f650a5b856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-01-29T12:33:16Z","title_canon_sha256":"385e5ecfb896e66c99eda104429d1459f175e4efcc106b7ae6508aecdd7a5dcf"},"schema_version":"1.0","source":{"id":"2501.17610","kind":"arxiv","version":2}},"canonical_sha256":"2c60a1a6528083c05b4f1793ac2af2ae3b8c0b082a5e2920c7c8fb575452c67f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c60a1a6528083c05b4f1793ac2af2ae3b8c0b082a5e2920c7c8fb575452c67f","first_computed_at":"2026-07-05T10:41:52.127704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:41:52.127704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pIGy+m16rMJqd0pli3x+vLFIQSUrXm2+Wc5PhcSPENJT3IBIGtVP0kRUA2DNUCpkudRAU7CoIM39NSLUvgZ/Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:41:52.128133Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.17610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ad90642763d3d6b161ecfece049d6bfd700637e90801c64107cf11c9133f8a","sha256:fdb93ea57a3bdb554e2e05304764463de3c8cf079a182fc2103684d3a4b4e16f"],"state_sha256":"5a99ada496808ef95899f6b23c035c01e6026623744e3e800ea461bf654d69f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8BtEaiM07I2yQ6ANYunHx6dZJlwVbuUgdReQRXDumCYajfB0y2hng0L0Pt3ycMTJmUMeou3DxlkBnLsXqOiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:42:33.089651Z","bundle_sha256":"250d53fc74027c8a0f9b0d41544245c2a3afdce690510ea49c9e628f5b909c49"}}