{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UKNIMXXSXUQEGT6HE7FFSQIPUL","short_pith_number":"pith:UKNIMXXS","canonical_record":{"source":{"id":"1505.06072","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T13:36:58Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"ec2197678185ea03db814977f87e171eee8f38931ecca45def2de494ffac235d","abstract_canon_sha256":"a24e025b9cd869dbc6e698ca4e459fa22b4bf573dab7468ad900ba439375b6d6"},"schema_version":"1.0"},"canonical_sha256":"a29a865ef2bd20434fc727ca59410fa2fbd820e0ed7069bf23ff3b43388cd0b5","source":{"kind":"arxiv","id":"1505.06072","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06072","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06072v4","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06072","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"UKNIMXXSXUQE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKNIMXXSXUQEGT6H","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKNIMXXS","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UKNIMXXSXUQEGT6HE7FFSQIPUL","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06072","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T13:36:58Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"ec2197678185ea03db814977f87e171eee8f38931ecca45def2de494ffac235d","abstract_canon_sha256":"a24e025b9cd869dbc6e698ca4e459fa22b4bf573dab7468ad900ba439375b6d6"},"schema_version":"1.0"},"canonical_sha256":"a29a865ef2bd20434fc727ca59410fa2fbd820e0ed7069bf23ff3b43388cd0b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:11.531636Z","signature_b64":"jr/UciPdicFwqGEm0XwR7SPNgU5vePdYrVjdkyjqMBjtr0iSjlNtaRM/KycYsLiHIBe6T5JG1b6NoKkDlgKwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a29a865ef2bd20434fc727ca59410fa2fbd820e0ed7069bf23ff3b43388cd0b5","last_reissued_at":"2026-05-17T23:46:11.531053Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:11.531053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06072","source_version":4,"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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cb0H+OJ9jkNw3S3IuBNZLs8kp8BQnYLYIiTFu3hmv2Ls0M9F+p9H4/L+kg9Rx5Swm8GLpNeeBGIahQ8sh58dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:42:04.887944Z"},"content_sha256":"d95d8e7cb9e0239e2ae396a56c35ad68dc97a2356ab3d3cf2023c36ec6d4574c","schema_version":"1.0","event_id":"sha256:d95d8e7cb9e0239e2ae396a56c35ad68dc97a2356ab3d3cf2023c36ec6d4574c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UKNIMXXSXUQEGT6HE7FFSQIPUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diffusion Methods for Classification with Pairwise Relationships","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.DS","authors_text":"Benar F. Svaiter, Pedro F. Felzenszwalb","submitted_at":"2015-05-22T13:36:58Z","abstract_excerpt":"We define two algorithms for propagating information in classification problems with pairwise relationships. The algorithms are based on contraction maps and are related to non-linear diffusion and random walks on graphs. The approach is also related to message passing algorithms, including belief propagation and mean field methods. The algorithms we describe are guaranteed to converge on graphs with arbitrary topology. Moreover they always converge to a unique fixed point, independent of initialization. We prove that the fixed points of the algorithms under consideration define lower-bounds o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06072","kind":"arxiv","version":4},"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-17T23:46:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhYLHDLBVD1RAB/BiWHyHmjbeqKmpfZ0kkLTEyBkqcviN5sfbB5lZj4zykc8CirO1rlzd1ofGM7cj31UoAsLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:42:04.888287Z"},"content_sha256":"3971131308392dbca5cb307a245c443adbb538429ff336254a37dc810f32e416","schema_version":"1.0","event_id":"sha256:3971131308392dbca5cb307a245c443adbb538429ff336254a37dc810f32e416"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/bundle.json","state_url":"https://pith.science/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/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-06-23T19:42:04Z","links":{"resolver":"https://pith.science/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL","bundle":"https://pith.science/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/bundle.json","state":"https://pith.science/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKNIMXXSXUQEGT6HE7FFSQIPUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UKNIMXXSXUQEGT6HE7FFSQIPUL","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":"a24e025b9cd869dbc6e698ca4e459fa22b4bf573dab7468ad900ba439375b6d6","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T13:36:58Z","title_canon_sha256":"ec2197678185ea03db814977f87e171eee8f38931ecca45def2de494ffac235d"},"schema_version":"1.0","source":{"id":"1505.06072","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06072","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06072v4","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06072","created_at":"2026-05-17T23:46:11Z"},{"alias_kind":"pith_short_12","alias_value":"UKNIMXXSXUQE","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKNIMXXSXUQEGT6H","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKNIMXXS","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:3971131308392dbca5cb307a245c443adbb538429ff336254a37dc810f32e416","target":"graph","created_at":"2026-05-17T23:46:11Z","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":"We define two algorithms for propagating information in classification problems with pairwise relationships. The algorithms are based on contraction maps and are related to non-linear diffusion and random walks on graphs. The approach is also related to message passing algorithms, including belief propagation and mean field methods. The algorithms we describe are guaranteed to converge on graphs with arbitrary topology. Moreover they always converge to a unique fixed point, independent of initialization. We prove that the fixed points of the algorithms under consideration define lower-bounds o","authors_text":"Benar F. Svaiter, Pedro F. Felzenszwalb","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T13:36:58Z","title":"Diffusion Methods for Classification with Pairwise Relationships"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06072","kind":"arxiv","version":4},"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:d95d8e7cb9e0239e2ae396a56c35ad68dc97a2356ab3d3cf2023c36ec6d4574c","target":"record","created_at":"2026-05-17T23:46:11Z","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":"a24e025b9cd869dbc6e698ca4e459fa22b4bf573dab7468ad900ba439375b6d6","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T13:36:58Z","title_canon_sha256":"ec2197678185ea03db814977f87e171eee8f38931ecca45def2de494ffac235d"},"schema_version":"1.0","source":{"id":"1505.06072","kind":"arxiv","version":4}},"canonical_sha256":"a29a865ef2bd20434fc727ca59410fa2fbd820e0ed7069bf23ff3b43388cd0b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a29a865ef2bd20434fc727ca59410fa2fbd820e0ed7069bf23ff3b43388cd0b5","first_computed_at":"2026-05-17T23:46:11.531053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:11.531053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jr/UciPdicFwqGEm0XwR7SPNgU5vePdYrVjdkyjqMBjtr0iSjlNtaRM/KycYsLiHIBe6T5JG1b6NoKkDlgKwAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:11.531636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06072","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d95d8e7cb9e0239e2ae396a56c35ad68dc97a2356ab3d3cf2023c36ec6d4574c","sha256:3971131308392dbca5cb307a245c443adbb538429ff336254a37dc810f32e416"],"state_sha256":"326537e0654e4a95d2c5df23a7369a51b2b3099088acc0cf83045af44f5686ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDJioEryjSQs0sZL3QxZumqlbe4xhluSz1s+7673vJpK3cmImAgKHjzQrn1QZSeHPQY/9eJk7K4klNwfChuHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:42:04.890198Z","bundle_sha256":"63c1a462119fc16d418865f9a38240bc35a7b1f9382b5b6a1b89ddccf4ebe18e"}}