{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2IJZWTLYVT7LQVDYW3T5FGIR35","short_pith_number":"pith:2IJZWTLY","schema_version":"1.0","canonical_sha256":"d2139b4d78acfeb85478b6e7d29911df67dbf040f9431903330de1275aca811b","source":{"kind":"arxiv","id":"1505.00581","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.00581","created_at":"2026-05-18T02:17:02.497010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00581v1","created_at":"2026-05-18T02:17:02.497010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00581","created_at":"2026-05-18T02:17:02.497010+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IJZWTLYVT7L","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IJZWTLYVT7LQVDY","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IJZWTLY","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35","json":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35.json","graph_json":"https://pith.science/api/pith-number/2IJZWTLYVT7LQVDYW3T5FGIR35/graph.json","events_json":"https://pith.science/api/pith-number/2IJZWTLYVT7LQVDYW3T5FGIR35/events.json","paper":"https://pith.science/paper/2IJZWTLY"},"agent_actions":{"view_html":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35","download_json":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35.json","view_paper":"https://pith.science/paper/2IJZWTLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00581&json=true","fetch_graph":"https://pith.science/api/pith-number/2IJZWTLYVT7LQVDYW3T5FGIR35/graph.json","fetch_events":"https://pith.science/api/pith-number/2IJZWTLYVT7LQVDYW3T5FGIR35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/action/storage_attestation","attest_author":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/action/author_attestation","sign_citation":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/action/citation_signature","submit_replication":"https://pith.science/pith/2IJZWTLYVT7LQVDYW3T5FGIR35/action/replication_record"}},"created_at":"2026-05-18T02:17:02.497010+00:00","updated_at":"2026-05-18T02:17:02.497010+00:00"}