{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:76OEXLUKVF7U7ZVKMOX7V4632E","short_pith_number":"pith:76OEXLUK","canonical_record":{"source":{"id":"1708.07592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-08-25T01:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"76f6ad8740b1fd4816063d54be3d9433c8c601943b85436d48e21e3272838375","abstract_canon_sha256":"c36ca1c9d7b1dbf2e4ad64412475b3e36750b32ae2b93acbefaf5ceb23ee891f"},"schema_version":"1.0"},"canonical_sha256":"ff9c4bae8aa97f4fe6aa63affaf3dbd12fe4134caac72dc864e6ad902d3e57e5","source":{"kind":"arxiv","id":"1708.07592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07592","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07592v1","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07592","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"76OEXLUKVF7U","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76OEXLUKVF7U7ZVK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76OEXLUK","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:76OEXLUKVF7U7ZVKMOX7V4632E","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-08-25T01:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"76f6ad8740b1fd4816063d54be3d9433c8c601943b85436d48e21e3272838375","abstract_canon_sha256":"c36ca1c9d7b1dbf2e4ad64412475b3e36750b32ae2b93acbefaf5ceb23ee891f"},"schema_version":"1.0"},"canonical_sha256":"ff9c4bae8aa97f4fe6aa63affaf3dbd12fe4134caac72dc864e6ad902d3e57e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:42.621494Z","signature_b64":"zMYFut86EYjfs5tFVLH3VVx1Gpj371MhiAahjA373VbIRAbGm/ktOu3a8scpGhfdk8rH50mnJGSnMspBOP6QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff9c4bae8aa97f4fe6aa63affaf3dbd12fe4134caac72dc864e6ad902d3e57e5","last_reissued_at":"2026-05-18T00:36:42.620870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:42.620870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07592","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-18T00:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wst4ZhJZWDFpEolWWvHuUdmhAklBp2Ovxo72n1bHXXn5nwKT3giheXyRtRCx6RjQhZ8Ko+7+s1nspZY8sQW3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:02:06.606392Z"},"content_sha256":"3b23a26e28a3b04d7f7bae8654c6a0755bb6dd9e6bdb9d52348628892b1dc172","schema_version":"1.0","event_id":"sha256:3b23a26e28a3b04d7f7bae8654c6a0755bb6dd9e6bdb9d52348628892b1dc172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:76OEXLUKVF7U7ZVKMOX7V4632E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Decision Model for Inference and Prediction on Non-Uniform Hypergraphs with Application to Knot Matching from Computational Forestry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Alexandre Bouchard-C\\^ot\\'e, James V. Zidek, Samuel W.K. Wong, Seong-Hwan Jun","submitted_at":"2017-08-25T01:12:37Z","abstract_excerpt":"In this paper, we consider the knot matching problem arising in computational forestry. The knot matching problem is an important problem that needs to be solved to advance the state of the art in automatic strength prediction of lumber. We show that this problem can be formulated as a quadripartite matching problem and develop a sequential decision model that admits efficient parameter estimation along with a sequential Monte Carlo sampler on graph matching that can be utilized for rapid sampling of graph matching. We demonstrate the effectiveness of our methods on 30 manually annotated board"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07592","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-18T00:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRG0vVzBCIY0CEQeu+J6sAoDOb8wdKS9Cxpc/71gSAQJTzjknB2k5k90YGUvkMaC+DHs6bvUQpjjveGhNe3fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:02:06.606782Z"},"content_sha256":"71bafd500ddd840ae3ecc93abe2645240c8caf3e637423fb77bd906a63d7756a","schema_version":"1.0","event_id":"sha256:71bafd500ddd840ae3ecc93abe2645240c8caf3e637423fb77bd906a63d7756a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76OEXLUKVF7U7ZVKMOX7V4632E/bundle.json","state_url":"https://pith.science/pith/76OEXLUKVF7U7ZVKMOX7V4632E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76OEXLUKVF7U7ZVKMOX7V4632E/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-31T13:02:06Z","links":{"resolver":"https://pith.science/pith/76OEXLUKVF7U7ZVKMOX7V4632E","bundle":"https://pith.science/pith/76OEXLUKVF7U7ZVKMOX7V4632E/bundle.json","state":"https://pith.science/pith/76OEXLUKVF7U7ZVKMOX7V4632E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76OEXLUKVF7U7ZVKMOX7V4632E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:76OEXLUKVF7U7ZVKMOX7V4632E","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":"c36ca1c9d7b1dbf2e4ad64412475b3e36750b32ae2b93acbefaf5ceb23ee891f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-08-25T01:12:37Z","title_canon_sha256":"76f6ad8740b1fd4816063d54be3d9433c8c601943b85436d48e21e3272838375"},"schema_version":"1.0","source":{"id":"1708.07592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07592","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07592v1","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07592","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"76OEXLUKVF7U","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"76OEXLUKVF7U7ZVK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"76OEXLUK","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:71bafd500ddd840ae3ecc93abe2645240c8caf3e637423fb77bd906a63d7756a","target":"graph","created_at":"2026-05-18T00:36:42Z","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 knot matching problem arising in computational forestry. The knot matching problem is an important problem that needs to be solved to advance the state of the art in automatic strength prediction of lumber. We show that this problem can be formulated as a quadripartite matching problem and develop a sequential decision model that admits efficient parameter estimation along with a sequential Monte Carlo sampler on graph matching that can be utilized for rapid sampling of graph matching. We demonstrate the effectiveness of our methods on 30 manually annotated board","authors_text":"Alexandre Bouchard-C\\^ot\\'e, James V. Zidek, Samuel W.K. Wong, Seong-Hwan Jun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-08-25T01:12:37Z","title":"Sequential Decision Model for Inference and Prediction on Non-Uniform Hypergraphs with Application to Knot Matching from Computational Forestry"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07592","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:3b23a26e28a3b04d7f7bae8654c6a0755bb6dd9e6bdb9d52348628892b1dc172","target":"record","created_at":"2026-05-18T00:36:42Z","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":"c36ca1c9d7b1dbf2e4ad64412475b3e36750b32ae2b93acbefaf5ceb23ee891f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2017-08-25T01:12:37Z","title_canon_sha256":"76f6ad8740b1fd4816063d54be3d9433c8c601943b85436d48e21e3272838375"},"schema_version":"1.0","source":{"id":"1708.07592","kind":"arxiv","version":1}},"canonical_sha256":"ff9c4bae8aa97f4fe6aa63affaf3dbd12fe4134caac72dc864e6ad902d3e57e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff9c4bae8aa97f4fe6aa63affaf3dbd12fe4134caac72dc864e6ad902d3e57e5","first_computed_at":"2026-05-18T00:36:42.620870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:42.620870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zMYFut86EYjfs5tFVLH3VVx1Gpj371MhiAahjA373VbIRAbGm/ktOu3a8scpGhfdk8rH50mnJGSnMspBOP6QAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:42.621494Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b23a26e28a3b04d7f7bae8654c6a0755bb6dd9e6bdb9d52348628892b1dc172","sha256:71bafd500ddd840ae3ecc93abe2645240c8caf3e637423fb77bd906a63d7756a"],"state_sha256":"15ccf36e775892690827b42fcb7e5b1a8ea9bff426dfde778568c46085b74f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtIu5OSdDnsFDcGvqL33UhQyclziP9U8W1uZ3FX3bcKi9j8wo3R3l/z8YB1hu60JsgPj1E2UHLVRV9FJkP6mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:02:06.609467Z","bundle_sha256":"9b41fd15390457e0e524dc72c249800eecd211e13d858be0cfaf7fd10888d444"}}