{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2KRHOHQG4XKTJWUIWY2LYGVOGG","short_pith_number":"pith:2KRHOHQG","canonical_record":{"source":{"id":"1107.6014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-29T16:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a34e0cb39e0642789f61e398a55406c6327d3365bffd4f260ab4fd3c7b35d91","abstract_canon_sha256":"263e9c9f61880556029a2aa7ee39bc970c5b3f16e285993a6de60eba4b760185"},"schema_version":"1.0"},"canonical_sha256":"d2a2771e06e5d534da88b634bc1aae31bae47562f2394618feaa8ad8c3101493","source":{"kind":"arxiv","id":"1107.6014","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.6014","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.6014v1","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.6014","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"2KRHOHQG4XKT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2KRHOHQG4XKTJWUI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2KRHOHQG","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2KRHOHQG4XKTJWUIWY2LYGVOGG","target":"record","payload":{"canonical_record":{"source":{"id":"1107.6014","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-29T16:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"5a34e0cb39e0642789f61e398a55406c6327d3365bffd4f260ab4fd3c7b35d91","abstract_canon_sha256":"263e9c9f61880556029a2aa7ee39bc970c5b3f16e285993a6de60eba4b760185"},"schema_version":"1.0"},"canonical_sha256":"d2a2771e06e5d534da88b634bc1aae31bae47562f2394618feaa8ad8c3101493","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:40.027640Z","signature_b64":"4pL6JPf+yh0s0bmuE3l6LM7VZuih3IPzNQPqpaiyPOW//XTVrafoxOoVQUievbcdisWIQ7FTyErN/xEk7FLRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2a2771e06e5d534da88b634bc1aae31bae47562f2394618feaa8ad8c3101493","last_reissued_at":"2026-05-18T04:16:40.026848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:40.026848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.6014","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-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssCieN8STVuiRzxaRIM0cfizDudbauIl1P2QIRf4MNlOj8Lhn2vI3sksrkXCwIleW64PEJRoblpEn+T1nOW+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:00:41.099143Z"},"content_sha256":"3b2b1597fdfce9879a0e10de247e208a977a8c5bfc459b4af43e1c823a9e0a36","schema_version":"1.0","event_id":"sha256:3b2b1597fdfce9879a0e10de247e208a977a8c5bfc459b4af43e1c823a9e0a36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2KRHOHQG4XKTJWUIWY2LYGVOGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alain Cournier (MIS), Anissa Lamani (MIS), Franck Petit (LIP6), Swan Dubois (LIP6), Vincent Villain (MIS)","submitted_at":"2011-07-29T16:37:44Z","abstract_excerpt":"In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message %while using D buffers (where D refers to the diameter of the network) . The only solution that uses a constant number of buffers per link was introdu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.6014","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-18T04:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei/qodSqEuo5BqQIZV/tT5buoBuUN3QbRFJaoh7yV3KMJlyppqZLJYd5q8WvJlvvCg6/KvFaWa/rt1ENeSqyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:00:41.099549Z"},"content_sha256":"366dd70760f78c7c80ec554845ea50edc4a2b1b6bec26a28dd30d78249ca0429","schema_version":"1.0","event_id":"sha256:366dd70760f78c7c80ec554845ea50edc4a2b1b6bec26a28dd30d78249ca0429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/bundle.json","state_url":"https://pith.science/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/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-27T17:00:41Z","links":{"resolver":"https://pith.science/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG","bundle":"https://pith.science/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/bundle.json","state":"https://pith.science/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KRHOHQG4XKTJWUIWY2LYGVOGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2KRHOHQG4XKTJWUIWY2LYGVOGG","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":"263e9c9f61880556029a2aa7ee39bc970c5b3f16e285993a6de60eba4b760185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-29T16:37:44Z","title_canon_sha256":"5a34e0cb39e0642789f61e398a55406c6327d3365bffd4f260ab4fd3c7b35d91"},"schema_version":"1.0","source":{"id":"1107.6014","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.6014","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1107.6014v1","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.6014","created_at":"2026-05-18T04:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"2KRHOHQG4XKT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2KRHOHQG4XKTJWUI","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2KRHOHQG","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:366dd70760f78c7c80ec554845ea50edc4a2b1b6bec26a28dd30d78249ca0429","target":"graph","created_at":"2026-05-18T04:16:40Z","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 this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from the sender to the receiver to forward only one message %while using D buffers (where D refers to the diameter of the network) . The only solution that uses a constant number of buffers per link was introdu","authors_text":"Alain Cournier (MIS), Anissa Lamani (MIS), Franck Petit (LIP6), Swan Dubois (LIP6), Vincent Villain (MIS)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-29T16:37:44Z","title":"Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.6014","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:3b2b1597fdfce9879a0e10de247e208a977a8c5bfc459b4af43e1c823a9e0a36","target":"record","created_at":"2026-05-18T04:16:40Z","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":"263e9c9f61880556029a2aa7ee39bc970c5b3f16e285993a6de60eba4b760185","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-29T16:37:44Z","title_canon_sha256":"5a34e0cb39e0642789f61e398a55406c6327d3365bffd4f260ab4fd3c7b35d91"},"schema_version":"1.0","source":{"id":"1107.6014","kind":"arxiv","version":1}},"canonical_sha256":"d2a2771e06e5d534da88b634bc1aae31bae47562f2394618feaa8ad8c3101493","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2a2771e06e5d534da88b634bc1aae31bae47562f2394618feaa8ad8c3101493","first_computed_at":"2026-05-18T04:16:40.026848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:40.026848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4pL6JPf+yh0s0bmuE3l6LM7VZuih3IPzNQPqpaiyPOW//XTVrafoxOoVQUievbcdisWIQ7FTyErN/xEk7FLRDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:40.027640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.6014","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b2b1597fdfce9879a0e10de247e208a977a8c5bfc459b4af43e1c823a9e0a36","sha256:366dd70760f78c7c80ec554845ea50edc4a2b1b6bec26a28dd30d78249ca0429"],"state_sha256":"56d571f20858d178e4a66bbacb7de23d73706dd18bfc5aba575d76ecbf6bda53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8CQU1KehRVS6s+1HupbA+CE7/rFyJuqyStqvpUCF97UNu+oJb/cqOEZg4+8+Y7mrOBaIQ22j9agSx5vanCqCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:00:41.102899Z","bundle_sha256":"27ad8700b80b54621ab54e064997e78370dd2f472a642d7773b6de457e101d9d"}}