{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VWLF2JWFPYM7WJGVM4GQTCUGWI","short_pith_number":"pith:VWLF2JWF","canonical_record":{"source":{"id":"2305.08628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-05-15T13:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"ee82922efc13ac1dda85fa6f69c75319d8df44f747716a74d75cdb11caae2afd","abstract_canon_sha256":"6826e6d055e396e245c3aeb270281e51322ec6cfe13970ac37d0b8843425c72b"},"schema_version":"1.0"},"canonical_sha256":"ad965d26c57e19fb24d5670d098a86b2243aa757a6ad50c85f51356860bcefc7","source":{"kind":"arxiv","id":"2305.08628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.08628","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"arxiv_version","alias_value":"2305.08628v1","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08628","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_12","alias_value":"VWLF2JWFPYM7","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWLF2JWFPYM7WJGV","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWLF2JWF","created_at":"2026-07-05T06:10:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VWLF2JWFPYM7WJGVM4GQTCUGWI","target":"record","payload":{"canonical_record":{"source":{"id":"2305.08628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-05-15T13:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"ee82922efc13ac1dda85fa6f69c75319d8df44f747716a74d75cdb11caae2afd","abstract_canon_sha256":"6826e6d055e396e245c3aeb270281e51322ec6cfe13970ac37d0b8843425c72b"},"schema_version":"1.0"},"canonical_sha256":"ad965d26c57e19fb24d5670d098a86b2243aa757a6ad50c85f51356860bcefc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:10:04.145980Z","signature_b64":"9CnKBHD6nuT0YdtZmthjCBoKcaS7Tj6yBEA+yX0hMuniErnz9JXXpwwn+Yy8nDEObeHk9Rj36KUrzfnhJ9YJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad965d26c57e19fb24d5670d098a86b2243aa757a6ad50c85f51356860bcefc7","last_reissued_at":"2026-07-05T06:10:04.145434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:10:04.145434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.08628","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-07-05T06:10:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPIF9sS0rWihWH6k80QOIrqVwF5zJ8R+j2BF6KvSrFMpDLK/B9rfaxm8+yP2+/+pP/ikUVY4hj2+qRlbTLG4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:56.126297Z"},"content_sha256":"97c3475c037c4c8f19b08b17aa568d0092c1a89ecb042cbeda5e6bc879688a84","schema_version":"1.0","event_id":"sha256:97c3475c037c4c8f19b08b17aa568d0092c1a89ecb042cbeda5e6bc879688a84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VWLF2JWFPYM7WJGVM4GQTCUGWI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Separable Multi-Dimensional Network Flows for Visual Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Cremers, Florian Bernard, Viktoria Ehm","submitted_at":"2023-05-15T13:21:44Z","abstract_excerpt":"Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example, oftentimes high-dimensional data (e.g. feature descriptors) are mapped to a single scalar value (e.g. the similarity between two feature descriptors). To overcome this limitation, we propose a novel formalism for non-separable multi-dimensional network flows. By doing so, we enable an automatic and adaptive feature selection strategy - since the flow is defined on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08628","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.08628/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:10:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfGwE1hxwuK1RubzaeHHaDFuUSj687rAXG+xk4w4kHg/jmGOPv5Sptos54/pCZM1NSFh2mZNSPCz9AaPnUjLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:56.126806Z"},"content_sha256":"645d3b11723d8b12a1886d12bbb5cc7e2bd299c48b1ddc248be283505fb8d536","schema_version":"1.0","event_id":"sha256:645d3b11723d8b12a1886d12bbb5cc7e2bd299c48b1ddc248be283505fb8d536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/bundle.json","state_url":"https://pith.science/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/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-08-24T01:10:56Z","links":{"resolver":"https://pith.science/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI","bundle":"https://pith.science/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/bundle.json","state":"https://pith.science/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWLF2JWFPYM7WJGVM4GQTCUGWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VWLF2JWFPYM7WJGVM4GQTCUGWI","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":"6826e6d055e396e245c3aeb270281e51322ec6cfe13970ac37d0b8843425c72b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-05-15T13:21:44Z","title_canon_sha256":"ee82922efc13ac1dda85fa6f69c75319d8df44f747716a74d75cdb11caae2afd"},"schema_version":"1.0","source":{"id":"2305.08628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.08628","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"arxiv_version","alias_value":"2305.08628v1","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08628","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_12","alias_value":"VWLF2JWFPYM7","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_16","alias_value":"VWLF2JWFPYM7WJGV","created_at":"2026-07-05T06:10:04Z"},{"alias_kind":"pith_short_8","alias_value":"VWLF2JWF","created_at":"2026-07-05T06:10:04Z"}],"graph_snapshots":[{"event_id":"sha256:645d3b11723d8b12a1886d12bbb5cc7e2bd299c48b1ddc248be283505fb8d536","target":"graph","created_at":"2026-07-05T06:10:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.08628/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example, oftentimes high-dimensional data (e.g. feature descriptors) are mapped to a single scalar value (e.g. the similarity between two feature descriptors). To overcome this limitation, we propose a novel formalism for non-separable multi-dimensional network flows. By doing so, we enable an automatic and adaptive feature selection strategy - since the flow is defined on ","authors_text":"Daniel Cremers, Florian Bernard, Viktoria Ehm","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-05-15T13:21:44Z","title":"Non-Separable Multi-Dimensional Network Flows for Visual Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08628","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:97c3475c037c4c8f19b08b17aa568d0092c1a89ecb042cbeda5e6bc879688a84","target":"record","created_at":"2026-07-05T06:10:04Z","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":"6826e6d055e396e245c3aeb270281e51322ec6cfe13970ac37d0b8843425c72b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-05-15T13:21:44Z","title_canon_sha256":"ee82922efc13ac1dda85fa6f69c75319d8df44f747716a74d75cdb11caae2afd"},"schema_version":"1.0","source":{"id":"2305.08628","kind":"arxiv","version":1}},"canonical_sha256":"ad965d26c57e19fb24d5670d098a86b2243aa757a6ad50c85f51356860bcefc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad965d26c57e19fb24d5670d098a86b2243aa757a6ad50c85f51356860bcefc7","first_computed_at":"2026-07-05T06:10:04.145434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:10:04.145434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9CnKBHD6nuT0YdtZmthjCBoKcaS7Tj6yBEA+yX0hMuniErnz9JXXpwwn+Yy8nDEObeHk9Rj36KUrzfnhJ9YJCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:10:04.145980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.08628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97c3475c037c4c8f19b08b17aa568d0092c1a89ecb042cbeda5e6bc879688a84","sha256:645d3b11723d8b12a1886d12bbb5cc7e2bd299c48b1ddc248be283505fb8d536"],"state_sha256":"ad5d2b18017694becd863dba92474f1fbc42149bb1be95c882d087b7779b00dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKJxHvvDaY4NG1Ur67+yfiNL2e/RsnYplMXaNhA5/xrM98OPeitUzk6pGr02UuA0uKETbTZqIukTTMytzoagCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T01:10:56.131723Z","bundle_sha256":"8d6a3f8ce8623007dcd60ea00af0571547913bcdbf7b5e52f1b3d0face4f31b6"}}