{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UHC43PB4PDVCNYWZ267J5GFFVI","short_pith_number":"pith:UHC43PB4","canonical_record":{"source":{"id":"1709.08274","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-09-24T22:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"ab41099aab265cdafc3a42d1c31245ea8f37e27e1adc4f497c1300b9496cbd3d","abstract_canon_sha256":"85042b3208013e2a3d5827d13161bed7d0c56c451775028e695ecc0e50fec14b"},"schema_version":"1.0"},"canonical_sha256":"a1c5cdbc3c78ea26e2d9d7be9e98a5aa3dc9a90d5585b17c9a95231f7da72e3e","source":{"kind":"arxiv","id":"1709.08274","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08274","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08274v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08274","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"UHC43PB4PDVC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHC43PB4PDVCNYWZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHC43PB4","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UHC43PB4PDVCNYWZ267J5GFFVI","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08274","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-09-24T22:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"ab41099aab265cdafc3a42d1c31245ea8f37e27e1adc4f497c1300b9496cbd3d","abstract_canon_sha256":"85042b3208013e2a3d5827d13161bed7d0c56c451775028e695ecc0e50fec14b"},"schema_version":"1.0"},"canonical_sha256":"a1c5cdbc3c78ea26e2d9d7be9e98a5aa3dc9a90d5585b17c9a95231f7da72e3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.242144Z","signature_b64":"sXfvb9P7r9PIMH4upeUjjZ51GCW9PrVTQvrMc4sqwLEGDEiS/7SDK//DCQoydsFfgbpHl9olJ5710i1rhQK4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1c5cdbc3c78ea26e2d9d7be9e98a5aa3dc9a90d5585b17c9a95231f7da72e3e","last_reissued_at":"2026-05-18T00:29:51.241673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.241673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08274","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-05-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxv37nO2Eg8uCEhw3Xjej9Gbk7arn83TcfvWyInh5cfd7VSXyn95oUDxazfg+7I1BgedLuN1mm2bVUuesTT0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:29.987355Z"},"content_sha256":"8f007616f50d48de8e42741d364c66d1220e59f7f3d3dc676652d97a7fef887b","schema_version":"1.0","event_id":"sha256:8f007616f50d48de8e42741d364c66d1220e59f7f3d3dc676652d97a7fef887b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UHC43PB4PDVCNYWZ267J5GFFVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Graph-Structured Sum-Product Networks for Probabilistic Semantic Maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andrzej Pronobis, Kaiyu Zheng, Rajesh P. N. Rao","submitted_at":"2017-09-24T22:24:02Z","abstract_excerpt":"We introduce Graph-Structured Sum-Product Networks (GraphSPNs), a probabilistic approach to structured prediction for problems where dependencies between latent variables are expressed in terms of arbitrary, dynamic graphs. While many approaches to structured prediction place strict constraints on the interactions between inferred variables, many real-world problems can be only characterized using complex graph structures of varying size, often contaminated with noise when obtained from real data. Here, we focus on one such problem in the domain of robotics. We demonstrate how GraphSPNs can be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08274","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":""},"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:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BORlsQfAxHkczNtcs2xaS6orFudneqnN4Gdc2tjRG0S3zonF9iKBvMsOwRuyvkiWwvberfMSWMSmVciGv4BeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:17:29.987705Z"},"content_sha256":"e73ab4e640bb82d20bbaf1fb5a0ccc356f346c01edb62922f1d5b3e95f37520b","schema_version":"1.0","event_id":"sha256:e73ab4e640bb82d20bbaf1fb5a0ccc356f346c01edb62922f1d5b3e95f37520b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHC43PB4PDVCNYWZ267J5GFFVI/bundle.json","state_url":"https://pith.science/pith/UHC43PB4PDVCNYWZ267J5GFFVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHC43PB4PDVCNYWZ267J5GFFVI/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-03T12:17:29Z","links":{"resolver":"https://pith.science/pith/UHC43PB4PDVCNYWZ267J5GFFVI","bundle":"https://pith.science/pith/UHC43PB4PDVCNYWZ267J5GFFVI/bundle.json","state":"https://pith.science/pith/UHC43PB4PDVCNYWZ267J5GFFVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHC43PB4PDVCNYWZ267J5GFFVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UHC43PB4PDVCNYWZ267J5GFFVI","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":"85042b3208013e2a3d5827d13161bed7d0c56c451775028e695ecc0e50fec14b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-09-24T22:24:02Z","title_canon_sha256":"ab41099aab265cdafc3a42d1c31245ea8f37e27e1adc4f497c1300b9496cbd3d"},"schema_version":"1.0","source":{"id":"1709.08274","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08274","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08274v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08274","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"UHC43PB4PDVC","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHC43PB4PDVCNYWZ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHC43PB4","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:e73ab4e640bb82d20bbaf1fb5a0ccc356f346c01edb62922f1d5b3e95f37520b","target":"graph","created_at":"2026-05-18T00:29:51Z","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 introduce Graph-Structured Sum-Product Networks (GraphSPNs), a probabilistic approach to structured prediction for problems where dependencies between latent variables are expressed in terms of arbitrary, dynamic graphs. While many approaches to structured prediction place strict constraints on the interactions between inferred variables, many real-world problems can be only characterized using complex graph structures of varying size, often contaminated with noise when obtained from real data. Here, we focus on one such problem in the domain of robotics. We demonstrate how GraphSPNs can be","authors_text":"Andrzej Pronobis, Kaiyu Zheng, Rajesh P. N. Rao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-09-24T22:24:02Z","title":"Learning Graph-Structured Sum-Product Networks for Probabilistic Semantic Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08274","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:8f007616f50d48de8e42741d364c66d1220e59f7f3d3dc676652d97a7fef887b","target":"record","created_at":"2026-05-18T00:29:51Z","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":"85042b3208013e2a3d5827d13161bed7d0c56c451775028e695ecc0e50fec14b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-09-24T22:24:02Z","title_canon_sha256":"ab41099aab265cdafc3a42d1c31245ea8f37e27e1adc4f497c1300b9496cbd3d"},"schema_version":"1.0","source":{"id":"1709.08274","kind":"arxiv","version":2}},"canonical_sha256":"a1c5cdbc3c78ea26e2d9d7be9e98a5aa3dc9a90d5585b17c9a95231f7da72e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1c5cdbc3c78ea26e2d9d7be9e98a5aa3dc9a90d5585b17c9a95231f7da72e3e","first_computed_at":"2026-05-18T00:29:51.241673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.241673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXfvb9P7r9PIMH4upeUjjZ51GCW9PrVTQvrMc4sqwLEGDEiS/7SDK//DCQoydsFfgbpHl9olJ5710i1rhQK4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.242144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08274","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f007616f50d48de8e42741d364c66d1220e59f7f3d3dc676652d97a7fef887b","sha256:e73ab4e640bb82d20bbaf1fb5a0ccc356f346c01edb62922f1d5b3e95f37520b"],"state_sha256":"5bf406857dbe0ea8eed6d4d035a9fb085c3b531f8c19f735d68cace81bc2f724"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqFS77fRYhMNBISLywt6ZX/lYSxsugIFa+FBHUzNkWe2C5AwzfMrlB/xkCeM6T7uXHipvOU8lKJSkaynCvEkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:17:29.989820Z","bundle_sha256":"0a48949351ca3a14ed227039116c30212c138d5df40b0240fd95a482519c533a"}}