{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2N6NT53NA4RGI4SJFKGNRDMO3M","short_pith_number":"pith:2N6NT53N","canonical_record":{"source":{"id":"1310.0516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T23:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"0102023e3fdf76dc054b4e9a81afb8c53f6d310602a795cbc64bd00be8293429","abstract_canon_sha256":"1dd8ee1d6ddbf6b90e05757ab9ab9c9b934f226cf500a6022f22f1af54a6a331"},"schema_version":"1.0"},"canonical_sha256":"d37cd9f76d07226472492a8cd88d8edb06500d3852e371fc038dd21ab08ad715","source":{"kind":"arxiv","id":"1310.0516","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0516","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0516v2","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0516","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"2N6NT53NA4RG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2N6NT53NA4RGI4SJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2N6NT53N","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2N6NT53NA4RGI4SJFKGNRDMO3M","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0516","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T23:02:20Z","cross_cats_sorted":[],"title_canon_sha256":"0102023e3fdf76dc054b4e9a81afb8c53f6d310602a795cbc64bd00be8293429","abstract_canon_sha256":"1dd8ee1d6ddbf6b90e05757ab9ab9c9b934f226cf500a6022f22f1af54a6a331"},"schema_version":"1.0"},"canonical_sha256":"d37cd9f76d07226472492a8cd88d8edb06500d3852e371fc038dd21ab08ad715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:24.897762Z","signature_b64":"rUoCynKzUXrKTudF51uj1ozjlgwE0iR6heXWueKv+eAr3QaBIXaymOreo8GTlcGOCN4FjG68errlywTnNeYbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d37cd9f76d07226472492a8cd88d8edb06500d3852e371fc038dd21ab08ad715","last_reissued_at":"2026-05-18T01:04:24.897152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:24.897152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0516","source_version":2,"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-18T01:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esE5r0K7nAAGIx0UH9V/I/6qodO0hdTk5MmagqRK5SynvQnsn+OoZ6ukqyOWxmFSFbyPfDI2gnf5GsOkyHcwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:08:47.562302Z"},"content_sha256":"f7b65f0b511c834fc494694120763209bd13e054632f9b85375f291f72816598","schema_version":"1.0","event_id":"sha256:f7b65f0b511c834fc494694120763209bd13e054632f9b85375f291f72816598"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2N6NT53NA4RGI4SJFKGNRDMO3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topological orderings of weighted directed acyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Cory Palmer, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2013-10-01T23:02:20Z","abstract_excerpt":"We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological orderings of weighted directed acyclic graphs. The first process is called a mark sequence and the second is a generalization called a mark-unmark sequence. We answer a question of Erickson by showing that every non-negative topological ordering that can be realized by a mark-unmark sequence can also be realized by a mark sequence. We also investigate the quest"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0516","kind":"arxiv","version":2},"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-18T01:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"804dFgg7oSC0ItWp8l9sF0xAyZtLLft/eWtEW/TbcyWSAow0gCh14uorK2zJ5MGhRqPx+dOQknR3J+7QrlA1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:08:47.562901Z"},"content_sha256":"4f3f15eda5bb744720a865eb3159cf14ef8f89f6ba20f4dcd01619a87bd68a13","schema_version":"1.0","event_id":"sha256:4f3f15eda5bb744720a865eb3159cf14ef8f89f6ba20f4dcd01619a87bd68a13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/bundle.json","state_url":"https://pith.science/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/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-04T23:08:47Z","links":{"resolver":"https://pith.science/pith/2N6NT53NA4RGI4SJFKGNRDMO3M","bundle":"https://pith.science/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/bundle.json","state":"https://pith.science/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2N6NT53NA4RGI4SJFKGNRDMO3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2N6NT53NA4RGI4SJFKGNRDMO3M","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":"1dd8ee1d6ddbf6b90e05757ab9ab9c9b934f226cf500a6022f22f1af54a6a331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T23:02:20Z","title_canon_sha256":"0102023e3fdf76dc054b4e9a81afb8c53f6d310602a795cbc64bd00be8293429"},"schema_version":"1.0","source":{"id":"1310.0516","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0516","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0516v2","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0516","created_at":"2026-05-18T01:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"2N6NT53NA4RG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2N6NT53NA4RGI4SJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2N6NT53N","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:4f3f15eda5bb744720a865eb3159cf14ef8f89f6ba20f4dcd01619a87bd68a13","target":"graph","created_at":"2026-05-18T01:04:24Z","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":"We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological orderings of weighted directed acyclic graphs. The first process is called a mark sequence and the second is a generalization called a mark-unmark sequence. We answer a question of Erickson by showing that every non-negative topological ordering that can be realized by a mark-unmark sequence can also be realized by a mark sequence. We also investigate the quest","authors_text":"Bal\\'azs Keszegh, Cory Palmer, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T23:02:20Z","title":"Topological orderings of weighted directed acyclic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0516","kind":"arxiv","version":2},"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:f7b65f0b511c834fc494694120763209bd13e054632f9b85375f291f72816598","target":"record","created_at":"2026-05-18T01:04:24Z","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":"1dd8ee1d6ddbf6b90e05757ab9ab9c9b934f226cf500a6022f22f1af54a6a331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T23:02:20Z","title_canon_sha256":"0102023e3fdf76dc054b4e9a81afb8c53f6d310602a795cbc64bd00be8293429"},"schema_version":"1.0","source":{"id":"1310.0516","kind":"arxiv","version":2}},"canonical_sha256":"d37cd9f76d07226472492a8cd88d8edb06500d3852e371fc038dd21ab08ad715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d37cd9f76d07226472492a8cd88d8edb06500d3852e371fc038dd21ab08ad715","first_computed_at":"2026-05-18T01:04:24.897152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:24.897152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rUoCynKzUXrKTudF51uj1ozjlgwE0iR6heXWueKv+eAr3QaBIXaymOreo8GTlcGOCN4FjG68errlywTnNeYbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:24.897762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0516","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7b65f0b511c834fc494694120763209bd13e054632f9b85375f291f72816598","sha256:4f3f15eda5bb744720a865eb3159cf14ef8f89f6ba20f4dcd01619a87bd68a13"],"state_sha256":"f7bb22316d4690634b2a218654deae818f31d3bc327a50723f84f9d3fb235ab6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTAmCc6XcQddnRlsM/3ywiGswPF+N27jSHKQpwdrF/2P8b7erHbwIXPcWqJT35FZyARIwBAJbl1wUNm6DFsOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:08:47.566279Z","bundle_sha256":"5575ca4b17dc0eccda5e6eb7cecd0c188e049849eb37dd5651b69c631c8136b7"}}