{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2IJZWTLYVT7LQVDYW3T5FGIR35","short_pith_number":"pith:2IJZWTLY","canonical_record":{"source":{"id":"1505.00581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-04T10:30:47Z","cross_cats_sorted":[],"title_canon_sha256":"9f468aeecf49bb708aa3446888b2a8cf4d587697328e4c6ba7c52c2b467055d2","abstract_canon_sha256":"06fcb65d0d16ac48fdc1821be3a5ec15bd027135a75239c257fe7110ad5a30d1"},"schema_version":"1.0"},"canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","source":{"kind":"arxiv","id":"1505.00581","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00581","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00581v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00581","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"2IJZWTLYVT7L","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2IJZWTLYVT7LQVDY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2IJZWTLY","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2IJZWTLYVT7LQVDYW3T5FGIR35","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-04T10:30:47Z","cross_cats_sorted":[],"title_canon_sha256":"9f468aeecf49bb708aa3446888b2a8cf4d587697328e4c6ba7c52c2b467055d2","abstract_canon_sha256":"06fcb65d0d16ac48fdc1821be3a5ec15bd027135a75239c257fe7110ad5a30d1"},"schema_version":"1.0"},"canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:02.497667Z","signature_b64":"kcAE3sNW2i97R3/2n1OXxtnX+ioYAl1n/ERkBgtC2sAeQ9o/3ulxr3eRJE9lC0VarXQmmdgKUbOW9Q00MXIrCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","last_reissued_at":"2026-05-18T02:17:02.496880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:02.496880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00581","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2S/9t8XbWsahwsuGmRlJbeirVZpJgExTSM+nuSAPsGNQWTQ9LhkvhapEF/Nt8i5jS8+EvHkDE05yPQTEDx90Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:34:28.750088Z"},"content_sha256":"d9ba167165c7420fdfe4919621d9cd344073cabca0666c27fa6951ec30ffaa0f","schema_version":"1.0","event_id":"sha256:d9ba167165c7420fdfe4919621d9cd344073cabca0666c27fa6951ec30ffaa0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2IJZWTLYVT7LQVDYW3T5FGIR35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Activity recognition from videos with parallel hypergraph matching on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"B\\\"ulent Sankur, Christian Wolf, Eric Lombardi, Oya Celiktutan","submitted_at":"2015-05-04T10:30:47Z","abstract_excerpt":"In this paper, we propose a method for activity recognition from videos based on sparse local features and hypergraph matching. We benefit from special properties of the temporal domain in the data to derive a sequential and fast graph matching algorithm for GPUs.\n  Traditionally, graphs and hypergraphs are frequently used to recognize complex and often non-rigid patterns in computer vision, either through graph matching or point-set matching with graphs. Most formulations resort to the minimization of a difficult discrete energy function mixing geometric or structural terms with data attached"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00581","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-18T02:17:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6HAx+dSJQ28zTRAh1zUPmcSTyNx4LqWcQyEDcC5P4EADjUg7KR7HgMP+TE4CvqANGdtON3W5JTJ4pko0TodUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:34:28.750649Z"},"content_sha256":"2b2c44a4a7e4115fd6db2d8d5a3acd5557efedb0dd46d178aa14c2f88440e1d8","schema_version":"1.0","event_id":"sha256:2b2c44a4a7e4115fd6db2d8d5a3acd5557efedb0dd46d178aa14c2f88440e1d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/bundle.json","state_url":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/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-02T04:34:28Z","links":{"resolver":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35","bundle":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/bundle.json","state":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2IJZWTLYVT7LQVDYW3T5FGIR35","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":"06fcb65d0d16ac48fdc1821be3a5ec15bd027135a75239c257fe7110ad5a30d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-04T10:30:47Z","title_canon_sha256":"9f468aeecf49bb708aa3446888b2a8cf4d587697328e4c6ba7c52c2b467055d2"},"schema_version":"1.0","source":{"id":"1505.00581","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00581","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00581v1","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00581","created_at":"2026-05-18T02:17:02Z"},{"alias_kind":"pith_short_12","alias_value":"2IJZWTLYVT7L","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2IJZWTLYVT7LQVDY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2IJZWTLY","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:2b2c44a4a7e4115fd6db2d8d5a3acd5557efedb0dd46d178aa14c2f88440e1d8","target":"graph","created_at":"2026-05-18T02:17:02Z","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 propose a method for activity recognition from videos based on sparse local features and hypergraph matching. We benefit from special properties of the temporal domain in the data to derive a sequential and fast graph matching algorithm for GPUs.\n  Traditionally, graphs and hypergraphs are frequently used to recognize complex and often non-rigid patterns in computer vision, either through graph matching or point-set matching with graphs. Most formulations resort to the minimization of a difficult discrete energy function mixing geometric or structural terms with data attached","authors_text":"B\\\"ulent Sankur, Christian Wolf, Eric Lombardi, Oya Celiktutan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-04T10:30:47Z","title":"Activity recognition from videos with parallel hypergraph matching on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00581","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:d9ba167165c7420fdfe4919621d9cd344073cabca0666c27fa6951ec30ffaa0f","target":"record","created_at":"2026-05-18T02:17:02Z","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":"06fcb65d0d16ac48fdc1821be3a5ec15bd027135a75239c257fe7110ad5a30d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-05-04T10:30:47Z","title_canon_sha256":"9f468aeecf49bb708aa3446888b2a8cf4d587697328e4c6ba7c52c2b467055d2"},"schema_version":"1.0","source":{"id":"1505.00581","kind":"arxiv","version":1}},"canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","first_computed_at":"2026-05-18T02:17:02.496880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:02.496880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kcAE3sNW2i97R3/2n1OXxtnX+ioYAl1n/ERkBgtC2sAeQ9o/3ulxr3eRJE9lC0VarXQmmdgKUbOW9Q00MXIrCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:02.497667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00581","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9ba167165c7420fdfe4919621d9cd344073cabca0666c27fa6951ec30ffaa0f","sha256:2b2c44a4a7e4115fd6db2d8d5a3acd5557efedb0dd46d178aa14c2f88440e1d8"],"state_sha256":"b5d8bfeb3143722edf5fa136739fa5319e4ee4731744c24fb2ba223a00b95cfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cpx0OyPoqKnAXluuIdKSUOJEhEozMTRzXAOk9bpHx5+1KP3IeRbnflZOEP8N1K6wtskntAY1ccL4u+inOhfWBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:34:28.753435Z","bundle_sha256":"36e01c4fb9f0af40badfe2edc39cb086af93f8bc513db237b80cbb6ff7e1dedd"}}