{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JXDULYKHTURO6PNHYXR43YNODQ","short_pith_number":"pith:JXDULYKH","canonical_record":{"source":{"id":"1301.6916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-29T13:13:02Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c443bb601d6d7a91e3baa08cb48b7cedc14b157a7321479474f3f33b2aaff286","abstract_canon_sha256":"315d1664f7a0805198d72bf749e7f71f92127e4617a7dc4104ff1b2f0781be24"},"schema_version":"1.0"},"canonical_sha256":"4dc745e1479d22ef3da7c5e3cde1ae1c0108eace324bf14c6028ff543ae18bc5","source":{"kind":"arxiv","id":"1301.6916","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6916","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6916v1","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6916","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"JXDULYKHTURO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JXDULYKHTURO6PNH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JXDULYKH","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JXDULYKHTURO6PNHYXR43YNODQ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-29T13:13:02Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"c443bb601d6d7a91e3baa08cb48b7cedc14b157a7321479474f3f33b2aaff286","abstract_canon_sha256":"315d1664f7a0805198d72bf749e7f71f92127e4617a7dc4104ff1b2f0781be24"},"schema_version":"1.0"},"canonical_sha256":"4dc745e1479d22ef3da7c5e3cde1ae1c0108eace324bf14c6028ff543ae18bc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:11.924709Z","signature_b64":"Jik61zON/es0jMaBHbhD5QtZLzcYZlx8XqxxHK6z4FMh/q3RSy/IxaSvQhZxUvqd+iZxl6KGNq8eBtFkUWoQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dc745e1479d22ef3da7c5e3cde1ae1c0108eace324bf14c6028ff543ae18bc5","last_reissued_at":"2026-05-18T03:35:11.923943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:11.923943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6916","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-18T03:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xbv4W8ZG1MqZ3KA0YtQFl6EviB4vMTkjAEU8yBd+aJFuXwiDaAvwdor47MogcJonx0kFPDwPwkkk697cAI+3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:01:10.887219Z"},"content_sha256":"c63324878857180ab212913ab30b5401347bb168e15d61aa5abc2d6417e14a5d","schema_version":"1.0","event_id":"sha256:c63324878857180ab212913ab30b5401347bb168e15d61aa5abc2d6417e14a5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JXDULYKHTURO6PNHYXR43YNODQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing a Graph from Path Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Michael Rabbat, Vincent Gripon","submitted_at":"2013-01-29T13:13:02Z","abstract_excerpt":"This paper considers the problem of inferring the structure of a network from indirect observations. Each observation (a \"trace\") is the unordered set of nodes which are activated along a path through the network. Since a trace does not convey information about the order of nodes within the path, there are many feasible orders for each trace observed, and thus the problem of inferring the network from traces is, in general, illposed. We propose and analyze an algorithm which inserts edges by ordering each trace into a path according to which pairs of nodes in the path co-occur most frequently "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6916","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-18T03:35:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmjMkEFDDIbhzW6tkJ8dvJ1zMS4hgxArjjRfjh0sQnoKkDjqP5SwvFQ6txsHskCcjqeifcG9oRC3v8BYsP+/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T01:01:10.887602Z"},"content_sha256":"4d6d120024c55703024fd5b3c3238c4da8f2dc3095dfa1a80cfe5f1528c152e4","schema_version":"1.0","event_id":"sha256:4d6d120024c55703024fd5b3c3238c4da8f2dc3095dfa1a80cfe5f1528c152e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXDULYKHTURO6PNHYXR43YNODQ/bundle.json","state_url":"https://pith.science/pith/JXDULYKHTURO6PNHYXR43YNODQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXDULYKHTURO6PNHYXR43YNODQ/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-25T01:01:10Z","links":{"resolver":"https://pith.science/pith/JXDULYKHTURO6PNHYXR43YNODQ","bundle":"https://pith.science/pith/JXDULYKHTURO6PNHYXR43YNODQ/bundle.json","state":"https://pith.science/pith/JXDULYKHTURO6PNHYXR43YNODQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXDULYKHTURO6PNHYXR43YNODQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JXDULYKHTURO6PNHYXR43YNODQ","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":"315d1664f7a0805198d72bf749e7f71f92127e4617a7dc4104ff1b2f0781be24","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-29T13:13:02Z","title_canon_sha256":"c443bb601d6d7a91e3baa08cb48b7cedc14b157a7321479474f3f33b2aaff286"},"schema_version":"1.0","source":{"id":"1301.6916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6916","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6916v1","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6916","created_at":"2026-05-18T03:35:11Z"},{"alias_kind":"pith_short_12","alias_value":"JXDULYKHTURO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JXDULYKHTURO6PNH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JXDULYKH","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:4d6d120024c55703024fd5b3c3238c4da8f2dc3095dfa1a80cfe5f1528c152e4","target":"graph","created_at":"2026-05-18T03:35: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":"This paper considers the problem of inferring the structure of a network from indirect observations. Each observation (a \"trace\") is the unordered set of nodes which are activated along a path through the network. Since a trace does not convey information about the order of nodes within the path, there are many feasible orders for each trace observed, and thus the problem of inferring the network from traces is, in general, illposed. We propose and analyze an algorithm which inserts edges by ordering each trace into a path according to which pairs of nodes in the path co-occur most frequently ","authors_text":"Michael Rabbat, Vincent Gripon","cross_cats":["cs.IR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-29T13:13:02Z","title":"Reconstructing a Graph from Path Traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6916","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:c63324878857180ab212913ab30b5401347bb168e15d61aa5abc2d6417e14a5d","target":"record","created_at":"2026-05-18T03:35: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":"315d1664f7a0805198d72bf749e7f71f92127e4617a7dc4104ff1b2f0781be24","cross_cats_sorted":["cs.IR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-29T13:13:02Z","title_canon_sha256":"c443bb601d6d7a91e3baa08cb48b7cedc14b157a7321479474f3f33b2aaff286"},"schema_version":"1.0","source":{"id":"1301.6916","kind":"arxiv","version":1}},"canonical_sha256":"4dc745e1479d22ef3da7c5e3cde1ae1c0108eace324bf14c6028ff543ae18bc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dc745e1479d22ef3da7c5e3cde1ae1c0108eace324bf14c6028ff543ae18bc5","first_computed_at":"2026-05-18T03:35:11.923943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:11.923943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jik61zON/es0jMaBHbhD5QtZLzcYZlx8XqxxHK6z4FMh/q3RSy/IxaSvQhZxUvqd+iZxl6KGNq8eBtFkUWoQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:11.924709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c63324878857180ab212913ab30b5401347bb168e15d61aa5abc2d6417e14a5d","sha256:4d6d120024c55703024fd5b3c3238c4da8f2dc3095dfa1a80cfe5f1528c152e4"],"state_sha256":"5e483da15568fc06c0892c41b5d45b892ec5847cf7bd539b81a1d212b9d77ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyaN+grahdV+u8O6+brEI2tHCvCNKvONH02gEX3BmADpOyCfe8bj7bNVSFw7Aj5wWVj9DnrjlutkqTy4pN2tAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T01:01:10.890501Z","bundle_sha256":"1150906ad3d279c61bbc031fde8b2be8de1a3177f5eb98fceb7e54574fee0d4f"}}